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_spec2_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:33,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:33,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:33,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:33,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:33,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:33,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:33,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:33,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:33,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:33,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:33,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:33,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:33,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:33,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:33,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:33,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:33,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:33,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:33,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:33,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:33,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:33,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:33,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:33,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:33,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:33,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:33,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:33,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:33,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:33,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:33,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:33,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:33,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:33,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:33,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:33,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:33,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:33,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:33,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:33,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:33,103 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:09:33,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:33,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:33,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:33,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:33,119 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:33,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:33,120 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:33,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:33,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:33,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:33,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:33,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:33,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:33,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:33,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:33,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:33,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:33,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:33,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:33,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:33,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:33,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:33,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:33,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:33,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:33,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:33,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:33,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:33,124 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:09:33,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:33,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:33,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:33,442 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:33,442 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:33,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-10-15 01:09:33,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94db29ffe/777921769aa64290b6b4f8d2e57ebc0f/FLAG85a155f32 [2019-10-15 01:09:34,239 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:34,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-10-15 01:09:34,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94db29ffe/777921769aa64290b6b4f8d2e57ebc0f/FLAG85a155f32 [2019-10-15 01:09:34,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94db29ffe/777921769aa64290b6b4f8d2e57ebc0f [2019-10-15 01:09:34,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:34,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:34,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:34,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:34,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:34,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:34" (1/1) ... [2019-10-15 01:09:34,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fdcb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:34, skipping insertion in model container [2019-10-15 01:09:34,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:34" (1/1) ... [2019-10-15 01:09:34,412 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:34,489 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:35,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:35,239 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:35,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:35,426 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:35,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35 WrapperNode [2019-10-15 01:09:35,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:35,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:35,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:35,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:35,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (1/1) ... [2019-10-15 01:09:35,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:35,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:35,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:35,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:35,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (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:09:35,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:35,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:35,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:35,709 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:35,710 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:35,710 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:35,710 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:35,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:35,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:35,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:35,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:35,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:35,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:35,712 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:35,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:35,713 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:35,713 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:35,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:35,713 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:35,714 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:35,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:35,714 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:35,717 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:35,718 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:35,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:35,718 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:35,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:35,718 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:35,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:35,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:35,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:35,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:35,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:35,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:35,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:35,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:35,720 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:35,720 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:35,720 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:35,721 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:09:35,721 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:35,721 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:09:35,721 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:35,721 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:35,722 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:35,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:35,722 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:35,722 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:35,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:35,723 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:35,723 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:35,723 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:35,723 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:09:35,723 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:09:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:35,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:35,732 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:35,732 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:35,732 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:35,732 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:35,732 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:35,732 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:35,733 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:35,735 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:35,735 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:35,735 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:35,735 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:35,735 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:35,735 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:35,736 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:35,736 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:35,736 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:35,736 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:35,736 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:09:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:09:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:09:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:09:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:38,047 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:38,048 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:38,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:38 BoogieIcfgContainer [2019-10-15 01:09:38,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:38,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:38,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:38,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:38,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:34" (1/3) ... [2019-10-15 01:09:38,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6724d2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:38, skipping insertion in model container [2019-10-15 01:09:38,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:35" (2/3) ... [2019-10-15 01:09:38,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6724d2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:38, skipping insertion in model container [2019-10-15 01:09:38,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:38" (3/3) ... [2019-10-15 01:09:38,061 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2019-10-15 01:09:38,071 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:38,083 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:38,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:38,147 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:38,147 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:38,147 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:38,147 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:38,147 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:38,147 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:38,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:38,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states. [2019-10-15 01:09:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:09:38,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,237 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, 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:09:38,239 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1453471950, now seen corresponding path program 1 times [2019-10-15 01:09:38,255 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807825851] [2019-10-15 01:09:38,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,920 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:09:38,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807825851] [2019-10-15 01:09:38,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:38,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650005308] [2019-10-15 01:09:38,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:38,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:38,951 INFO L87 Difference]: Start difference. First operand 773 states. Second operand 4 states. [2019-10-15 01:09:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:39,169 INFO L93 Difference]: Finished difference Result 1209 states and 1957 transitions. [2019-10-15 01:09:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:39,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-15 01:09:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:39,210 INFO L225 Difference]: With dead ends: 1209 [2019-10-15 01:09:39,210 INFO L226 Difference]: Without dead ends: 613 [2019-10-15 01:09:39,224 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:09:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-15 01:09:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-15 01:09:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-15 01:09:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 980 transitions. [2019-10-15 01:09:39,334 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 980 transitions. Word has length 124 [2019-10-15 01:09:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:39,334 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 980 transitions. [2019-10-15 01:09:39,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 980 transitions. [2019-10-15 01:09:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:09:39,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:39,343 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, 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:09:39,343 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -491101009, now seen corresponding path program 1 times [2019-10-15 01:09:39,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:39,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675238678] [2019-10-15 01:09:39,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:39,542 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:09:39,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675238678] [2019-10-15 01:09:39,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:39,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:39,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316050282] [2019-10-15 01:09:39,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:39,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:39,549 INFO L87 Difference]: Start difference. First operand 613 states and 980 transitions. Second operand 4 states. [2019-10-15 01:09:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:39,659 INFO L93 Difference]: Finished difference Result 1189 states and 1918 transitions. [2019-10-15 01:09:39,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:39,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-15 01:09:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:39,671 INFO L225 Difference]: With dead ends: 1189 [2019-10-15 01:09:39,672 INFO L226 Difference]: Without dead ends: 613 [2019-10-15 01:09:39,679 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:09:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-15 01:09:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-15 01:09:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-15 01:09:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 979 transitions. [2019-10-15 01:09:39,747 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 979 transitions. Word has length 127 [2019-10-15 01:09:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:39,750 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 979 transitions. [2019-10-15 01:09:39,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 979 transitions. [2019-10-15 01:09:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:39,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:39,759 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, 1, 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:09:39,759 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2141971607, now seen corresponding path program 1 times [2019-10-15 01:09:39,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:39,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177805919] [2019-10-15 01:09:39,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,011 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:09:40,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177805919] [2019-10-15 01:09:40,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:40,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:40,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662517794] [2019-10-15 01:09:40,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:40,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:40,016 INFO L87 Difference]: Start difference. First operand 613 states and 979 transitions. Second operand 4 states. [2019-10-15 01:09:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:40,095 INFO L93 Difference]: Finished difference Result 1189 states and 1917 transitions. [2019-10-15 01:09:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:40,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-15 01:09:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:40,103 INFO L225 Difference]: With dead ends: 1189 [2019-10-15 01:09:40,103 INFO L226 Difference]: Without dead ends: 613 [2019-10-15 01:09:40,107 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:09:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-15 01:09:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-15 01:09:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-15 01:09:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 978 transitions. [2019-10-15 01:09:40,156 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 978 transitions. Word has length 128 [2019-10-15 01:09:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:40,158 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 978 transitions. [2019-10-15 01:09:40,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 978 transitions. [2019-10-15 01:09:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:09:40,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:40,167 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, 1, 1, 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:09:40,167 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 923417843, now seen corresponding path program 1 times [2019-10-15 01:09:40,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:40,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903898029] [2019-10-15 01:09:40,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:40,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:40,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,332 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:09:40,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903898029] [2019-10-15 01:09:40,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:40,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:40,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122035678] [2019-10-15 01:09:40,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:40,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:40,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:40,335 INFO L87 Difference]: Start difference. First operand 613 states and 978 transitions. Second operand 4 states. [2019-10-15 01:09:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:40,397 INFO L93 Difference]: Finished difference Result 1189 states and 1916 transitions. [2019-10-15 01:09:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:40,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-15 01:09:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:40,403 INFO L225 Difference]: With dead ends: 1189 [2019-10-15 01:09:40,403 INFO L226 Difference]: Without dead ends: 613 [2019-10-15 01:09:40,407 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:09:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-15 01:09:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-15 01:09:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-15 01:09:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 977 transitions. [2019-10-15 01:09:40,432 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 977 transitions. Word has length 129 [2019-10-15 01:09:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:40,432 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 977 transitions. [2019-10-15 01:09:40,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 977 transitions. [2019-10-15 01:09:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:09:40,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:40,438 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, 1, 1, 1, 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:09:40,438 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash -130986579, now seen corresponding path program 1 times [2019-10-15 01:09:40,439 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:40,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639854296] [2019-10-15 01:09:40,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:40,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:40,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,576 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:09:40,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639854296] [2019-10-15 01:09:40,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:40,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:40,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499741717] [2019-10-15 01:09:40,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:40,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:40,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:40,581 INFO L87 Difference]: Start difference. First operand 613 states and 977 transitions. Second operand 4 states. [2019-10-15 01:09:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:40,717 INFO L93 Difference]: Finished difference Result 1189 states and 1915 transitions. [2019-10-15 01:09:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:40,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-10-15 01:09:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:40,723 INFO L225 Difference]: With dead ends: 1189 [2019-10-15 01:09:40,723 INFO L226 Difference]: Without dead ends: 613 [2019-10-15 01:09:40,727 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:09:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-15 01:09:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-15 01:09:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-15 01:09:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 976 transitions. [2019-10-15 01:09:40,759 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 976 transitions. Word has length 130 [2019-10-15 01:09:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:40,760 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 976 transitions. [2019-10-15 01:09:40,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 976 transitions. [2019-10-15 01:09:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:09:40,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:40,767 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, 1, 1, 1, 1, 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:09:40,767 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -49982153, now seen corresponding path program 1 times [2019-10-15 01:09:40,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:40,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093553712] [2019-10-15 01:09:40,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:40,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,989 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:09:40,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093553712] [2019-10-15 01:09:40,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:40,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:40,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239644134] [2019-10-15 01:09:40,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:40,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:40,992 INFO L87 Difference]: Start difference. First operand 613 states and 976 transitions. Second operand 10 states. [2019-10-15 01:09:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:41,177 INFO L93 Difference]: Finished difference Result 1147 states and 1835 transitions. [2019-10-15 01:09:41,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:41,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-10-15 01:09:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:41,190 INFO L225 Difference]: With dead ends: 1147 [2019-10-15 01:09:41,191 INFO L226 Difference]: Without dead ends: 622 [2019-10-15 01:09:41,198 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:09:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-15 01:09:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-15 01:09:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 01:09:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-10-15 01:09:41,233 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-10-15 01:09:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:41,235 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-10-15 01:09:41,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-10-15 01:09:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:09:41,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:41,245 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, 1, 1, 1, 1, 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:09:41,245 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:41,245 INFO L82 PathProgramCache]: Analyzing trace with hash 625710456, now seen corresponding path program 1 times [2019-10-15 01:09:41,246 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:41,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354722798] [2019-10-15 01:09:41,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:41,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:41,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:41,371 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:09:41,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354722798] [2019-10-15 01:09:41,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:41,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:41,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171104919] [2019-10-15 01:09:41,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:41,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:41,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:41,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:41,374 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-10-15 01:09:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:41,434 INFO L93 Difference]: Finished difference Result 1195 states and 1921 transitions. [2019-10-15 01:09:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:41,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-10-15 01:09:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:41,442 INFO L225 Difference]: With dead ends: 1195 [2019-10-15 01:09:41,442 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 01:09:41,446 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:09:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 01:09:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-15 01:09:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 01:09:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 962 transitions. [2019-10-15 01:09:41,476 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 962 transitions. Word has length 131 [2019-10-15 01:09:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:41,476 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 962 transitions. [2019-10-15 01:09:41,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 962 transitions. [2019-10-15 01:09:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:09:41,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:41,482 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, 1, 1, 1, 1, 1, 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:09:41,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1002453247, now seen corresponding path program 1 times [2019-10-15 01:09:41,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:41,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626319569] [2019-10-15 01:09:41,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:41,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:41,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:41,755 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:09:41,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626319569] [2019-10-15 01:09:41,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:41,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:41,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192956708] [2019-10-15 01:09:41,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:41,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:41,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:41,758 INFO L87 Difference]: Start difference. First operand 607 states and 962 transitions. Second operand 6 states. [2019-10-15 01:09:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:42,049 INFO L93 Difference]: Finished difference Result 1135 states and 1813 transitions. [2019-10-15 01:09:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:42,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-15 01:09:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:42,056 INFO L225 Difference]: With dead ends: 1135 [2019-10-15 01:09:42,056 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 01:09:42,062 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:09:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 01:09:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-15 01:09:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 01:09:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 958 transitions. [2019-10-15 01:09:42,098 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 958 transitions. Word has length 132 [2019-10-15 01:09:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:42,099 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 958 transitions. [2019-10-15 01:09:42,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 958 transitions. [2019-10-15 01:09:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:09:42,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:42,108 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, 1, 1, 1, 1, 1, 1, 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:09:42,108 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1646126772, now seen corresponding path program 1 times [2019-10-15 01:09:42,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:42,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675946239] [2019-10-15 01:09:42,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:42,302 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:09:42,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675946239] [2019-10-15 01:09:42,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:42,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:42,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815440780] [2019-10-15 01:09:42,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:42,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:42,307 INFO L87 Difference]: Start difference. First operand 607 states and 958 transitions. Second operand 6 states. [2019-10-15 01:09:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:42,506 INFO L93 Difference]: Finished difference Result 1135 states and 1809 transitions. [2019-10-15 01:09:42,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:42,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-15 01:09:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:42,514 INFO L225 Difference]: With dead ends: 1135 [2019-10-15 01:09:42,514 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 01:09:42,517 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:09:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 01:09:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-15 01:09:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 01:09:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 954 transitions. [2019-10-15 01:09:42,542 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 954 transitions. Word has length 133 [2019-10-15 01:09:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:42,542 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 954 transitions. [2019-10-15 01:09:42,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 954 transitions. [2019-10-15 01:09:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:09:42,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:42,547 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, 1, 1, 1, 1, 1, 1, 1, 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:09:42,547 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1808478140, now seen corresponding path program 1 times [2019-10-15 01:09:42,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:42,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840557751] [2019-10-15 01:09:42,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:42,729 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:09:42,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840557751] [2019-10-15 01:09:42,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:42,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:42,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979704824] [2019-10-15 01:09:42,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:42,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:42,736 INFO L87 Difference]: Start difference. First operand 607 states and 954 transitions. Second operand 6 states. [2019-10-15 01:09:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:42,916 INFO L93 Difference]: Finished difference Result 1135 states and 1805 transitions. [2019-10-15 01:09:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:42,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-15 01:09:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:42,922 INFO L225 Difference]: With dead ends: 1135 [2019-10-15 01:09:42,922 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 01:09:42,930 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:09:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 01:09:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-15 01:09:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 01:09:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 950 transitions. [2019-10-15 01:09:42,965 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 950 transitions. Word has length 134 [2019-10-15 01:09:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:42,965 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 950 transitions. [2019-10-15 01:09:42,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 950 transitions. [2019-10-15 01:09:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:09:42,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:42,971 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, 1, 1, 1, 1, 1, 1, 1, 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:09:42,972 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1695866052, now seen corresponding path program 1 times [2019-10-15 01:09:42,973 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:42,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734811955] [2019-10-15 01:09:42,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:43,138 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:09:43,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734811955] [2019-10-15 01:09:43,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:43,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:43,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544789462] [2019-10-15 01:09:43,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:43,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:43,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:43,140 INFO L87 Difference]: Start difference. First operand 607 states and 950 transitions. Second operand 7 states. [2019-10-15 01:09:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:43,222 INFO L93 Difference]: Finished difference Result 1135 states and 1801 transitions. [2019-10-15 01:09:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:43,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-15 01:09:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:43,227 INFO L225 Difference]: With dead ends: 1135 [2019-10-15 01:09:43,227 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:09:43,230 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:09:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:09:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-15 01:09:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-15 01:09:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 916 transitions. [2019-10-15 01:09:43,254 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 916 transitions. Word has length 134 [2019-10-15 01:09:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:43,254 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 916 transitions. [2019-10-15 01:09:43,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 916 transitions. [2019-10-15 01:09:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:09:43,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:43,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:43,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2087814641, now seen corresponding path program 1 times [2019-10-15 01:09:43,261 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:43,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464554154] [2019-10-15 01:09:43,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:43,433 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:09:43,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464554154] [2019-10-15 01:09:43,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:43,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:43,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470447218] [2019-10-15 01:09:43,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:43,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:43,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:43,437 INFO L87 Difference]: Start difference. First operand 586 states and 916 transitions. Second operand 6 states. [2019-10-15 01:09:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:43,536 INFO L93 Difference]: Finished difference Result 1114 states and 1767 transitions. [2019-10-15 01:09:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:43,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-15 01:09:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:43,541 INFO L225 Difference]: With dead ends: 1114 [2019-10-15 01:09:43,541 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:09:43,545 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:09:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:09:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-15 01:09:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-15 01:09:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 915 transitions. [2019-10-15 01:09:43,570 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 915 transitions. Word has length 135 [2019-10-15 01:09:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:43,571 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 915 transitions. [2019-10-15 01:09:43,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 915 transitions. [2019-10-15 01:09:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:09:43,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:43,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:43,576 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1341910135, now seen corresponding path program 1 times [2019-10-15 01:09:43,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:43,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721722104] [2019-10-15 01:09:43,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:43,753 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:09:43,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721722104] [2019-10-15 01:09:43,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:43,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:43,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953594342] [2019-10-15 01:09:43,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:43,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:43,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:43,756 INFO L87 Difference]: Start difference. First operand 586 states and 915 transitions. Second operand 6 states. [2019-10-15 01:09:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:43,886 INFO L93 Difference]: Finished difference Result 1114 states and 1766 transitions. [2019-10-15 01:09:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:43,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-15 01:09:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:43,894 INFO L225 Difference]: With dead ends: 1114 [2019-10-15 01:09:43,894 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:09:43,899 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:09:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:09:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-15 01:09:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-15 01:09:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 914 transitions. [2019-10-15 01:09:43,930 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 914 transitions. Word has length 136 [2019-10-15 01:09:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:43,931 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 914 transitions. [2019-10-15 01:09:43,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 914 transitions. [2019-10-15 01:09:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:09:43,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:43,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:43,939 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash -50054806, now seen corresponding path program 1 times [2019-10-15 01:09:43,940 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:43,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513662740] [2019-10-15 01:09:43,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:44,229 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:09:44,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513662740] [2019-10-15 01:09:44,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:44,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:44,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807778280] [2019-10-15 01:09:44,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:44,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:44,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:44,232 INFO L87 Difference]: Start difference. First operand 586 states and 914 transitions. Second operand 12 states. [2019-10-15 01:09:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:44,435 INFO L93 Difference]: Finished difference Result 1115 states and 1765 transitions. [2019-10-15 01:09:44,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:44,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-10-15 01:09:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:44,442 INFO L225 Difference]: With dead ends: 1115 [2019-10-15 01:09:44,442 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:09:44,446 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:09:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:09:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-15 01:09:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-15 01:09:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 913 transitions. [2019-10-15 01:09:44,470 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 913 transitions. Word has length 137 [2019-10-15 01:09:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:44,470 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 913 transitions. [2019-10-15 01:09:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 913 transitions. [2019-10-15 01:09:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:09:44,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:44,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:44,475 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -749925748, now seen corresponding path program 1 times [2019-10-15 01:09:44,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:44,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472386000] [2019-10-15 01:09:44,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:44,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:44,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:44,676 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:09:44,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472386000] [2019-10-15 01:09:44,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:44,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:44,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514705915] [2019-10-15 01:09:44,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:44,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:44,679 INFO L87 Difference]: Start difference. First operand 586 states and 913 transitions. Second operand 6 states. [2019-10-15 01:09:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:48,704 INFO L93 Difference]: Finished difference Result 1727 states and 2803 transitions. [2019-10-15 01:09:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:09:48,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-15 01:09:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:48,715 INFO L225 Difference]: With dead ends: 1727 [2019-10-15 01:09:48,715 INFO L226 Difference]: Without dead ends: 1207 [2019-10-15 01:09:48,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-10-15 01:09:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1124. [2019-10-15 01:09:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-15 01:09:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1787 transitions. [2019-10-15 01:09:48,796 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1787 transitions. Word has length 138 [2019-10-15 01:09:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:48,796 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1787 transitions. [2019-10-15 01:09:48,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1787 transitions. [2019-10-15 01:09:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:09:48,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:48,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:48,802 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash -84982961, now seen corresponding path program 1 times [2019-10-15 01:09:48,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:48,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449595484] [2019-10-15 01:09:48,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:48,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:48,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:48,974 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:09:48,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449595484] [2019-10-15 01:09:48,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:48,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:48,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919059495] [2019-10-15 01:09:48,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:48,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:48,983 INFO L87 Difference]: Start difference. First operand 1124 states and 1787 transitions. Second operand 6 states. [2019-10-15 01:09:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:52,872 INFO L93 Difference]: Finished difference Result 3556 states and 5857 transitions. [2019-10-15 01:09:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:09:52,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-15 01:09:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:52,898 INFO L225 Difference]: With dead ends: 3556 [2019-10-15 01:09:52,898 INFO L226 Difference]: Without dead ends: 2499 [2019-10-15 01:09:52,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-10-15 01:09:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2306. [2019-10-15 01:09:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-10-15 01:09:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3726 transitions. [2019-10-15 01:09:53,054 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3726 transitions. Word has length 139 [2019-10-15 01:09:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:53,054 INFO L462 AbstractCegarLoop]: Abstraction has 2306 states and 3726 transitions. [2019-10-15 01:09:53,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3726 transitions. [2019-10-15 01:09:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:53,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:53,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:53,061 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -708797968, now seen corresponding path program 1 times [2019-10-15 01:09:53,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:53,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092731307] [2019-10-15 01:09:53,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:53,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:53,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:53,257 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:09:53,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092731307] [2019-10-15 01:09:53,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:53,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:53,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106823823] [2019-10-15 01:09:53,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:53,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:53,261 INFO L87 Difference]: Start difference. First operand 2306 states and 3726 transitions. Second operand 6 states. [2019-10-15 01:09:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:57,765 INFO L93 Difference]: Finished difference Result 7701 states and 12901 transitions. [2019-10-15 01:09:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:09:57,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-15 01:09:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:57,809 INFO L225 Difference]: With dead ends: 7701 [2019-10-15 01:09:57,809 INFO L226 Difference]: Without dead ends: 5464 [2019-10-15 01:09:57,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-10-15 01:09:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 4964. [2019-10-15 01:09:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4964 states. [2019-10-15 01:09:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8151 transitions. [2019-10-15 01:09:58,229 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8151 transitions. Word has length 140 [2019-10-15 01:09:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:58,230 INFO L462 AbstractCegarLoop]: Abstraction has 4964 states and 8151 transitions. [2019-10-15 01:09:58,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8151 transitions. [2019-10-15 01:09:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:09:58,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:58,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:58,240 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1665568371, now seen corresponding path program 1 times [2019-10-15 01:09:58,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:58,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482037099] [2019-10-15 01:09:58,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:58,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:58,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:58,442 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:09:58,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482037099] [2019-10-15 01:09:58,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:58,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:58,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295866718] [2019-10-15 01:09:58,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:58,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:58,444 INFO L87 Difference]: Start difference. First operand 4964 states and 8151 transitions. Second operand 6 states. [2019-10-15 01:10:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:03,056 INFO L93 Difference]: Finished difference Result 17370 states and 29709 transitions. [2019-10-15 01:10:03,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:10:03,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:10:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:03,176 INFO L225 Difference]: With dead ends: 17370 [2019-10-15 01:10:03,176 INFO L226 Difference]: Without dead ends: 12479 [2019-10-15 01:10:03,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2019-10-15 01:10:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 11114. [2019-10-15 01:10:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2019-10-15 01:10:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 18594 transitions. [2019-10-15 01:10:04,001 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 18594 transitions. Word has length 141 [2019-10-15 01:10:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:04,002 INFO L462 AbstractCegarLoop]: Abstraction has 11114 states and 18594 transitions. [2019-10-15 01:10:04,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 18594 transitions. [2019-10-15 01:10:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:10:04,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:04,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,009 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691372, now seen corresponding path program 1 times [2019-10-15 01:10:04,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:04,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523231411] [2019-10-15 01:10:04,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:04,808 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:10:04,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523231411] [2019-10-15 01:10:04,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:04,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:04,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231662952] [2019-10-15 01:10:04,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:04,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:04,811 INFO L87 Difference]: Start difference. First operand 11114 states and 18594 transitions. Second operand 6 states.