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_spec14_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:08:12,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:08:12,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:08:12,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:08:12,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:08:12,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:08:12,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:08:12,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:08:12,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:08:12,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:08:12,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:08:12,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:08:12,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:08:12,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:08:12,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:08:12,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:08:12,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:08:12,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:08:12,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:08:12,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:08:12,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:08:12,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:08:12,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:08:12,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:08:12,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:08:12,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:08:12,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:08:12,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:08:12,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:08:12,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:08:12,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:08:12,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:08:12,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:08:12,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:08:12,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:08:12,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:08:12,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:08:12,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:08:12,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:08:12,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:08:12,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:08:12,695 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:08:12,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:08:12,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:08:12,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:08:12,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:08:12,732 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:08:12,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:08:12,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:08:12,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:08:12,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:08:12,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:08:12,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:08:12,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:08:12,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:08:12,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:08:12,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:08:12,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:08:12,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:08:12,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:08:12,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:08:12,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:08:12,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:08:12,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:08:12,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:08:12,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:08:12,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:08:12,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:08:12,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:08:12,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:08:12,743 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:08:13,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:08:13,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:08:13,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:08:13,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:08:13,046 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:08:13,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-10-15 01:08:13,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3040193ed/da7aa1172eed4093bca1aa992b6d89e5/FLAG4a0155088 [2019-10-15 01:08:13,734 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:08:13,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-10-15 01:08:13,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3040193ed/da7aa1172eed4093bca1aa992b6d89e5/FLAG4a0155088 [2019-10-15 01:08:13,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3040193ed/da7aa1172eed4093bca1aa992b6d89e5 [2019-10-15 01:08:13,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:08:13,965 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:08:13,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:13,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:08:13,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:08:13,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:13" (1/1) ... [2019-10-15 01:08:13,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df463d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:13, skipping insertion in model container [2019-10-15 01:08:13,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:13" (1/1) ... [2019-10-15 01:08:13,984 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:08:14,096 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:08:14,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:14,880 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:08:15,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:15,116 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:08:15,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15 WrapperNode [2019-10-15 01:08:15,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:15,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:08:15,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:08:15,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:08:15,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (1/1) ... [2019-10-15 01:08:15,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:08:15,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:08:15,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:08:15,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:08:15,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (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:08:15,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:08:15,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:08:15,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:15,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:08:15,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:08:15,407 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:08:15,407 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:08:15,408 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:08:15,408 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:08:15,409 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:08:15,409 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:08:15,409 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:08:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:08:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:08:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:08:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:08:15,414 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:08:15,414 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:08:15,414 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:08:15,415 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:08:15,415 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:08:15,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:08:15,415 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:08:15,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:08:15,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:15,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:15,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:15,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:08:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:08:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:08:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:08:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:08:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:08:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:08:15,418 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:08:15,418 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:08:15,418 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:08:15,418 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:08:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:08:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:08:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:08:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:08:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:08:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:08:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:08:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:08:15,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:08:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:08:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:08:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:08:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:08:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:08:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:08:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:08:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:08:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:08:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:08:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:08:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:08:15,424 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:08:15,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:08:15,424 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:08:15,424 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:08:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:08:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:08:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:08:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:08:15,425 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:08:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:08:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:08:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-15 01:08:15,426 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:08:15,427 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-15 01:08:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:08:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:08:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:08:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:08:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:08:15,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:08:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:08:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:08:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:08:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:08:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:08:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:08:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:08:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:08:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:08:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:08:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:08:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:08:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:08:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:08:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:08:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:08:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:08:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:08:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:08:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:08:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:08:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:08:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:08:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:08:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:08:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:08:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:08:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:08:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:08:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:08:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:08:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:08:15,440 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:08:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:08:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:08:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:08:15,442 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:08:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:08:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:08:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:08:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:08:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:08:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:08:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:08:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:08:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:08:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:08:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:08:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:08:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:08:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:08:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:08:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:08:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:08:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:08:18,054 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:08:18,054 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:08:18,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:18 BoogieIcfgContainer [2019-10-15 01:08:18,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:08:18,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:08:18,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:08:18,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:08:18,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:08:13" (1/3) ... [2019-10-15 01:08:18,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a43ab5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:18, skipping insertion in model container [2019-10-15 01:08:18,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:15" (2/3) ... [2019-10-15 01:08:18,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a43ab5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:18, skipping insertion in model container [2019-10-15 01:08:18,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:18" (3/3) ... [2019-10-15 01:08:18,065 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product32.cil.c [2019-10-15 01:08:18,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:08:18,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:08:18,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:08:18,144 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:08:18,145 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:08:18,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:08:18,145 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:08:18,145 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:08:18,145 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:08:18,145 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:08:18,145 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:08:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states. [2019-10-15 01:08:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 01:08:18,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:18,206 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:18,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1156947632, now seen corresponding path program 1 times [2019-10-15 01:08:18,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:18,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953426985] [2019-10-15 01:08:18,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:18,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953426985] [2019-10-15 01:08:18,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:18,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:18,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100206524] [2019-10-15 01:08:18,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:18,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:18,883 INFO L87 Difference]: Start difference. First operand 798 states. Second operand 4 states. [2019-10-15 01:08:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:19,144 INFO L93 Difference]: Finished difference Result 1280 states and 2032 transitions. [2019-10-15 01:08:19,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:19,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-15 01:08:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:19,188 INFO L225 Difference]: With dead ends: 1280 [2019-10-15 01:08:19,189 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:08:19,202 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:08:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:08:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:08:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:08:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1007 transitions. [2019-10-15 01:08:19,329 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1007 transitions. Word has length 87 [2019-10-15 01:08:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:19,330 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1007 transitions. [2019-10-15 01:08:19,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1007 transitions. [2019-10-15 01:08:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:08:19,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:19,345 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:19,346 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1296609552, now seen corresponding path program 1 times [2019-10-15 01:08:19,346 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:19,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116878253] [2019-10-15 01:08:19,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:19,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116878253] [2019-10-15 01:08:19,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:19,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:19,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123703798] [2019-10-15 01:08:19,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:19,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:19,564 INFO L87 Difference]: Start difference. First operand 643 states and 1007 transitions. Second operand 4 states. [2019-10-15 01:08:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:19,703 INFO L93 Difference]: Finished difference Result 1253 states and 1975 transitions. [2019-10-15 01:08:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:19,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 01:08:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:19,719 INFO L225 Difference]: With dead ends: 1253 [2019-10-15 01:08:19,719 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:08:19,723 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:08:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:08:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:08:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:08:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1006 transitions. [2019-10-15 01:08:19,779 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1006 transitions. Word has length 88 [2019-10-15 01:08:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:19,780 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1006 transitions. [2019-10-15 01:08:19,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1006 transitions. [2019-10-15 01:08:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:08:19,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:19,795 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:19,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1734809644, now seen corresponding path program 1 times [2019-10-15 01:08:19,798 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:19,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756245627] [2019-10-15 01:08:19,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:20,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756245627] [2019-10-15 01:08:20,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:20,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:20,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391311337] [2019-10-15 01:08:20,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:20,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:20,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:20,061 INFO L87 Difference]: Start difference. First operand 643 states and 1006 transitions. Second operand 4 states. [2019-10-15 01:08:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:20,159 INFO L93 Difference]: Finished difference Result 1253 states and 1974 transitions. [2019-10-15 01:08:20,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:20,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-15 01:08:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:20,166 INFO L225 Difference]: With dead ends: 1253 [2019-10-15 01:08:20,166 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:08:20,171 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:08:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:08:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:08:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:08:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1005 transitions. [2019-10-15 01:08:20,204 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1005 transitions. Word has length 89 [2019-10-15 01:08:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:20,205 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1005 transitions. [2019-10-15 01:08:20,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1005 transitions. [2019-10-15 01:08:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:08:20,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,208 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:20,208 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1457208820, now seen corresponding path program 1 times [2019-10-15 01:08:20,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056622339] [2019-10-15 01:08:20,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:20,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056622339] [2019-10-15 01:08:20,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:20,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:20,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107542131] [2019-10-15 01:08:20,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:20,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:20,353 INFO L87 Difference]: Start difference. First operand 643 states and 1005 transitions. Second operand 4 states. [2019-10-15 01:08:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:20,423 INFO L93 Difference]: Finished difference Result 1253 states and 1973 transitions. [2019-10-15 01:08:20,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:20,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-15 01:08:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:20,429 INFO L225 Difference]: With dead ends: 1253 [2019-10-15 01:08:20,430 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:08:20,433 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:08:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:08:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:08:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:08:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1004 transitions. [2019-10-15 01:08:20,461 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1004 transitions. Word has length 90 [2019-10-15 01:08:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:20,461 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1004 transitions. [2019-10-15 01:08:20,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1004 transitions. [2019-10-15 01:08:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:08:20,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,464 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:20,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1221885528, now seen corresponding path program 1 times [2019-10-15 01:08:20,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233814164] [2019-10-15 01:08:20,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:20,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233814164] [2019-10-15 01:08:20,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:20,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:20,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951150849] [2019-10-15 01:08:20,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:20,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:20,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:20,588 INFO L87 Difference]: Start difference. First operand 643 states and 1004 transitions. Second operand 4 states. [2019-10-15 01:08:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:20,659 INFO L93 Difference]: Finished difference Result 1253 states and 1972 transitions. [2019-10-15 01:08:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:20,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 01:08:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:20,666 INFO L225 Difference]: With dead ends: 1253 [2019-10-15 01:08:20,667 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:08:20,671 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:08:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:08:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:08:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:08:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1003 transitions. [2019-10-15 01:08:20,703 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1003 transitions. Word has length 91 [2019-10-15 01:08:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:20,704 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1003 transitions. [2019-10-15 01:08:20,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1003 transitions. [2019-10-15 01:08:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:08:20,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,706 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:20,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2113150200, now seen corresponding path program 1 times [2019-10-15 01:08:20,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814513880] [2019-10-15 01:08:20,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:20,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814513880] [2019-10-15 01:08:20,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:20,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:08:20,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702688429] [2019-10-15 01:08:20,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:08:20,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:08:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:08:20,999 INFO L87 Difference]: Start difference. First operand 643 states and 1003 transitions. Second operand 10 states. [2019-10-15 01:08:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:21,195 INFO L93 Difference]: Finished difference Result 1258 states and 1979 transitions. [2019-10-15 01:08:21,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:21,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-15 01:08:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:21,202 INFO L225 Difference]: With dead ends: 1258 [2019-10-15 01:08:21,202 INFO L226 Difference]: Without dead ends: 652 [2019-10-15 01:08:21,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-10-15 01:08:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-10-15 01:08:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-15 01:08:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1013 transitions. [2019-10-15 01:08:21,237 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1013 transitions. Word has length 92 [2019-10-15 01:08:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:21,239 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1013 transitions. [2019-10-15 01:08:21,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:08:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1013 transitions. [2019-10-15 01:08:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:08:21,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:21,243 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:21,243 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2012238233, now seen corresponding path program 1 times [2019-10-15 01:08:21,244 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:21,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029218577] [2019-10-15 01:08:21,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:21,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029218577] [2019-10-15 01:08:21,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:21,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:21,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866524447] [2019-10-15 01:08:21,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:21,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:21,364 INFO L87 Difference]: Start difference. First operand 650 states and 1013 transitions. Second operand 4 states. [2019-10-15 01:08:21,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:21,431 INFO L93 Difference]: Finished difference Result 1259 states and 1980 transitions. [2019-10-15 01:08:21,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:21,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-15 01:08:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:21,439 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:08:21,439 INFO L226 Difference]: Without dead ends: 646 [2019-10-15 01:08:21,443 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:08:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-15 01:08:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-10-15 01:08:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-15 01:08:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1006 transitions. [2019-10-15 01:08:21,470 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1006 transitions. Word has length 92 [2019-10-15 01:08:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:21,470 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 1006 transitions. [2019-10-15 01:08:21,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1006 transitions. [2019-10-15 01:08:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:08:21,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:21,472 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:21,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash 852807042, now seen corresponding path program 1 times [2019-10-15 01:08:21,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:21,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650699003] [2019-10-15 01:08:21,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:21,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650699003] [2019-10-15 01:08:21,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:21,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:21,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483346623] [2019-10-15 01:08:21,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:21,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:21,621 INFO L87 Difference]: Start difference. First operand 646 states and 1006 transitions. Second operand 6 states. [2019-10-15 01:08:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:22,112 INFO L93 Difference]: Finished difference Result 1272 states and 2004 transitions. [2019-10-15 01:08:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:08:22,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-15 01:08:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:22,122 INFO L225 Difference]: With dead ends: 1272 [2019-10-15 01:08:22,122 INFO L226 Difference]: Without dead ends: 654 [2019-10-15 01:08:22,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-15 01:08:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2019-10-15 01:08:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:08:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-10-15 01:08:22,169 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 93 [2019-10-15 01:08:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:22,170 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-10-15 01:08:22,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-10-15 01:08:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:08:22,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:22,174 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:22,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -535079125, now seen corresponding path program 1 times [2019-10-15 01:08:22,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:22,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033999418] [2019-10-15 01:08:22,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:22,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033999418] [2019-10-15 01:08:22,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:22,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:22,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887694516] [2019-10-15 01:08:22,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:22,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:22,375 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 6 states. [2019-10-15 01:08:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:22,608 INFO L93 Difference]: Finished difference Result 1235 states and 1919 transitions. [2019-10-15 01:08:22,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:22,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-15 01:08:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:22,615 INFO L225 Difference]: With dead ends: 1235 [2019-10-15 01:08:22,615 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:08:22,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:08:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:08:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:08:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1003 transitions. [2019-10-15 01:08:22,645 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1003 transitions. Word has length 94 [2019-10-15 01:08:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:22,646 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1003 transitions. [2019-10-15 01:08:22,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1003 transitions. [2019-10-15 01:08:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:08:22,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:22,648 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:22,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1647609305, now seen corresponding path program 1 times [2019-10-15 01:08:22,649 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:22,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397722949] [2019-10-15 01:08:22,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:22,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397722949] [2019-10-15 01:08:22,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:22,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:22,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031333606] [2019-10-15 01:08:22,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:22,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:22,823 INFO L87 Difference]: Start difference. First operand 651 states and 1003 transitions. Second operand 6 states. [2019-10-15 01:08:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,108 INFO L93 Difference]: Finished difference Result 1235 states and 1915 transitions. [2019-10-15 01:08:23,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:23,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-15 01:08:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,114 INFO L225 Difference]: With dead ends: 1235 [2019-10-15 01:08:23,114 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:08:23,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:08:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:08:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:08:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 999 transitions. [2019-10-15 01:08:23,196 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 999 transitions. Word has length 95 [2019-10-15 01:08:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,197 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 999 transitions. [2019-10-15 01:08:23,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 999 transitions. [2019-10-15 01:08:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:08:23,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,199 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,199 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1752053415, now seen corresponding path program 1 times [2019-10-15 01:08:23,200 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585251174] [2019-10-15 01:08:23,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:23,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585251174] [2019-10-15 01:08:23,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:23,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:08:23,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127368431] [2019-10-15 01:08:23,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:23,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:23,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:08:23,356 INFO L87 Difference]: Start difference. First operand 651 states and 999 transitions. Second operand 7 states. [2019-10-15 01:08:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,481 INFO L93 Difference]: Finished difference Result 1238 states and 1915 transitions. [2019-10-15 01:08:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:23,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:08:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,489 INFO L225 Difference]: With dead ends: 1238 [2019-10-15 01:08:23,489 INFO L226 Difference]: Without dead ends: 633 [2019-10-15 01:08:23,493 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:08:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-15 01:08:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2019-10-15 01:08:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:08:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 962 transitions. [2019-10-15 01:08:23,522 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 962 transitions. Word has length 95 [2019-10-15 01:08:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,523 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 962 transitions. [2019-10-15 01:08:23,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 962 transitions. [2019-10-15 01:08:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:08:23,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,526 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1480928816, now seen corresponding path program 1 times [2019-10-15 01:08:23,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042239609] [2019-10-15 01:08:23,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:23,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042239609] [2019-10-15 01:08:23,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:23,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:23,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146470059] [2019-10-15 01:08:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:23,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:23,673 INFO L87 Difference]: Start difference. First operand 630 states and 962 transitions. Second operand 6 states. [2019-10-15 01:08:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,806 INFO L93 Difference]: Finished difference Result 1214 states and 1874 transitions. [2019-10-15 01:08:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:23,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-15 01:08:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,813 INFO L225 Difference]: With dead ends: 1214 [2019-10-15 01:08:23,813 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:08:23,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:08:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-15 01:08:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:08:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 961 transitions. [2019-10-15 01:08:23,842 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 961 transitions. Word has length 96 [2019-10-15 01:08:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,843 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 961 transitions. [2019-10-15 01:08:23,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 961 transitions. [2019-10-15 01:08:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:08:23,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,845 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,845 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1356369204, now seen corresponding path program 1 times [2019-10-15 01:08:23,846 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568090887] [2019-10-15 01:08:23,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:24,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568090887] [2019-10-15 01:08:24,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:24,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:24,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957820513] [2019-10-15 01:08:24,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:24,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:24,004 INFO L87 Difference]: Start difference. First operand 630 states and 961 transitions. Second operand 6 states. [2019-10-15 01:08:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,147 INFO L93 Difference]: Finished difference Result 1214 states and 1873 transitions. [2019-10-15 01:08:24,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:24,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-15 01:08:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,153 INFO L225 Difference]: With dead ends: 1214 [2019-10-15 01:08:24,153 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:08:24,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:08:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-15 01:08:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:08:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 960 transitions. [2019-10-15 01:08:24,180 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 960 transitions. Word has length 97 [2019-10-15 01:08:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:24,181 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 960 transitions. [2019-10-15 01:08:24,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 960 transitions. [2019-10-15 01:08:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:08:24,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:24,184 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:24,184 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -156026571, now seen corresponding path program 1 times [2019-10-15 01:08:24,207 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:24,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126109463] [2019-10-15 01:08:24,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:24,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126109463] [2019-10-15 01:08:24,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:24,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:08:24,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230560493] [2019-10-15 01:08:24,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:08:24,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:08:24,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:08:24,419 INFO L87 Difference]: Start difference. First operand 630 states and 960 transitions. Second operand 12 states. [2019-10-15 01:08:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,769 INFO L93 Difference]: Finished difference Result 1220 states and 1883 transitions. [2019-10-15 01:08:24,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:08:24,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-15 01:08:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,778 INFO L225 Difference]: With dead ends: 1220 [2019-10-15 01:08:24,778 INFO L226 Difference]: Without dead ends: 637 [2019-10-15 01:08:24,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-15 01:08:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2019-10-15 01:08:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-15 01:08:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 966 transitions. [2019-10-15 01:08:24,815 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 966 transitions. Word has length 98 [2019-10-15 01:08:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:24,817 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 966 transitions. [2019-10-15 01:08:24,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:08:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 966 transitions. [2019-10-15 01:08:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:08:24,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:24,821 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:24,821 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1563321933, now seen corresponding path program 1 times [2019-10-15 01:08:24,822 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:24,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551093665] [2019-10-15 01:08:24,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:25,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551093665] [2019-10-15 01:08:25,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:25,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:25,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268642498] [2019-10-15 01:08:25,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:25,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:25,052 INFO L87 Difference]: Start difference. First operand 635 states and 966 transitions. Second operand 9 states. [2019-10-15 01:08:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:31,014 INFO L93 Difference]: Finished difference Result 1846 states and 2913 transitions. [2019-10-15 01:08:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:08:31,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-15 01:08:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:31,028 INFO L225 Difference]: With dead ends: 1846 [2019-10-15 01:08:31,028 INFO L226 Difference]: Without dead ends: 1264 [2019-10-15 01:08:31,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:08:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-10-15 01:08:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1240. [2019-10-15 01:08:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2019-10-15 01:08:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1948 transitions. [2019-10-15 01:08:31,110 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1948 transitions. Word has length 99 [2019-10-15 01:08:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:31,111 INFO L462 AbstractCegarLoop]: Abstraction has 1240 states and 1948 transitions. [2019-10-15 01:08:31,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1948 transitions. [2019-10-15 01:08:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:08:31,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:31,114 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:31,114 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:31,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash -202638925, now seen corresponding path program 1 times [2019-10-15 01:08:31,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:31,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288899497] [2019-10-15 01:08:31,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:31,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:31,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:31,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288899497] [2019-10-15 01:08:31,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:31,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:31,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933272935] [2019-10-15 01:08:31,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:31,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:31,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:31,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:31,339 INFO L87 Difference]: Start difference. First operand 1240 states and 1948 transitions. Second operand 6 states. [2019-10-15 01:08:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:32,105 INFO L93 Difference]: Finished difference Result 2445 states and 3942 transitions. [2019-10-15 01:08:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:32,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-15 01:08:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:32,115 INFO L225 Difference]: With dead ends: 2445 [2019-10-15 01:08:32,115 INFO L226 Difference]: Without dead ends: 1258 [2019-10-15 01:08:32,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-15 01:08:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-15 01:08:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-15 01:08:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1968 transitions. [2019-10-15 01:08:32,193 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1968 transitions. Word has length 100 [2019-10-15 01:08:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:32,194 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 1968 transitions. [2019-10-15 01:08:32,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1968 transitions. [2019-10-15 01:08:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:08:32,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:32,196 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:32,196 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1419649865, now seen corresponding path program 1 times [2019-10-15 01:08:32,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:32,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183479576] [2019-10-15 01:08:32,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:32,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:32,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:32,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183479576] [2019-10-15 01:08:32,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:32,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:32,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101644372] [2019-10-15 01:08:32,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:32,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:32,363 INFO L87 Difference]: Start difference. First operand 1256 states and 1968 transitions. Second operand 9 states. [2019-10-15 01:08:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:38,522 INFO L93 Difference]: Finished difference Result 3904 states and 6289 transitions. [2019-10-15 01:08:38,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:08:38,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-15 01:08:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:38,545 INFO L225 Difference]: With dead ends: 3904 [2019-10-15 01:08:38,545 INFO L226 Difference]: Without dead ends: 2701 [2019-10-15 01:08:38,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:08:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-10-15 01:08:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2646. [2019-10-15 01:08:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2019-10-15 01:08:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 4241 transitions. [2019-10-15 01:08:38,701 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 4241 transitions. Word has length 101 [2019-10-15 01:08:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:38,701 INFO L462 AbstractCegarLoop]: Abstraction has 2646 states and 4241 transitions. [2019-10-15 01:08:38,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 4241 transitions. [2019-10-15 01:08:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:08:38,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:38,705 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:38,705 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -940794569, now seen corresponding path program 1 times [2019-10-15 01:08:38,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:38,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173577750] [2019-10-15 01:08:38,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:38,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:38,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:38,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173577750] [2019-10-15 01:08:38,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:38,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:38,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233373078] [2019-10-15 01:08:38,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:38,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:38,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:38,853 INFO L87 Difference]: Start difference. First operand 2646 states and 4241 transitions. Second operand 9 states. [2019-10-15 01:08:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:44,603 INFO L93 Difference]: Finished difference Result 7476 states and 12248 transitions. [2019-10-15 01:08:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:08:44,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-15 01:08:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:44,644 INFO L225 Difference]: With dead ends: 7476 [2019-10-15 01:08:44,644 INFO L226 Difference]: Without dead ends: 4889 [2019-10-15 01:08:44,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:08:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2019-10-15 01:08:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4764. [2019-10-15 01:08:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4764 states. [2019-10-15 01:08:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7713 transitions. [2019-10-15 01:08:44,960 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7713 transitions. Word has length 102 [2019-10-15 01:08:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:44,961 INFO L462 AbstractCegarLoop]: Abstraction has 4764 states and 7713 transitions. [2019-10-15 01:08:44,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7713 transitions. [2019-10-15 01:08:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:08:44,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:44,966 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:44,966 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash 865847124, now seen corresponding path program 1 times [2019-10-15 01:08:44,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:44,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929992711] [2019-10-15 01:08:44,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:44,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:44,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:45,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929992711] [2019-10-15 01:08:45,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:45,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:45,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227919790] [2019-10-15 01:08:45,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:45,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:45,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:45,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:45,177 INFO L87 Difference]: Start difference. First operand 4764 states and 7713 transitions. Second operand 9 states. [2019-10-15 01:08:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:45,494 INFO L93 Difference]: Finished difference Result 7226 states and 11678 transitions. [2019-10-15 01:08:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:45,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-15 01:08:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:45,517 INFO L225 Difference]: With dead ends: 7226 [2019-10-15 01:08:45,518 INFO L226 Difference]: Without dead ends: 2509 [2019-10-15 01:08:45,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:45,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-10-15 01:08:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2019-10-15 01:08:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-10-15 01:08:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 4008 transitions. [2019-10-15 01:08:45,779 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 4008 transitions. Word has length 102 [2019-10-15 01:08:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:45,779 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 4008 transitions. [2019-10-15 01:08:45,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4008 transitions. [2019-10-15 01:08:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:08:45,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:45,782 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:08:45,782 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:45,782 INFO L82 PathProgramCache]: Analyzing trace with hash 570306491, now seen corresponding path program 1 times [2019-10-15 01:08:45,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:45,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658471606] [2019-10-15 01:08:45,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:45,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:45,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:08:45,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658471606] [2019-10-15 01:08:45,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:45,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:45,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693494279] [2019-10-15 01:08:45,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:45,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:45,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:45,995 INFO L87 Difference]: Start difference. First operand 2507 states and 4008 transitions. Second operand 9 states.