/usr/bin/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_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:42:49,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:42:49,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:42:49,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:42:49,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:42:49,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:42:49,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:42:49,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:42:49,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:42:49,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:42:49,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:42:49,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:42:49,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:42:49,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:42:49,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:42:49,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:42:49,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:42:49,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:42:49,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:42:49,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:42:49,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:42:49,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:42:49,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:42:49,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:42:49,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:42:49,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:42:49,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:42:49,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:42:49,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:42:49,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:42:49,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:42:49,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:42:49,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:42:49,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:42:49,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:42:49,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:42:49,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:42:49,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:42:49,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:42:49,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:42:49,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:42:49,798 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-11-07 00:42:49,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:42:49,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:42:49,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:42:49,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:42:49,815 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:42:49,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:42:49,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:42:49,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:42:49,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:42:49,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:42:49,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:42:49,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:42:49,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:42:49,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:42:49,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:42:49,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:42:49,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:42:49,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:42:49,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:42:49,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:42:49,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:42:49,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:42:49,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:42:49,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:42:49,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:42:49,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:42:49,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:42:49,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:42:49,820 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-11-07 00:42:50,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:42:50,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:42:50,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:42:50,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:42:50,171 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:42:50,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-11-07 00:42:50,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8bfb03/de1205b4e8064a1ebde703f154f5ab6b/FLAG7d09ae69a [2019-11-07 00:42:50,891 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:42:50,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-11-07 00:42:50,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8bfb03/de1205b4e8064a1ebde703f154f5ab6b/FLAG7d09ae69a [2019-11-07 00:42:51,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8bfb03/de1205b4e8064a1ebde703f154f5ab6b [2019-11-07 00:42:51,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:42:51,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:42:51,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:42:51,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:42:51,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:42:51,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:51" (1/1) ... [2019-11-07 00:42:51,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c419196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:51, skipping insertion in model container [2019-11-07 00:42:51,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:51" (1/1) ... [2019-11-07 00:42:51,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:42:51,167 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:42:51,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:42:51,955 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:42:52,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:42:52,186 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:42:52,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52 WrapperNode [2019-11-07 00:42:52,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:42:52,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:42:52,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:42:52,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:42:52,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... [2019-11-07 00:42:52,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:42:52,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:42:52,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:42:52,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:42:52,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:42:52,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:42:52,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-11-07 00:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-11-07 00:42:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-11-07 00:42:52,502 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-11-07 00:42:52,502 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-11-07 00:42:52,503 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-11-07 00:42:52,503 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-11-07 00:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-11-07 00:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-11-07 00:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-11-07 00:42:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-11-07 00:42:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-11-07 00:42:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-11-07 00:42:52,506 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-11-07 00:42:52,508 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-11-07 00:42:52,508 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-11-07 00:42:52,508 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-11-07 00:42:52,508 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-11-07 00:42:52,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-11-07 00:42:52,509 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-11-07 00:42:52,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:42:52,509 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-11-07 00:42:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-11-07 00:42:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-11-07 00:42:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-11-07 00:42:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-11-07 00:42:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-11-07 00:42:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-11-07 00:42:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-11-07 00:42:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-11-07 00:42:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-11-07 00:42:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-11-07 00:42:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-11-07 00:42:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-11-07 00:42:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-11-07 00:42:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-11-07 00:42:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-11-07 00:42:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:42:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:42:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:42:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:42:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-11-07 00:42:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-11-07 00:42:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-11-07 00:42:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-11-07 00:42:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-11-07 00:42:52,514 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-11-07 00:42:52,515 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-11-07 00:42:52,515 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-11-07 00:42:52,515 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-11-07 00:42:52,515 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-11-07 00:42:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-11-07 00:42:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-11-07 00:42:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-11-07 00:42:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-11-07 00:42:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-11-07 00:42:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-11-07 00:42:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-11-07 00:42:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-11-07 00:42:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-11-07 00:42:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-11-07 00:42:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-11-07 00:42:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-11-07 00:42:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-11-07 00:42:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-11-07 00:42:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-11-07 00:42:52,519 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-11-07 00:42:52,519 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-11-07 00:42:52,519 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-11-07 00:42:52,519 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-11-07 00:42:52,519 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-11-07 00:42:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-11-07 00:42:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-11-07 00:42:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-11-07 00:42:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-11-07 00:42:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-11-07 00:42:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-11-07 00:42:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:42:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:42:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-11-07 00:42:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-11-07 00:42:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-11-07 00:42:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 00:42:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-11-07 00:42:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-11-07 00:42:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-11-07 00:42:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-11-07 00:42:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-11-07 00:42:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-11-07 00:42:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-11-07 00:42:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-11-07 00:42:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-11-07 00:42:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-11-07 00:42:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-11-07 00:42:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-11-07 00:42:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-11-07 00:42:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-11-07 00:42:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-11-07 00:42:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:42:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:42:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-11-07 00:42:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-11-07 00:42:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-11-07 00:42:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-11-07 00:42:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-11-07 00:42:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:42:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-11-07 00:42:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-11-07 00:42:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-11-07 00:42:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-11-07 00:42:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-11-07 00:42:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-11-07 00:42:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-11-07 00:42:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-11-07 00:42:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-11-07 00:42:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-11-07 00:42:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-11-07 00:42:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-11-07 00:42:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-11-07 00:42:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-11-07 00:42:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:42:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:42:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-07 00:42:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-11-07 00:42:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-11-07 00:42:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-11-07 00:42:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-11-07 00:42:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-11-07 00:42:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-11-07 00:42:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-11-07 00:42:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-11-07 00:42:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-11-07 00:42:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-11-07 00:42:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-11-07 00:42:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-11-07 00:42:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-11-07 00:42:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-11-07 00:42:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-11-07 00:42:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-11-07 00:42:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-11-07 00:42:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-11-07 00:42:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:42:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-07 00:42:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:42:54,925 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:42:54,926 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-07 00:42:54,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:54 BoogieIcfgContainer [2019-11-07 00:42:54,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:42:54,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:42:54,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:42:54,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:42:54,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:51" (1/3) ... [2019-11-07 00:42:54,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc7bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:54, skipping insertion in model container [2019-11-07 00:42:54,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:52" (2/3) ... [2019-11-07 00:42:54,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc7bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:54, skipping insertion in model container [2019-11-07 00:42:54,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:54" (3/3) ... [2019-11-07 00:42:54,939 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2019-11-07 00:42:54,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:42:54,961 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:42:54,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:42:55,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:42:55,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:42:55,021 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:42:55,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:42:55,021 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:42:55,021 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:42:55,021 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:42:55,021 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:42:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states. [2019-11-07 00:42:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 00:42:55,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:55,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:55,096 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash -157007896, now seen corresponding path program 1 times [2019-11-07 00:42:55,114 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:55,115 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068397361] [2019-11-07 00:42:55,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:55,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068397361] [2019-11-07 00:42:55,749 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:55,749 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:55,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964130383] [2019-11-07 00:42:55,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:55,757 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:55,776 INFO L87 Difference]: Start difference. First operand 805 states. Second operand 4 states. [2019-11-07 00:42:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:55,973 INFO L93 Difference]: Finished difference Result 1259 states and 2029 transitions. [2019-11-07 00:42:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:55,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-07 00:42:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:56,021 INFO L225 Difference]: With dead ends: 1259 [2019-11-07 00:42:56,021 INFO L226 Difference]: Without dead ends: 638 [2019-11-07 00:42:56,034 INFO L630 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-11-07 00:42:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-07 00:42:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-11-07 00:42:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 00:42:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1016 transitions. [2019-11-07 00:42:56,183 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1016 transitions. Word has length 85 [2019-11-07 00:42:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:56,184 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1016 transitions. [2019-11-07 00:42:56,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1016 transitions. [2019-11-07 00:42:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-07 00:42:56,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:56,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:56,190 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2067866645, now seen corresponding path program 1 times [2019-11-07 00:42:56,191 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:56,191 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274174861] [2019-11-07 00:42:56,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:56,420 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274174861] [2019-11-07 00:42:56,420 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:56,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:56,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752389267] [2019-11-07 00:42:56,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:56,426 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:56,427 INFO L87 Difference]: Start difference. First operand 638 states and 1016 transitions. Second operand 4 states. [2019-11-07 00:42:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:56,518 INFO L93 Difference]: Finished difference Result 1239 states and 1990 transitions. [2019-11-07 00:42:56,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:56,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-07 00:42:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:56,524 INFO L225 Difference]: With dead ends: 1239 [2019-11-07 00:42:56,524 INFO L226 Difference]: Without dead ends: 638 [2019-11-07 00:42:56,528 INFO L630 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-11-07 00:42:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-07 00:42:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-11-07 00:42:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 00:42:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1015 transitions. [2019-11-07 00:42:56,574 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1015 transitions. Word has length 88 [2019-11-07 00:42:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:56,574 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1015 transitions. [2019-11-07 00:42:56,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1015 transitions. [2019-11-07 00:42:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-07 00:42:56,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:56,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:56,579 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1753669847, now seen corresponding path program 1 times [2019-11-07 00:42:56,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:56,580 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047170524] [2019-11-07 00:42:56,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:56,780 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047170524] [2019-11-07 00:42:56,781 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:56,781 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:56,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848146332] [2019-11-07 00:42:56,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:56,782 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:56,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:56,782 INFO L87 Difference]: Start difference. First operand 638 states and 1015 transitions. Second operand 4 states. [2019-11-07 00:42:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:56,869 INFO L93 Difference]: Finished difference Result 1239 states and 1989 transitions. [2019-11-07 00:42:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:56,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-07 00:42:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:56,882 INFO L225 Difference]: With dead ends: 1239 [2019-11-07 00:42:56,882 INFO L226 Difference]: Without dead ends: 638 [2019-11-07 00:42:56,891 INFO L630 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-11-07 00:42:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-07 00:42:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-11-07 00:42:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 00:42:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1014 transitions. [2019-11-07 00:42:56,936 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1014 transitions. Word has length 89 [2019-11-07 00:42:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:56,936 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1014 transitions. [2019-11-07 00:42:56,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1014 transitions. [2019-11-07 00:42:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-07 00:42:56,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:56,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:56,939 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 43566311, now seen corresponding path program 1 times [2019-11-07 00:42:56,940 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:56,940 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566265797] [2019-11-07 00:42:56,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:57,079 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566265797] [2019-11-07 00:42:57,080 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:57,080 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:57,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60613393] [2019-11-07 00:42:57,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:57,081 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:57,082 INFO L87 Difference]: Start difference. First operand 638 states and 1014 transitions. Second operand 4 states. [2019-11-07 00:42:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:57,152 INFO L93 Difference]: Finished difference Result 1239 states and 1988 transitions. [2019-11-07 00:42:57,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:57,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-07 00:42:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:57,160 INFO L225 Difference]: With dead ends: 1239 [2019-11-07 00:42:57,160 INFO L226 Difference]: Without dead ends: 638 [2019-11-07 00:42:57,163 INFO L630 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-11-07 00:42:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-07 00:42:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-11-07 00:42:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 00:42:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1013 transitions. [2019-11-07 00:42:57,202 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1013 transitions. Word has length 90 [2019-11-07 00:42:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:57,203 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1013 transitions. [2019-11-07 00:42:57,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1013 transitions. [2019-11-07 00:42:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 00:42:57,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:57,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:57,209 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1348686253, now seen corresponding path program 1 times [2019-11-07 00:42:57,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:57,211 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34899481] [2019-11-07 00:42:57,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:57,359 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34899481] [2019-11-07 00:42:57,360 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:57,360 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54726630] [2019-11-07 00:42:57,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:57,361 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:57,362 INFO L87 Difference]: Start difference. First operand 638 states and 1013 transitions. Second operand 4 states. [2019-11-07 00:42:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:57,428 INFO L93 Difference]: Finished difference Result 1239 states and 1987 transitions. [2019-11-07 00:42:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:57,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-07 00:42:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:57,440 INFO L225 Difference]: With dead ends: 1239 [2019-11-07 00:42:57,440 INFO L226 Difference]: Without dead ends: 638 [2019-11-07 00:42:57,444 INFO L630 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-11-07 00:42:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-07 00:42:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-11-07 00:42:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 00:42:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1012 transitions. [2019-11-07 00:42:57,474 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1012 transitions. Word has length 91 [2019-11-07 00:42:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:57,474 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1012 transitions. [2019-11-07 00:42:57,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1012 transitions. [2019-11-07 00:42:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 00:42:57,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:57,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:57,478 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1477493277, now seen corresponding path program 1 times [2019-11-07 00:42:57,479 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:57,479 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593854660] [2019-11-07 00:42:57,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:57,797 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593854660] [2019-11-07 00:42:57,799 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:57,799 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:42:57,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263366009] [2019-11-07 00:42:57,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:42:57,802 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:42:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:42:57,806 INFO L87 Difference]: Start difference. First operand 638 states and 1012 transitions. Second operand 10 states. [2019-11-07 00:42:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:58,030 INFO L93 Difference]: Finished difference Result 1197 states and 1907 transitions. [2019-11-07 00:42:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:42:58,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-11-07 00:42:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:58,037 INFO L225 Difference]: With dead ends: 1197 [2019-11-07 00:42:58,037 INFO L226 Difference]: Without dead ends: 647 [2019-11-07 00:42:58,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:42:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-11-07 00:42:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-11-07 00:42:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-07 00:42:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1021 transitions. [2019-11-07 00:42:58,074 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1021 transitions. Word has length 92 [2019-11-07 00:42:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:58,075 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 1021 transitions. [2019-11-07 00:42:58,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:42:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1021 transitions. [2019-11-07 00:42:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 00:42:58,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:58,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:58,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1457155902, now seen corresponding path program 1 times [2019-11-07 00:42:58,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:58,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075033284] [2019-11-07 00:42:58,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:58,189 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075033284] [2019-11-07 00:42:58,189 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:58,189 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:58,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756420733] [2019-11-07 00:42:58,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:58,190 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:58,191 INFO L87 Difference]: Start difference. First operand 645 states and 1021 transitions. Second operand 4 states. [2019-11-07 00:42:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:58,245 INFO L93 Difference]: Finished difference Result 1245 states and 1993 transitions. [2019-11-07 00:42:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:58,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-07 00:42:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:58,252 INFO L225 Difference]: With dead ends: 1245 [2019-11-07 00:42:58,253 INFO L226 Difference]: Without dead ends: 632 [2019-11-07 00:42:58,256 INFO L630 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-11-07 00:42:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-07 00:42:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-11-07 00:42:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-07 00:42:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 998 transitions. [2019-11-07 00:42:58,280 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 998 transitions. Word has length 92 [2019-11-07 00:42:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:58,280 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 998 transitions. [2019-11-07 00:42:58,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 998 transitions. [2019-11-07 00:42:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 00:42:58,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:58,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:58,285 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1488514411, now seen corresponding path program 1 times [2019-11-07 00:42:58,286 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:58,286 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026257905] [2019-11-07 00:42:58,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:58,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026257905] [2019-11-07 00:42:58,430 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:58,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:58,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222159049] [2019-11-07 00:42:58,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:58,431 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:58,431 INFO L87 Difference]: Start difference. First operand 632 states and 998 transitions. Second operand 6 states. [2019-11-07 00:42:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:58,728 INFO L93 Difference]: Finished difference Result 1185 states and 1885 transitions. [2019-11-07 00:42:58,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:58,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-07 00:42:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:58,734 INFO L225 Difference]: With dead ends: 1185 [2019-11-07 00:42:58,734 INFO L226 Difference]: Without dead ends: 632 [2019-11-07 00:42:58,737 INFO L630 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-11-07 00:42:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-07 00:42:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-11-07 00:42:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-07 00:42:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 994 transitions. [2019-11-07 00:42:58,762 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 994 transitions. Word has length 93 [2019-11-07 00:42:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:58,762 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 994 transitions. [2019-11-07 00:42:58,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 994 transitions. [2019-11-07 00:42:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-07 00:42:58,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:58,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:58,765 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1742740858, now seen corresponding path program 1 times [2019-11-07 00:42:58,765 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:58,765 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289150114] [2019-11-07 00:42:58,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:58,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289150114] [2019-11-07 00:42:58,882 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:58,883 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:58,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182287294] [2019-11-07 00:42:58,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:58,884 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:58,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:58,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:58,884 INFO L87 Difference]: Start difference. First operand 632 states and 994 transitions. Second operand 6 states. [2019-11-07 00:42:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,076 INFO L93 Difference]: Finished difference Result 1185 states and 1881 transitions. [2019-11-07 00:42:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:59,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-07 00:42:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:59,082 INFO L225 Difference]: With dead ends: 1185 [2019-11-07 00:42:59,082 INFO L226 Difference]: Without dead ends: 632 [2019-11-07 00:42:59,086 INFO L630 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-11-07 00:42:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-07 00:42:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-11-07 00:42:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-07 00:42:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 990 transitions. [2019-11-07 00:42:59,108 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 990 transitions. Word has length 94 [2019-11-07 00:42:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:59,108 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 990 transitions. [2019-11-07 00:42:59,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 990 transitions. [2019-11-07 00:42:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 00:42:59,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:59,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:59,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1072622918, now seen corresponding path program 1 times [2019-11-07 00:42:59,111 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:59,111 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926301792] [2019-11-07 00:42:59,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:59,227 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926301792] [2019-11-07 00:42:59,227 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:59,227 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:59,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459782697] [2019-11-07 00:42:59,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:59,228 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:59,229 INFO L87 Difference]: Start difference. First operand 632 states and 990 transitions. Second operand 6 states. [2019-11-07 00:42:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,425 INFO L93 Difference]: Finished difference Result 1185 states and 1877 transitions. [2019-11-07 00:42:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:59,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-07 00:42:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:59,432 INFO L225 Difference]: With dead ends: 1185 [2019-11-07 00:42:59,432 INFO L226 Difference]: Without dead ends: 632 [2019-11-07 00:42:59,435 INFO L630 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-11-07 00:42:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-07 00:42:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-11-07 00:42:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-07 00:42:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 986 transitions. [2019-11-07 00:42:59,461 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 986 transitions. Word has length 95 [2019-11-07 00:42:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:59,461 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 986 transitions. [2019-11-07 00:42:59,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 986 transitions. [2019-11-07 00:42:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 00:42:59,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:59,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:59,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash -24768710, now seen corresponding path program 1 times [2019-11-07 00:42:59,464 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:59,464 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472639974] [2019-11-07 00:42:59,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:59,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472639974] [2019-11-07 00:42:59,675 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:59,675 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:42:59,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978262052] [2019-11-07 00:42:59,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:42:59,676 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:42:59,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:42:59,676 INFO L87 Difference]: Start difference. First operand 632 states and 986 transitions. Second operand 7 states. [2019-11-07 00:42:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,753 INFO L93 Difference]: Finished difference Result 1185 states and 1873 transitions. [2019-11-07 00:42:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:42:59,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-07 00:42:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:59,759 INFO L225 Difference]: With dead ends: 1185 [2019-11-07 00:42:59,759 INFO L226 Difference]: Without dead ends: 611 [2019-11-07 00:42:59,762 INFO L630 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-11-07 00:42:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-07 00:42:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-07 00:42:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-07 00:42:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 952 transitions. [2019-11-07 00:42:59,784 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 952 transitions. Word has length 95 [2019-11-07 00:42:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:59,784 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 952 transitions. [2019-11-07 00:42:59,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:42:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 952 transitions. [2019-11-07 00:42:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-07 00:42:59,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:59,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:59,786 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1812600053, now seen corresponding path program 1 times [2019-11-07 00:42:59,787 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:59,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115951383] [2019-11-07 00:42:59,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:59,901 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115951383] [2019-11-07 00:42:59,901 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:59,902 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:59,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267106693] [2019-11-07 00:42:59,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:59,903 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:59,903 INFO L87 Difference]: Start difference. First operand 611 states and 952 transitions. Second operand 6 states. [2019-11-07 00:42:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,996 INFO L93 Difference]: Finished difference Result 1164 states and 1839 transitions. [2019-11-07 00:42:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:59,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-07 00:42:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:00,002 INFO L225 Difference]: With dead ends: 1164 [2019-11-07 00:43:00,002 INFO L226 Difference]: Without dead ends: 611 [2019-11-07 00:43:00,005 INFO L630 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-11-07 00:43:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-07 00:43:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-07 00:43:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-07 00:43:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-11-07 00:43:00,026 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 96 [2019-11-07 00:43:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:00,026 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-11-07 00:43:00,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-11-07 00:43:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 00:43:00,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:00,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:00,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash 979115743, now seen corresponding path program 1 times [2019-11-07 00:43:00,029 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:00,029 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557327393] [2019-11-07 00:43:00,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:00,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557327393] [2019-11-07 00:43:00,137 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:00,137 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:00,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419472491] [2019-11-07 00:43:00,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:00,138 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:00,138 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-11-07 00:43:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:00,228 INFO L93 Difference]: Finished difference Result 1164 states and 1838 transitions. [2019-11-07 00:43:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:00,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-07 00:43:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:00,234 INFO L225 Difference]: With dead ends: 1164 [2019-11-07 00:43:00,234 INFO L226 Difference]: Without dead ends: 611 [2019-11-07 00:43:00,237 INFO L630 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-11-07 00:43:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-07 00:43:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-07 00:43:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-07 00:43:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 950 transitions. [2019-11-07 00:43:00,267 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 950 transitions. Word has length 97 [2019-11-07 00:43:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:00,269 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 950 transitions. [2019-11-07 00:43:00,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 950 transitions. [2019-11-07 00:43:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 00:43:00,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:00,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:00,272 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1568643986, now seen corresponding path program 1 times [2019-11-07 00:43:00,272 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:00,272 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870217562] [2019-11-07 00:43:00,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:00,435 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870217562] [2019-11-07 00:43:00,435 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:00,436 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:00,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626536451] [2019-11-07 00:43:00,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:00,436 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:00,437 INFO L87 Difference]: Start difference. First operand 611 states and 950 transitions. Second operand 4 states. [2019-11-07 00:43:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:00,484 INFO L93 Difference]: Finished difference Result 1164 states and 1837 transitions. [2019-11-07 00:43:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:43:00,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-07 00:43:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:00,490 INFO L225 Difference]: With dead ends: 1164 [2019-11-07 00:43:00,490 INFO L226 Difference]: Without dead ends: 611 [2019-11-07 00:43:00,494 INFO L630 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-11-07 00:43:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-07 00:43:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-07 00:43:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-07 00:43:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 949 transitions. [2019-11-07 00:43:00,515 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 949 transitions. Word has length 98 [2019-11-07 00:43:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:00,515 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 949 transitions. [2019-11-07 00:43:00,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 949 transitions. [2019-11-07 00:43:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 00:43:00,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:00,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:00,518 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1584162704, now seen corresponding path program 1 times [2019-11-07 00:43:00,518 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:00,518 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872866486] [2019-11-07 00:43:00,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:00,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872866486] [2019-11-07 00:43:00,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:00,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:43:00,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231203046] [2019-11-07 00:43:00,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:43:00,708 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:43:00,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:43:00,709 INFO L87 Difference]: Start difference. First operand 611 states and 949 transitions. Second operand 12 states. [2019-11-07 00:43:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:00,962 INFO L93 Difference]: Finished difference Result 1165 states and 1836 transitions. [2019-11-07 00:43:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:43:00,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-11-07 00:43:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:00,969 INFO L225 Difference]: With dead ends: 1165 [2019-11-07 00:43:00,970 INFO L226 Difference]: Without dead ends: 611 [2019-11-07 00:43:00,977 INFO L630 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-11-07 00:43:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-07 00:43:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-07 00:43:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-07 00:43:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 948 transitions. [2019-11-07 00:43:01,004 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 948 transitions. Word has length 98 [2019-11-07 00:43:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:01,005 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 948 transitions. [2019-11-07 00:43:01,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:43:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 948 transitions. [2019-11-07 00:43:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-07 00:43:01,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:01,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:01,009 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash -225790824, now seen corresponding path program 1 times [2019-11-07 00:43:01,010 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:01,010 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420428153] [2019-11-07 00:43:01,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:01,251 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420428153] [2019-11-07 00:43:01,255 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:01,255 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:43:01,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145944462] [2019-11-07 00:43:01,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:43:01,258 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:43:01,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:43:01,259 INFO L87 Difference]: Start difference. First operand 611 states and 948 transitions. Second operand 9 states. [2019-11-07 00:43:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:08,878 INFO L93 Difference]: Finished difference Result 1667 states and 2655 transitions. [2019-11-07 00:43:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 00:43:08,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-11-07 00:43:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:08,892 INFO L225 Difference]: With dead ends: 1667 [2019-11-07 00:43:08,893 INFO L226 Difference]: Without dead ends: 1122 [2019-11-07 00:43:08,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-11-07 00:43:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-11-07 00:43:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1090. [2019-11-07 00:43:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-11-07 00:43:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1688 transitions. [2019-11-07 00:43:08,985 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1688 transitions. Word has length 99 [2019-11-07 00:43:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1688 transitions. [2019-11-07 00:43:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:43:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1688 transitions. [2019-11-07 00:43:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 00:43:08,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:08,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:08,993 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:08,994 INFO L82 PathProgramCache]: Analyzing trace with hash 238992682, now seen corresponding path program 1 times [2019-11-07 00:43:08,994 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:08,994 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916082964] [2019-11-07 00:43:08,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:09,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916082964] [2019-11-07 00:43:09,185 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:09,185 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:43:09,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352095374] [2019-11-07 00:43:09,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:43:09,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:09,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:43:09,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:43:09,187 INFO L87 Difference]: Start difference. First operand 1090 states and 1688 transitions. Second operand 5 states. [2019-11-07 00:43:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:11,505 INFO L93 Difference]: Finished difference Result 3272 states and 5205 transitions. [2019-11-07 00:43:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:43:11,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-11-07 00:43:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:11,527 INFO L225 Difference]: With dead ends: 3272 [2019-11-07 00:43:11,528 INFO L226 Difference]: Without dead ends: 2249 [2019-11-07 00:43:11,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-07 00:43:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2221. [2019-11-07 00:43:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-11-07 00:43:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3535 transitions. [2019-11-07 00:43:11,650 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3535 transitions. Word has length 100 [2019-11-07 00:43:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:11,651 INFO L462 AbstractCegarLoop]: Abstraction has 2221 states and 3535 transitions. [2019-11-07 00:43:11,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:43:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3535 transitions. [2019-11-07 00:43:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-07 00:43:11,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:11,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:11,654 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1182567146, now seen corresponding path program 1 times [2019-11-07 00:43:11,655 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:11,655 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097362927] [2019-11-07 00:43:11,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:11,797 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097362927] [2019-11-07 00:43:11,797 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:11,797 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:11,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575257847] [2019-11-07 00:43:11,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:11,798 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:11,799 INFO L87 Difference]: Start difference. First operand 2221 states and 3535 transitions. Second operand 4 states. [2019-11-07 00:43:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:14,007 INFO L93 Difference]: Finished difference Result 6897 states and 11306 transitions. [2019-11-07 00:43:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:43:14,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-07 00:43:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:14,056 INFO L225 Difference]: With dead ends: 6897 [2019-11-07 00:43:14,056 INFO L226 Difference]: Without dead ends: 4744 [2019-11-07 00:43:14,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-07 00:43:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2019-11-07 00:43:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4687. [2019-11-07 00:43:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-11-07 00:43:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 7714 transitions. [2019-11-07 00:43:14,372 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 7714 transitions. Word has length 101 [2019-11-07 00:43:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:14,373 INFO L462 AbstractCegarLoop]: Abstraction has 4687 states and 7714 transitions. [2019-11-07 00:43:14,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 7714 transitions. [2019-11-07 00:43:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-07 00:43:14,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:14,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:14,375 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:14,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1993722348, now seen corresponding path program 1 times [2019-11-07 00:43:14,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:14,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709501960] [2019-11-07 00:43:14,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:14,497 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709501960] [2019-11-07 00:43:14,497 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:14,497 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:14,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110729264] [2019-11-07 00:43:14,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:14,500 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:14,501 INFO L87 Difference]: Start difference. First operand 4687 states and 7714 transitions. Second operand 4 states. [2019-11-07 00:43:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:16,801 INFO L93 Difference]: Finished difference Result 14913 states and 25594 transitions. [2019-11-07 00:43:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:43:16,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-07 00:43:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:16,891 INFO L225 Difference]: With dead ends: 14913 [2019-11-07 00:43:16,891 INFO L226 Difference]: Without dead ends: 10296 [2019-11-07 00:43:16,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-07 00:43:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10296 states. [2019-11-07 00:43:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10296 to 10178. [2019-11-07 00:43:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10178 states. [2019-11-07 00:43:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10178 states to 10178 states and 17570 transitions. [2019-11-07 00:43:17,642 INFO L78 Accepts]: Start accepts. Automaton has 10178 states and 17570 transitions. Word has length 102 [2019-11-07 00:43:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:17,643 INFO L462 AbstractCegarLoop]: Abstraction has 10178 states and 17570 transitions. [2019-11-07 00:43:17,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 10178 states and 17570 transitions. [2019-11-07 00:43:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-07 00:43:17,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:17,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:43:17,646 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1674452760, now seen corresponding path program 1 times [2019-11-07 00:43:17,646 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:17,646 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193768915] [2019-11-07 00:43:17,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:43:17,773 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193768915] [2019-11-07 00:43:17,773 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:17,773 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:17,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016291974] [2019-11-07 00:43:17,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:17,775 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:17,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:17,775 INFO L87 Difference]: Start difference. First operand 10178 states and 17570 transitions. Second operand 4 states. [2019-11-07 00:43:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:21,158 INFO L93 Difference]: Finished difference Result 33056 states and 60889 transitions. [2019-11-07 00:43:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:43:21,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-07 00:43:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:21,374 INFO L225 Difference]: With dead ends: 33056 [2019-11-07 00:43:21,375 INFO L226 Difference]: Without dead ends: 22952 [2019-11-07 00:43:21,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-07 00:43:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22952 states.