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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:08,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:08,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:08,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:08,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:08,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:08,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:08,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:08,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:08,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:08,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:08,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:08,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:08,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:08,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:08,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:08,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:08,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:08,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:08,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:08,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:08,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:08,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:08,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:08,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:08,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:08,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:08,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:08,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:08,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:08,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:08,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:08,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:08,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:08,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:08,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:08,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:08,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:08,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:08,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:08,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:08,517 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-15 01:11:08,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:08,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:08,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:08,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:08,538 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:08,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:08,538 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:08,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:08,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:08,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:08,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:08,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:08,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:08,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:08,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:08,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:08,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:08,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:08,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:08,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:08,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:08,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:08,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:08,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:08,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:08,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:08,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:08,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:08,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:11:08,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:08,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:08,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:08,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:08,826 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:08,826 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c [2019-10-15 01:11:08,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a278e18/4271346d0f87459c9e307dd1ca7a6adf/FLAGaf3e51f83 [2019-10-15 01:11:09,507 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:09,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c [2019-10-15 01:11:09,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a278e18/4271346d0f87459c9e307dd1ca7a6adf/FLAGaf3e51f83 [2019-10-15 01:11:09,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a278e18/4271346d0f87459c9e307dd1ca7a6adf [2019-10-15 01:11:09,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:09,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:09,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:09,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:09,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:09,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:09" (1/1) ... [2019-10-15 01:11:09,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a82784d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:09, skipping insertion in model container [2019-10-15 01:11:09,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:09" (1/1) ... [2019-10-15 01:11:09,753 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:09,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:10,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:10,536 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:10,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:10,748 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:10,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10 WrapperNode [2019-10-15 01:11:10,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:10,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:10,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:10,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:10,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:10,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:10,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:10,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:10,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (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-15 01:11:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:11,033 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:11:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:11:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:11,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:11,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:11,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:11,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:11:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:11:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:11:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:11:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:11:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:11:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:11:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:11:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:11:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:11:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:11,078 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:11,078 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:11,078 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:11:11,078 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:11,079 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:11,079 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:11,079 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:11:11,079 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:11,079 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:13,356 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:13,356 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:13,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:13 BoogieIcfgContainer [2019-10-15 01:11:13,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:13,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:13,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:13,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:13,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:09" (1/3) ... [2019-10-15 01:11:13,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fe65db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:13, skipping insertion in model container [2019-10-15 01:11:13,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (2/3) ... [2019-10-15 01:11:13,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fe65db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:13, skipping insertion in model container [2019-10-15 01:11:13,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:13" (3/3) ... [2019-10-15 01:11:13,365 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product31.cil.c [2019-10-15 01:11:13,374 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:13,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:13,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:13,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:13,425 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:13,425 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:13,425 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:13,425 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:13,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:13,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:13,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states. [2019-10-15 01:11:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:11:13,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:13,518 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:13,520 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash -734738765, now seen corresponding path program 1 times [2019-10-15 01:11:13,537 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:13,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909942070] [2019-10-15 01:11:13,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:13,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:13,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:14,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909942070] [2019-10-15 01:11:14,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:14,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:14,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664157113] [2019-10-15 01:11:14,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:14,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:14,253 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 7 states. [2019-10-15 01:11:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:14,568 INFO L93 Difference]: Finished difference Result 1353 states and 2166 transitions. [2019-10-15 01:11:14,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:14,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-15 01:11:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:14,608 INFO L225 Difference]: With dead ends: 1353 [2019-10-15 01:11:14,608 INFO L226 Difference]: Without dead ends: 685 [2019-10-15 01:11:14,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-15 01:11:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2019-10-15 01:11:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-10-15 01:11:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1078 transitions. [2019-10-15 01:11:14,763 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1078 transitions. Word has length 141 [2019-10-15 01:11:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:14,763 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 1078 transitions. [2019-10-15 01:11:14,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1078 transitions. [2019-10-15 01:11:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:14,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:14,774 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:14,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash -843585886, now seen corresponding path program 1 times [2019-10-15 01:11:14,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:14,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835900342] [2019-10-15 01:11:14,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:14,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:14,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:15,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835900342] [2019-10-15 01:11:15,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:15,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:15,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009746328] [2019-10-15 01:11:15,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:15,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:15,094 INFO L87 Difference]: Start difference. First operand 683 states and 1078 transitions. Second operand 4 states. [2019-10-15 01:11:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,178 INFO L93 Difference]: Finished difference Result 1332 states and 2121 transitions. [2019-10-15 01:11:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:15,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-15 01:11:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,190 INFO L225 Difference]: With dead ends: 1332 [2019-10-15 01:11:15,190 INFO L226 Difference]: Without dead ends: 665 [2019-10-15 01:11:15,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-10-15 01:11:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2019-10-15 01:11:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-10-15 01:11:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1045 transitions. [2019-10-15 01:11:15,246 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1045 transitions. Word has length 142 [2019-10-15 01:11:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 1045 transitions. [2019-10-15 01:11:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1045 transitions. [2019-10-15 01:11:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:15,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,257 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,257 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -71062830, now seen corresponding path program 1 times [2019-10-15 01:11:15,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298492927] [2019-10-15 01:11:15,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:15,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298492927] [2019-10-15 01:11:15,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:15,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:15,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066706683] [2019-10-15 01:11:15,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:15,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:15,494 INFO L87 Difference]: Start difference. First operand 665 states and 1045 transitions. Second operand 7 states. [2019-10-15 01:11:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,593 INFO L93 Difference]: Finished difference Result 1301 states and 2063 transitions. [2019-10-15 01:11:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:15,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-15 01:11:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,599 INFO L225 Difference]: With dead ends: 1301 [2019-10-15 01:11:15,599 INFO L226 Difference]: Without dead ends: 659 [2019-10-15 01:11:15,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-15 01:11:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-10-15 01:11:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-15 01:11:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1032 transitions. [2019-10-15 01:11:15,682 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1032 transitions. Word has length 142 [2019-10-15 01:11:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,683 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 1032 transitions. [2019-10-15 01:11:15,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1032 transitions. [2019-10-15 01:11:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:11:15,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,688 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,688 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,688 INFO L82 PathProgramCache]: Analyzing trace with hash 406921655, now seen corresponding path program 1 times [2019-10-15 01:11:15,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954132247] [2019-10-15 01:11:15,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:15,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954132247] [2019-10-15 01:11:15,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:15,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:15,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967903285] [2019-10-15 01:11:15,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:15,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:15,869 INFO L87 Difference]: Start difference. First operand 659 states and 1032 transitions. Second operand 7 states. [2019-10-15 01:11:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,973 INFO L93 Difference]: Finished difference Result 1289 states and 2037 transitions. [2019-10-15 01:11:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:15,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:11:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,982 INFO L225 Difference]: With dead ends: 1289 [2019-10-15 01:11:15,982 INFO L226 Difference]: Without dead ends: 653 [2019-10-15 01:11:15,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-15 01:11:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-10-15 01:11:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-15 01:11:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1019 transitions. [2019-10-15 01:11:16,019 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1019 transitions. Word has length 143 [2019-10-15 01:11:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,020 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 1019 transitions. [2019-10-15 01:11:16,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1019 transitions. [2019-10-15 01:11:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:11:16,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,025 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash -576561514, now seen corresponding path program 1 times [2019-10-15 01:11:16,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780758066] [2019-10-15 01:11:16,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:16,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780758066] [2019-10-15 01:11:16,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:16,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954840828] [2019-10-15 01:11:16,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:16,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:16,197 INFO L87 Difference]: Start difference. First operand 653 states and 1019 transitions. Second operand 7 states. [2019-10-15 01:11:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,341 INFO L93 Difference]: Finished difference Result 1277 states and 2011 transitions. [2019-10-15 01:11:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:16,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-15 01:11:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,359 INFO L225 Difference]: With dead ends: 1277 [2019-10-15 01:11:16,359 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:11:16,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:11:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-15 01:11:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:11:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1006 transitions. [2019-10-15 01:11:16,391 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1006 transitions. Word has length 144 [2019-10-15 01:11:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,391 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1006 transitions. [2019-10-15 01:11:16,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1006 transitions. [2019-10-15 01:11:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:11:16,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,396 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1815508329, now seen corresponding path program 1 times [2019-10-15 01:11:16,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078233013] [2019-10-15 01:11:16,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:16,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078233013] [2019-10-15 01:11:16,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:16,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100278954] [2019-10-15 01:11:16,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:16,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:16,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:16,564 INFO L87 Difference]: Start difference. First operand 647 states and 1006 transitions. Second operand 7 states. [2019-10-15 01:11:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,655 INFO L93 Difference]: Finished difference Result 1265 states and 1985 transitions. [2019-10-15 01:11:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:16,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-15 01:11:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,662 INFO L225 Difference]: With dead ends: 1265 [2019-10-15 01:11:16,662 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:11:16,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:11:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-15 01:11:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:11:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1005 transitions. [2019-10-15 01:11:16,697 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1005 transitions. Word has length 144 [2019-10-15 01:11:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,698 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1005 transitions. [2019-10-15 01:11:16,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1005 transitions. [2019-10-15 01:11:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:11:16,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,703 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 379098299, now seen corresponding path program 1 times [2019-10-15 01:11:16,705 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417784242] [2019-10-15 01:11:16,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:16,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417784242] [2019-10-15 01:11:16,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:16,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868246828] [2019-10-15 01:11:16,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:16,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:16,863 INFO L87 Difference]: Start difference. First operand 647 states and 1005 transitions. Second operand 5 states. [2019-10-15 01:11:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,939 INFO L93 Difference]: Finished difference Result 1264 states and 1982 transitions. [2019-10-15 01:11:16,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:16,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-15 01:11:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,944 INFO L225 Difference]: With dead ends: 1264 [2019-10-15 01:11:16,945 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:11:16,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:11:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-15 01:11:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:11:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1004 transitions. [2019-10-15 01:11:16,975 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1004 transitions. Word has length 145 [2019-10-15 01:11:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,976 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1004 transitions. [2019-10-15 01:11:16,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1004 transitions. [2019-10-15 01:11:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:11:17,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,040 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,041 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1077265188, now seen corresponding path program 1 times [2019-10-15 01:11:17,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73749187] [2019-10-15 01:11:17,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:17,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73749187] [2019-10-15 01:11:17,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:17,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632505178] [2019-10-15 01:11:17,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:17,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,179 INFO L87 Difference]: Start difference. First operand 647 states and 1004 transitions. Second operand 5 states. [2019-10-15 01:11:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,248 INFO L93 Difference]: Finished difference Result 1264 states and 1980 transitions. [2019-10-15 01:11:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:17,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-15 01:11:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,253 INFO L225 Difference]: With dead ends: 1264 [2019-10-15 01:11:17,254 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:11:17,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:11:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-15 01:11:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:11:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1003 transitions. [2019-10-15 01:11:17,281 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1003 transitions. Word has length 146 [2019-10-15 01:11:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,281 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1003 transitions. [2019-10-15 01:11:17,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1003 transitions. [2019-10-15 01:11:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:11:17,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,286 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1621721034, now seen corresponding path program 1 times [2019-10-15 01:11:17,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730867072] [2019-10-15 01:11:17,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:17,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730867072] [2019-10-15 01:11:17,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:17,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672168787] [2019-10-15 01:11:17,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:17,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,419 INFO L87 Difference]: Start difference. First operand 647 states and 1003 transitions. Second operand 5 states. [2019-10-15 01:11:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,507 INFO L93 Difference]: Finished difference Result 1264 states and 1978 transitions. [2019-10-15 01:11:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:17,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:11:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,515 INFO L225 Difference]: With dead ends: 1264 [2019-10-15 01:11:17,515 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:11:17,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:11:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-15 01:11:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:11:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1002 transitions. [2019-10-15 01:11:17,548 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1002 transitions. Word has length 147 [2019-10-15 01:11:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,549 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1002 transitions. [2019-10-15 01:11:17,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1002 transitions. [2019-10-15 01:11:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:11:17,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,556 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 333156215, now seen corresponding path program 1 times [2019-10-15 01:11:17,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423056264] [2019-10-15 01:11:17,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:17,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423056264] [2019-10-15 01:11:17,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:17,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977312013] [2019-10-15 01:11:17,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:17,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:17,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,809 INFO L87 Difference]: Start difference. First operand 647 states and 1002 transitions. Second operand 5 states. [2019-10-15 01:11:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,897 INFO L93 Difference]: Finished difference Result 1264 states and 1976 transitions. [2019-10-15 01:11:17,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:17,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-15 01:11:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,906 INFO L225 Difference]: With dead ends: 1264 [2019-10-15 01:11:17,906 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:11:17,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:11:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-15 01:11:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:11:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1001 transitions. [2019-10-15 01:11:17,958 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1001 transitions. Word has length 148 [2019-10-15 01:11:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,958 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1001 transitions. [2019-10-15 01:11:17,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1001 transitions. [2019-10-15 01:11:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:11:17,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,967 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,967 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019215, now seen corresponding path program 1 times [2019-10-15 01:11:17,968 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068579744] [2019-10-15 01:11:17,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:11:18,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068579744] [2019-10-15 01:11:18,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539724249] [2019-10-15 01:11:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:11:18,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:18,899 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:19,075 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:19,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:11:19,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068950326] [2019-10-15 01:11:19,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:19,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:19,077 INFO L87 Difference]: Start difference. First operand 647 states and 1001 transitions. Second operand 3 states. [2019-10-15 01:11:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,163 INFO L93 Difference]: Finished difference Result 1820 states and 2863 transitions. [2019-10-15 01:11:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:19,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:11:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,173 INFO L225 Difference]: With dead ends: 1820 [2019-10-15 01:11:19,173 INFO L226 Difference]: Without dead ends: 1207 [2019-10-15 01:11:19,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-10-15 01:11:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1194. [2019-10-15 01:11:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-10-15 01:11:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1865 transitions. [2019-10-15 01:11:19,232 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1865 transitions. Word has length 149 [2019-10-15 01:11:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,233 INFO L462 AbstractCegarLoop]: Abstraction has 1194 states and 1865 transitions. [2019-10-15 01:11:19,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1865 transitions. [2019-10-15 01:11:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:11:19,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,240 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:19,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:19,458 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1672242044, now seen corresponding path program 1 times [2019-10-15 01:11:19,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815348391] [2019-10-15 01:11:19,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:19,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815348391] [2019-10-15 01:11:19,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:19,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121714767] [2019-10-15 01:11:19,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:19,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:19,641 INFO L87 Difference]: Start difference. First operand 1194 states and 1865 transitions. Second operand 7 states. [2019-10-15 01:11:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,665 INFO L93 Difference]: Finished difference Result 3508 states and 5628 transitions. [2019-10-15 01:11:22,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:22,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-15 01:11:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,691 INFO L225 Difference]: With dead ends: 3508 [2019-10-15 01:11:22,691 INFO L226 Difference]: Without dead ends: 2348 [2019-10-15 01:11:22,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-10-15 01:11:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2282. [2019-10-15 01:11:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-10-15 01:11:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3635 transitions. [2019-10-15 01:11:22,954 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3635 transitions. Word has length 153 [2019-10-15 01:11:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,954 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 3635 transitions. [2019-10-15 01:11:22,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3635 transitions. [2019-10-15 01:11:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:11:22,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,961 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:22,961 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash 357872937, now seen corresponding path program 1 times [2019-10-15 01:11:22,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441468603] [2019-10-15 01:11:22,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:11:23,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441468603] [2019-10-15 01:11:23,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955647530] [2019-10-15 01:11:23,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:11:23,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:23,951 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:24,137 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:24,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:11:24,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430972547] [2019-10-15 01:11:24,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:24,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:24,140 INFO L87 Difference]: Start difference. First operand 2282 states and 3635 transitions. Second operand 3 states. [2019-10-15 01:11:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,344 INFO L93 Difference]: Finished difference Result 5632 states and 9054 transitions. [2019-10-15 01:11:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:24,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:11:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,370 INFO L225 Difference]: With dead ends: 5632 [2019-10-15 01:11:24,370 INFO L226 Difference]: Without dead ends: 3384 [2019-10-15 01:11:24,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2019-10-15 01:11:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3284. [2019-10-15 01:11:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3284 states. [2019-10-15 01:11:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 5247 transitions. [2019-10-15 01:11:24,562 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 5247 transitions. Word has length 150 [2019-10-15 01:11:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:24,564 INFO L462 AbstractCegarLoop]: Abstraction has 3284 states and 5247 transitions. [2019-10-15 01:11:24,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 5247 transitions. [2019-10-15 01:11:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:11:24,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:24,574 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:24,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:24,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1845400304, now seen corresponding path program 1 times [2019-10-15 01:11:24,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:24,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175609481] [2019-10-15 01:11:24,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:11:24,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175609481] [2019-10-15 01:11:24,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138503855] [2019-10-15 01:11:24,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 3086 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:25,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:25,581 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:25,681 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:25,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 11 [2019-10-15 01:11:25,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40573915] [2019-10-15 01:11:25,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:25,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:25,683 INFO L87 Difference]: Start difference. First operand 3284 states and 5247 transitions. Second operand 3 states. [2019-10-15 01:11:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:25,977 INFO L93 Difference]: Finished difference Result 9752 states and 15759 transitions. [2019-10-15 01:11:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:25,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:11:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,104 INFO L225 Difference]: With dead ends: 9752 [2019-10-15 01:11:26,104 INFO L226 Difference]: Without dead ends: 6503 [2019-10-15 01:11:26,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2019-10-15 01:11:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6433. [2019-10-15 01:11:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6433 states. [2019-10-15 01:11:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6433 states to 6433 states and 10358 transitions. [2019-10-15 01:11:26,407 INFO L78 Accepts]: Start accepts. Automaton has 6433 states and 10358 transitions. Word has length 153 [2019-10-15 01:11:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,407 INFO L462 AbstractCegarLoop]: Abstraction has 6433 states and 10358 transitions. [2019-10-15 01:11:26,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 6433 states and 10358 transitions. [2019-10-15 01:11:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:11:26,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,416 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:26,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:26,623 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1169703314, now seen corresponding path program 1 times [2019-10-15 01:11:26,624 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061910063] [2019-10-15 01:11:26,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:11:26,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061910063] [2019-10-15 01:11:26,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981590030] [2019-10-15 01:11:26,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:27,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 3085 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:11:27,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:11:27,519 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:27,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:11:27,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:11:27,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-15 01:11:27,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976494376] [2019-10-15 01:11:27,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:27,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:11:27,904 INFO L87 Difference]: Start difference. First operand 6433 states and 10358 transitions. Second operand 6 states. [2019-10-15 01:11:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:29,652 INFO L93 Difference]: Finished difference Result 17372 states and 28310 transitions. [2019-10-15 01:11:29,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:29,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-15 01:11:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:29,756 INFO L225 Difference]: With dead ends: 17372 [2019-10-15 01:11:29,756 INFO L226 Difference]: Without dead ends: 10973 [2019-10-15 01:11:29,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:11:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10973 states. [2019-10-15 01:11:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10973 to 10927. [2019-10-15 01:11:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10927 states. [2019-10-15 01:11:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10927 states to 10927 states and 17270 transitions. [2019-10-15 01:11:31,044 INFO L78 Accepts]: Start accepts. Automaton has 10927 states and 17270 transitions. Word has length 153 [2019-10-15 01:11:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:31,045 INFO L462 AbstractCegarLoop]: Abstraction has 10927 states and 17270 transitions. [2019-10-15 01:11:31,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 10927 states and 17270 transitions. [2019-10-15 01:11:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:11:31,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:31,051 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:31,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:31,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash 672411, now seen corresponding path program 1 times [2019-10-15 01:11:31,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:31,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631945158] [2019-10-15 01:11:31,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:31,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:31,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:11:31,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631945158] [2019-10-15 01:11:31,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:31,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:31,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260210646] [2019-10-15 01:11:31,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:31,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:31,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:31,396 INFO L87 Difference]: Start difference. First operand 10927 states and 17270 transitions. Second operand 4 states. [2019-10-15 01:11:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:31,790 INFO L93 Difference]: Finished difference Result 21816 states and 34789 transitions. [2019-10-15 01:11:31,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:31,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-15 01:11:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:31,855 INFO L225 Difference]: With dead ends: 21816 [2019-10-15 01:11:31,855 INFO L226 Difference]: Without dead ends: 10923 [2019-10-15 01:11:31,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10923 states. [2019-10-15 01:11:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10923 to 10891. [2019-10-15 01:11:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10891 states. [2019-10-15 01:11:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10891 states to 10891 states and 17148 transitions. [2019-10-15 01:11:32,265 INFO L78 Accepts]: Start accepts. Automaton has 10891 states and 17148 transitions. Word has length 153 [2019-10-15 01:11:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:32,266 INFO L462 AbstractCegarLoop]: Abstraction has 10891 states and 17148 transitions. [2019-10-15 01:11:32,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 10891 states and 17148 transitions. [2019-10-15 01:11:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:11:32,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:32,272 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:32,272 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1409498317, now seen corresponding path program 1 times [2019-10-15 01:11:32,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:32,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034685961] [2019-10-15 01:11:32,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:11:32,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034685961] [2019-10-15 01:11:32,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:32,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:32,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100120003] [2019-10-15 01:11:32,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:32,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:32,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:32,409 INFO L87 Difference]: Start difference. First operand 10891 states and 17148 transitions. Second operand 7 states. [2019-10-15 01:11:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:35,565 INFO L93 Difference]: Finished difference Result 32622 states and 52714 transitions. [2019-10-15 01:11:35,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:35,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-15 01:11:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:35,719 INFO L225 Difference]: With dead ends: 32622 [2019-10-15 01:11:35,719 INFO L226 Difference]: Without dead ends: 21765 [2019-10-15 01:11:35,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21765 states. [2019-10-15 01:11:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21765 to 21585. [2019-10-15 01:11:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21585 states. [2019-10-15 01:11:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21585 states to 21585 states and 34375 transitions. [2019-10-15 01:11:36,765 INFO L78 Accepts]: Start accepts. Automaton has 21585 states and 34375 transitions. Word has length 161 [2019-10-15 01:11:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:36,765 INFO L462 AbstractCegarLoop]: Abstraction has 21585 states and 34375 transitions. [2019-10-15 01:11:36,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 21585 states and 34375 transitions. [2019-10-15 01:11:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:11:36,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:36,772 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:36,772 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1208852276, now seen corresponding path program 1 times [2019-10-15 01:11:36,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:36,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861656346] [2019-10-15 01:11:36,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:36,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:36,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:11:36,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861656346] [2019-10-15 01:11:36,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:36,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:36,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463958521] [2019-10-15 01:11:36,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:36,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:36,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:36,893 INFO L87 Difference]: Start difference. First operand 21585 states and 34375 transitions. Second operand 4 states. [2019-10-15 01:11:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:38,444 INFO L93 Difference]: Finished difference Result 43224 states and 69471 transitions. [2019-10-15 01:11:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:38,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-15 01:11:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:38,575 INFO L225 Difference]: With dead ends: 43224 [2019-10-15 01:11:38,576 INFO L226 Difference]: Without dead ends: 21667 [2019-10-15 01:11:38,645 INFO L600 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-15 01:11:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21667 states. [2019-10-15 01:11:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21667 to 21599. [2019-10-15 01:11:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21599 states. [2019-10-15 01:11:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21599 states to 21599 states and 34293 transitions. [2019-10-15 01:11:39,440 INFO L78 Accepts]: Start accepts. Automaton has 21599 states and 34293 transitions. Word has length 162 [2019-10-15 01:11:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:39,441 INFO L462 AbstractCegarLoop]: Abstraction has 21599 states and 34293 transitions. [2019-10-15 01:11:39,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21599 states and 34293 transitions. [2019-10-15 01:11:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-15 01:11:39,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:39,454 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:39,454 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1184889081, now seen corresponding path program 1 times [2019-10-15 01:11:39,455 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:39,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53706409] [2019-10-15 01:11:39,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:39,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:39,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:11:39,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53706409] [2019-10-15 01:11:39,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:39,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:39,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023289498] [2019-10-15 01:11:39,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:39,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:39,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:39,672 INFO L87 Difference]: Start difference. First operand 21599 states and 34293 transitions. Second operand 7 states.