java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:16,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:16,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:16,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:16,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:16,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:16,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:16,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:16,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:16,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:16,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:16,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:16,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:16,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:16,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:16,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:16,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:16,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:16,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:16,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:16,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:16,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:16,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:16,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:16,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:16,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:16,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:16,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:16,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:16,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:16,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:16,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:16,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:16,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:16,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:16,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:16,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:16,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:16,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:16,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:17,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:17,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:09:17,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:17,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:17,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:17,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:17,026 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:17,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:17,027 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:17,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:17,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:17,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:17,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:17,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:17,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:17,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:17,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:17,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:17,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:17,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:17,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:17,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:17,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:17,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:17,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:17,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:17,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:17,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:17,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:17,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:17,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:09:17,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:17,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:17,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:17,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:17,367 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:17,368 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-10-13 21:09:17,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d036d0268/cca61ee8d4cd491592aac96c52959b8a/FLAGb5bf017f1 [2019-10-13 21:09:18,127 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:18,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-10-13 21:09:18,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d036d0268/cca61ee8d4cd491592aac96c52959b8a/FLAGb5bf017f1 [2019-10-13 21:09:18,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d036d0268/cca61ee8d4cd491592aac96c52959b8a [2019-10-13 21:09:18,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:18,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:18,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:18,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:18,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:18,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:18" (1/1) ... [2019-10-13 21:09:18,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170a06bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:18, skipping insertion in model container [2019-10-13 21:09:18,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:18" (1/1) ... [2019-10-13 21:09:18,298 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:18,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:19,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:19,213 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:19,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:19,467 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:19,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19 WrapperNode [2019-10-13 21:09:19,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:19,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:19,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:19,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:19,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... [2019-10-13 21:09:19,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:19,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:19,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:19,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:19,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:19,820 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:19,820 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:19,821 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:19,822 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:19,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-13 21:09:19,824 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-13 21:09:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-13 21:09:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-13 21:09:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-13 21:09:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-13 21:09:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-13 21:09:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-13 21:09:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:19,827 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:19,828 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:19,828 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-13 21:09:19,828 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-13 21:09:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-13 21:09:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-13 21:09:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-13 21:09:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-13 21:09:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-13 21:09:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-13 21:09:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-13 21:09:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-13 21:09:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-13 21:09:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-13 21:09:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:19,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-13 21:09:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-13 21:09:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-13 21:09:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-13 21:09:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-13 21:09:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:22,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:22,351 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:22,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:22 BoogieIcfgContainer [2019-10-13 21:09:22,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:22,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:22,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:22,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:22,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:18" (1/3) ... [2019-10-13 21:09:22,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b48b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:22, skipping insertion in model container [2019-10-13 21:09:22,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:19" (2/3) ... [2019-10-13 21:09:22,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b48b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:22, skipping insertion in model container [2019-10-13 21:09:22,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:22" (3/3) ... [2019-10-13 21:09:22,363 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_productSimulator.cil.c [2019-10-13 21:09:22,374 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:22,384 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:22,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:22,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:22,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:22,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:22,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:22,446 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:22,446 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:22,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:22,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2019-10-13 21:09:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:09:22,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,504 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:22,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2107990238, now seen corresponding path program 1 times [2019-10-13 21:09:22,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265470191] [2019-10-13 21:09:22,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:23,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265470191] [2019-10-13 21:09:23,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:23,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346714247] [2019-10-13 21:09:23,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:23,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:23,310 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 6 states. [2019-10-13 21:09:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,544 INFO L93 Difference]: Finished difference Result 1446 states and 2245 transitions. [2019-10-13 21:09:23,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:23,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-13 21:09:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,584 INFO L225 Difference]: With dead ends: 1446 [2019-10-13 21:09:23,584 INFO L226 Difference]: Without dead ends: 726 [2019-10-13 21:09:23,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-10-13 21:09:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-10-13 21:09:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-13 21:09:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1115 transitions. [2019-10-13 21:09:23,769 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1115 transitions. Word has length 120 [2019-10-13 21:09:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,772 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1115 transitions. [2019-10-13 21:09:23,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1115 transitions. [2019-10-13 21:09:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:09:23,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,779 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:23,780 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2135919125, now seen corresponding path program 1 times [2019-10-13 21:09:23,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419089680] [2019-10-13 21:09:23,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:24,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419089680] [2019-10-13 21:09:24,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:24,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108560700] [2019-10-13 21:09:24,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:24,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:24,060 INFO L87 Difference]: Start difference. First operand 726 states and 1115 transitions. Second operand 4 states. [2019-10-13 21:09:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,150 INFO L93 Difference]: Finished difference Result 1410 states and 2184 transitions. [2019-10-13 21:09:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:24,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-13 21:09:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,159 INFO L225 Difference]: With dead ends: 1410 [2019-10-13 21:09:24,160 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:09:24,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:09:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-13 21:09:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-13 21:09:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1118 transitions. [2019-10-13 21:09:24,209 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1118 transitions. Word has length 121 [2019-10-13 21:09:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,210 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1118 transitions. [2019-10-13 21:09:24,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1118 transitions. [2019-10-13 21:09:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:09:24,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,215 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:24,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash -542373665, now seen corresponding path program 1 times [2019-10-13 21:09:24,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019083394] [2019-10-13 21:09:24,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:24,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019083394] [2019-10-13 21:09:24,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:24,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872552869] [2019-10-13 21:09:24,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:24,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:24,501 INFO L87 Difference]: Start difference. First operand 730 states and 1118 transitions. Second operand 4 states. [2019-10-13 21:09:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,606 INFO L93 Difference]: Finished difference Result 1407 states and 2171 transitions. [2019-10-13 21:09:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:24,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-13 21:09:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,619 INFO L225 Difference]: With dead ends: 1407 [2019-10-13 21:09:24,619 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:09:24,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:09:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-13 21:09:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-13 21:09:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1117 transitions. [2019-10-13 21:09:24,665 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1117 transitions. Word has length 122 [2019-10-13 21:09:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,666 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1117 transitions. [2019-10-13 21:09:24,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1117 transitions. [2019-10-13 21:09:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:09:24,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,673 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:24,673 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2073857327, now seen corresponding path program 1 times [2019-10-13 21:09:24,674 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653800333] [2019-10-13 21:09:24,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:24,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653800333] [2019-10-13 21:09:24,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:24,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115635842] [2019-10-13 21:09:24,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:24,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:24,853 INFO L87 Difference]: Start difference. First operand 730 states and 1117 transitions. Second operand 4 states. [2019-10-13 21:09:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,952 INFO L93 Difference]: Finished difference Result 1407 states and 2170 transitions. [2019-10-13 21:09:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:24,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-13 21:09:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,967 INFO L225 Difference]: With dead ends: 1407 [2019-10-13 21:09:24,968 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:09:24,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:09:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-13 21:09:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-13 21:09:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1116 transitions. [2019-10-13 21:09:25,060 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1116 transitions. Word has length 123 [2019-10-13 21:09:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,063 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1116 transitions. [2019-10-13 21:09:25,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1116 transitions. [2019-10-13 21:09:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 21:09:25,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,069 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:25,069 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1880970907, now seen corresponding path program 1 times [2019-10-13 21:09:25,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286265488] [2019-10-13 21:09:25,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:25,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286265488] [2019-10-13 21:09:25,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:25,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:25,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939803503] [2019-10-13 21:09:25,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:25,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:25,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:25,256 INFO L87 Difference]: Start difference. First operand 730 states and 1116 transitions. Second operand 4 states. [2019-10-13 21:09:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,327 INFO L93 Difference]: Finished difference Result 1407 states and 2169 transitions. [2019-10-13 21:09:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:25,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-13 21:09:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,340 INFO L225 Difference]: With dead ends: 1407 [2019-10-13 21:09:25,341 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:09:25,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:09:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-13 21:09:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-13 21:09:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1115 transitions. [2019-10-13 21:09:25,376 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1115 transitions. Word has length 124 [2019-10-13 21:09:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,377 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1115 transitions. [2019-10-13 21:09:25,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1115 transitions. [2019-10-13 21:09:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 21:09:25,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,381 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:25,381 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -182191219, now seen corresponding path program 1 times [2019-10-13 21:09:25,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225878907] [2019-10-13 21:09:25,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:25,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225878907] [2019-10-13 21:09:25,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:25,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:25,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093710740] [2019-10-13 21:09:25,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:25,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:25,532 INFO L87 Difference]: Start difference. First operand 730 states and 1115 transitions. Second operand 4 states. [2019-10-13 21:09:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,596 INFO L93 Difference]: Finished difference Result 1407 states and 2168 transitions. [2019-10-13 21:09:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:25,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-13 21:09:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,603 INFO L225 Difference]: With dead ends: 1407 [2019-10-13 21:09:25,603 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:09:25,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:09:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-13 21:09:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-13 21:09:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1114 transitions. [2019-10-13 21:09:25,634 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1114 transitions. Word has length 125 [2019-10-13 21:09:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,635 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1114 transitions. [2019-10-13 21:09:25,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1114 transitions. [2019-10-13 21:09:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:09:25,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,637 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:25,638 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash 175506519, now seen corresponding path program 1 times [2019-10-13 21:09:25,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153937997] [2019-10-13 21:09:25,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:25,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153937997] [2019-10-13 21:09:25,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:25,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 21:09:25,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78973174] [2019-10-13 21:09:25,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:09:25,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:09:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:25,912 INFO L87 Difference]: Start difference. First operand 730 states and 1114 transitions. Second operand 11 states. [2019-10-13 21:09:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:26,187 INFO L93 Difference]: Finished difference Result 1412 states and 2175 transitions. [2019-10-13 21:09:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:09:26,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-10-13 21:09:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:26,194 INFO L225 Difference]: With dead ends: 1412 [2019-10-13 21:09:26,194 INFO L226 Difference]: Without dead ends: 739 [2019-10-13 21:09:26,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-10-13 21:09:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2019-10-13 21:09:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-13 21:09:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1124 transitions. [2019-10-13 21:09:26,228 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1124 transitions. Word has length 126 [2019-10-13 21:09:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:26,228 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1124 transitions. [2019-10-13 21:09:26,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:09:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1124 transitions. [2019-10-13 21:09:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:09:26,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:26,231 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:26,232 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1999173578, now seen corresponding path program 1 times [2019-10-13 21:09:26,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:26,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789391249] [2019-10-13 21:09:26,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:26,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789391249] [2019-10-13 21:09:26,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:26,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:26,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342765944] [2019-10-13 21:09:26,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:26,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:26,357 INFO L87 Difference]: Start difference. First operand 737 states and 1124 transitions. Second operand 4 states. [2019-10-13 21:09:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:26,424 INFO L93 Difference]: Finished difference Result 1413 states and 2176 transitions. [2019-10-13 21:09:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:26,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-13 21:09:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:26,430 INFO L225 Difference]: With dead ends: 1413 [2019-10-13 21:09:26,430 INFO L226 Difference]: Without dead ends: 733 [2019-10-13 21:09:26,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-13 21:09:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-10-13 21:09:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-13 21:09:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1117 transitions. [2019-10-13 21:09:26,461 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1117 transitions. Word has length 126 [2019-10-13 21:09:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:26,461 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1117 transitions. [2019-10-13 21:09:26,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1117 transitions. [2019-10-13 21:09:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:09:26,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:26,464 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:26,465 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1624055113, now seen corresponding path program 1 times [2019-10-13 21:09:26,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:26,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447088430] [2019-10-13 21:09:26,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:26,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447088430] [2019-10-13 21:09:26,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:26,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:26,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690478463] [2019-10-13 21:09:26,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:26,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:26,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:26,604 INFO L87 Difference]: Start difference. First operand 733 states and 1117 transitions. Second operand 6 states. [2019-10-13 21:09:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:26,985 INFO L93 Difference]: Finished difference Result 1426 states and 2200 transitions. [2019-10-13 21:09:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:26,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-10-13 21:09:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:26,994 INFO L225 Difference]: With dead ends: 1426 [2019-10-13 21:09:26,995 INFO L226 Difference]: Without dead ends: 741 [2019-10-13 21:09:27,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-13 21:09:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 738. [2019-10-13 21:09:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-13 21:09:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2019-10-13 21:09:27,038 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 127 [2019-10-13 21:09:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:27,039 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2019-10-13 21:09:27,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2019-10-13 21:09:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:09:27,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:27,044 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:27,044 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1494752762, now seen corresponding path program 1 times [2019-10-13 21:09:27,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:27,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888420136] [2019-10-13 21:09:27,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:27,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888420136] [2019-10-13 21:09:27,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:27,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:27,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710702167] [2019-10-13 21:09:27,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:27,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:27,264 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 6 states. [2019-10-13 21:09:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:27,538 INFO L93 Difference]: Finished difference Result 1389 states and 2115 transitions. [2019-10-13 21:09:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:27,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-13 21:09:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:27,545 INFO L225 Difference]: With dead ends: 1389 [2019-10-13 21:09:27,545 INFO L226 Difference]: Without dead ends: 738 [2019-10-13 21:09:27,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-13 21:09:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-10-13 21:09:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-13 21:09:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2019-10-13 21:09:27,586 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 128 [2019-10-13 21:09:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:27,587 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2019-10-13 21:09:27,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2019-10-13 21:09:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:09:27,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:27,590 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:27,590 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash 638673006, now seen corresponding path program 1 times [2019-10-13 21:09:27,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:27,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287134394] [2019-10-13 21:09:27,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:27,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287134394] [2019-10-13 21:09:27,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:27,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:27,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993940397] [2019-10-13 21:09:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:27,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:27,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:27,759 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand 6 states. [2019-10-13 21:09:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:28,000 INFO L93 Difference]: Finished difference Result 1389 states and 2111 transitions. [2019-10-13 21:09:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:28,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-13 21:09:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:28,009 INFO L225 Difference]: With dead ends: 1389 [2019-10-13 21:09:28,009 INFO L226 Difference]: Without dead ends: 738 [2019-10-13 21:09:28,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-13 21:09:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-10-13 21:09:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-13 21:09:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1110 transitions. [2019-10-13 21:09:28,044 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1110 transitions. Word has length 129 [2019-10-13 21:09:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:28,045 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1110 transitions. [2019-10-13 21:09:28,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1110 transitions. [2019-10-13 21:09:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:09:28,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:28,047 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:28,048 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 805428462, now seen corresponding path program 1 times [2019-10-13 21:09:28,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:28,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900072730] [2019-10-13 21:09:28,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:28,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900072730] [2019-10-13 21:09:28,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:28,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:28,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244190104] [2019-10-13 21:09:28,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:28,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:28,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:28,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:28,195 INFO L87 Difference]: Start difference. First operand 738 states and 1110 transitions. Second operand 7 states. [2019-10-13 21:09:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:28,299 INFO L93 Difference]: Finished difference Result 1392 states and 2111 transitions. [2019-10-13 21:09:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:28,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-13 21:09:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:28,306 INFO L225 Difference]: With dead ends: 1392 [2019-10-13 21:09:28,306 INFO L226 Difference]: Without dead ends: 720 [2019-10-13 21:09:28,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-10-13 21:09:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 717. [2019-10-13 21:09:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 21:09:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1073 transitions. [2019-10-13 21:09:28,336 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1073 transitions. Word has length 129 [2019-10-13 21:09:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:28,336 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1073 transitions. [2019-10-13 21:09:28,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1073 transitions. [2019-10-13 21:09:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:09:28,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:28,339 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:28,339 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1272669825, now seen corresponding path program 1 times [2019-10-13 21:09:28,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:28,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917210435] [2019-10-13 21:09:28,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:28,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917210435] [2019-10-13 21:09:28,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:28,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:28,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988948933] [2019-10-13 21:09:28,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:28,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:28,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:28,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:28,502 INFO L87 Difference]: Start difference. First operand 717 states and 1073 transitions. Second operand 6 states. [2019-10-13 21:09:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:28,653 INFO L93 Difference]: Finished difference Result 1368 states and 2070 transitions. [2019-10-13 21:09:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:28,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-13 21:09:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:28,660 INFO L225 Difference]: With dead ends: 1368 [2019-10-13 21:09:28,660 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 21:09:28,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 21:09:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-13 21:09:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 21:09:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-10-13 21:09:28,688 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 130 [2019-10-13 21:09:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:28,688 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-10-13 21:09:28,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-10-13 21:09:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:09:28,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:28,691 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:28,691 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1537429613, now seen corresponding path program 1 times [2019-10-13 21:09:28,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:28,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226753098] [2019-10-13 21:09:28,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:28,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226753098] [2019-10-13 21:09:28,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:28,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:28,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787277834] [2019-10-13 21:09:28,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:28,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:28,838 INFO L87 Difference]: Start difference. First operand 717 states and 1072 transitions. Second operand 6 states. [2019-10-13 21:09:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:28,999 INFO L93 Difference]: Finished difference Result 1368 states and 2069 transitions. [2019-10-13 21:09:28,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:28,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-13 21:09:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,007 INFO L225 Difference]: With dead ends: 1368 [2019-10-13 21:09:29,007 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 21:09:29,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 21:09:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-13 21:09:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 21:09:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1071 transitions. [2019-10-13 21:09:29,037 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1071 transitions. Word has length 131 [2019-10-13 21:09:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,037 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1071 transitions. [2019-10-13 21:09:29,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1071 transitions. [2019-10-13 21:09:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:09:29,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,040 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:29,040 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1036805370, now seen corresponding path program 1 times [2019-10-13 21:09:29,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:29,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024890664] [2019-10-13 21:09:29,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:29,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024890664] [2019-10-13 21:09:29,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:29,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:29,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674015364] [2019-10-13 21:09:29,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:29,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:29,172 INFO L87 Difference]: Start difference. First operand 717 states and 1071 transitions. Second operand 4 states. [2019-10-13 21:09:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,247 INFO L93 Difference]: Finished difference Result 1368 states and 2068 transitions. [2019-10-13 21:09:29,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:29,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-13 21:09:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,254 INFO L225 Difference]: With dead ends: 1368 [2019-10-13 21:09:29,254 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 21:09:29,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 21:09:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-13 21:09:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 21:09:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1070 transitions. [2019-10-13 21:09:29,295 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1070 transitions. Word has length 132 [2019-10-13 21:09:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,296 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1070 transitions. [2019-10-13 21:09:29,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1070 transitions. [2019-10-13 21:09:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:09:29,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,299 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:29,299 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1997244676, now seen corresponding path program 1 times [2019-10-13 21:09:29,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:29,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590943625] [2019-10-13 21:09:29,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:29,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590943625] [2019-10-13 21:09:29,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:29,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 21:09:29,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159443423] [2019-10-13 21:09:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:09:29,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:09:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:29,507 INFO L87 Difference]: Start difference. First operand 717 states and 1070 transitions. Second operand 13 states. [2019-10-13 21:09:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,818 INFO L93 Difference]: Finished difference Result 1374 states and 2078 transitions. [2019-10-13 21:09:29,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:09:29,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-10-13 21:09:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,825 INFO L225 Difference]: With dead ends: 1374 [2019-10-13 21:09:29,826 INFO L226 Difference]: Without dead ends: 724 [2019-10-13 21:09:29,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:09:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-13 21:09:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 722. [2019-10-13 21:09:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-13 21:09:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1076 transitions. [2019-10-13 21:09:29,853 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1076 transitions. Word has length 132 [2019-10-13 21:09:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1076 transitions. [2019-10-13 21:09:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:09:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1076 transitions. [2019-10-13 21:09:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:09:29,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,857 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:29,858 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2064235796, now seen corresponding path program 1 times [2019-10-13 21:09:29,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:29,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632545538] [2019-10-13 21:09:29,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:29,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632545538] [2019-10-13 21:09:29,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:29,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:09:29,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183874676] [2019-10-13 21:09:29,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:29,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:09:29,975 INFO L87 Difference]: Start difference. First operand 722 states and 1076 transitions. Second operand 3 states. [2019-10-13 21:09:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:30,073 INFO L93 Difference]: Finished difference Result 2040 states and 3094 transitions. [2019-10-13 21:09:30,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:30,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-13 21:09:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:30,084 INFO L225 Difference]: With dead ends: 2040 [2019-10-13 21:09:30,084 INFO L226 Difference]: Without dead ends: 1391 [2019-10-13 21:09:30,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:09:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-10-13 21:09:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2019-10-13 21:09:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-10-13 21:09:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2089 transitions. [2019-10-13 21:09:30,142 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2089 transitions. Word has length 133 [2019-10-13 21:09:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:30,142 INFO L462 AbstractCegarLoop]: Abstraction has 1388 states and 2089 transitions. [2019-10-13 21:09:30,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2089 transitions. [2019-10-13 21:09:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:09:30,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:30,147 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:30,147 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 565322765, now seen corresponding path program 1 times [2019-10-13 21:09:30,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:30,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235323575] [2019-10-13 21:09:30,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:09:30,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235323575] [2019-10-13 21:09:30,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:30,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:09:30,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565358680] [2019-10-13 21:09:30,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:30,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:30,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:30,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:30,347 INFO L87 Difference]: Start difference. First operand 1388 states and 2089 transitions. Second operand 5 states. [2019-10-13 21:09:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:34,248 INFO L93 Difference]: Finished difference Result 4171 states and 6512 transitions. [2019-10-13 21:09:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:34,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-13 21:09:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:34,275 INFO L225 Difference]: With dead ends: 4171 [2019-10-13 21:09:34,275 INFO L226 Difference]: Without dead ends: 2900 [2019-10-13 21:09:34,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-10-13 21:09:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2797. [2019-10-13 21:09:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-10-13 21:09:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4393 transitions. [2019-10-13 21:09:34,492 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4393 transitions. Word has length 134 [2019-10-13 21:09:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:34,492 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4393 transitions. [2019-10-13 21:09:34,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4393 transitions. [2019-10-13 21:09:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:09:34,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:34,504 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:34,504 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1763835588, now seen corresponding path program 1 times [2019-10-13 21:09:34,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:34,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499717035] [2019-10-13 21:09:34,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:34,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:34,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 21:09:34,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499717035] [2019-10-13 21:09:34,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:34,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:34,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979783007] [2019-10-13 21:09:34,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:34,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:34,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:34,691 INFO L87 Difference]: Start difference. First operand 2797 states and 4393 transitions. Second operand 9 states. [2019-10-13 21:09:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:36,328 INFO L93 Difference]: Finished difference Result 5465 states and 8713 transitions. [2019-10-13 21:09:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:36,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-13 21:09:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:36,361 INFO L225 Difference]: With dead ends: 5465 [2019-10-13 21:09:36,362 INFO L226 Difference]: Without dead ends: 2784 [2019-10-13 21:09:36,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-10-13 21:09:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2019-10-13 21:09:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-10-13 21:09:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4363 transitions. [2019-10-13 21:09:36,534 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4363 transitions. Word has length 179 [2019-10-13 21:09:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:36,535 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 4363 transitions. [2019-10-13 21:09:36,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4363 transitions. [2019-10-13 21:09:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-13 21:09:36,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:36,549 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:36,549 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash -485595940, now seen corresponding path program 1 times [2019-10-13 21:09:36,550 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:36,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828333510] [2019-10-13 21:09:36,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:36,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:36,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-13 21:09:36,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828333510] [2019-10-13 21:09:36,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158682147] [2019-10-13 21:09:36,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:37,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:37,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-13 21:09:37,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-13 21:09:38,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:38,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:38,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101889352] [2019-10-13 21:09:38,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:38,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:38,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:38,206 INFO L87 Difference]: Start difference. First operand 2784 states and 4363 transitions. Second operand 5 states. [2019-10-13 21:09:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:39,406 INFO L93 Difference]: Finished difference Result 5481 states and 8835 transitions. [2019-10-13 21:09:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:39,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-13 21:09:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:39,441 INFO L225 Difference]: With dead ends: 5481 [2019-10-13 21:09:39,442 INFO L226 Difference]: Without dead ends: 2816 [2019-10-13 21:09:39,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 374 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2019-10-13 21:09:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2816. [2019-10-13 21:09:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2816 states. [2019-10-13 21:09:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 4415 transitions. [2019-10-13 21:09:39,590 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 4415 transitions. Word has length 193 [2019-10-13 21:09:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:39,591 INFO L462 AbstractCegarLoop]: Abstraction has 2816 states and 4415 transitions. [2019-10-13 21:09:39,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 4415 transitions. [2019-10-13 21:09:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-13 21:09:39,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:39,602 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:39,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:39,811 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1227005091, now seen corresponding path program 1 times [2019-10-13 21:09:39,811 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:39,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827925853] [2019-10-13 21:09:39,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:09:39,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827925853] [2019-10-13 21:09:39,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716846513] [2019-10-13 21:09:39,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:40,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 3113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:40,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:09:40,810 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:09:41,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:41,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:41,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303437766] [2019-10-13 21:09:41,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:41,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:41,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:41,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:41,518 INFO L87 Difference]: Start difference. First operand 2816 states and 4415 transitions. Second operand 5 states. [2019-10-13 21:09:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:42,764 INFO L93 Difference]: Finished difference Result 5545 states and 8927 transitions. [2019-10-13 21:09:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:42,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-10-13 21:09:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:42,797 INFO L225 Difference]: With dead ends: 5545 [2019-10-13 21:09:42,798 INFO L226 Difference]: Without dead ends: 2848 [2019-10-13 21:09:42,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 380 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-10-13 21:09:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2019-10-13 21:09:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2848 states. [2019-10-13 21:09:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4467 transitions. [2019-10-13 21:09:42,935 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4467 transitions. Word has length 196 [2019-10-13 21:09:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:42,936 INFO L462 AbstractCegarLoop]: Abstraction has 2848 states and 4467 transitions. [2019-10-13 21:09:42,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4467 transitions. [2019-10-13 21:09:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-13 21:09:42,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:42,947 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:43,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:43,157 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1959931264, now seen corresponding path program 1 times [2019-10-13 21:09:43,158 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:43,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490049518] [2019-10-13 21:09:43,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:43,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:43,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:09:43,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490049518] [2019-10-13 21:09:43,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774771449] [2019-10-13 21:09:43,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:43,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 3116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:43,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:09:44,079 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:09:44,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:44,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:44,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584527514] [2019-10-13 21:09:44,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:44,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:44,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:44,647 INFO L87 Difference]: Start difference. First operand 2848 states and 4467 transitions. Second operand 5 states. [2019-10-13 21:09:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:45,739 INFO L93 Difference]: Finished difference Result 5609 states and 9019 transitions. [2019-10-13 21:09:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:45,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-10-13 21:09:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:45,759 INFO L225 Difference]: With dead ends: 5609 [2019-10-13 21:09:45,759 INFO L226 Difference]: Without dead ends: 2880 [2019-10-13 21:09:45,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 386 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2019-10-13 21:09:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2019-10-13 21:09:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2019-10-13 21:09:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4519 transitions. [2019-10-13 21:09:45,887 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4519 transitions. Word has length 199 [2019-10-13 21:09:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:45,888 INFO L462 AbstractCegarLoop]: Abstraction has 2880 states and 4519 transitions. [2019-10-13 21:09:45,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4519 transitions. [2019-10-13 21:09:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-13 21:09:45,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:45,900 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:46,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:46,108 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1815863567, now seen corresponding path program 1 times [2019-10-13 21:09:46,109 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:46,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462620753] [2019-10-13 21:09:46,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:46,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:46,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-13 21:09:46,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462620753] [2019-10-13 21:09:46,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135040290] [2019-10-13 21:09:46,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:46,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 3119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:46,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-13 21:09:46,968 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-13 21:09:47,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:47,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2019-10-13 21:09:47,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192280499] [2019-10-13 21:09:47,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:47,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:47,501 INFO L87 Difference]: Start difference. First operand 2880 states and 4519 transitions. Second operand 5 states. [2019-10-13 21:09:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:48,663 INFO L93 Difference]: Finished difference Result 5673 states and 9111 transitions. [2019-10-13 21:09:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:48,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-10-13 21:09:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:48,683 INFO L225 Difference]: With dead ends: 5673 [2019-10-13 21:09:48,683 INFO L226 Difference]: Without dead ends: 2912 [2019-10-13 21:09:48,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 392 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2019-10-13 21:09:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2912. [2019-10-13 21:09:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2912 states. [2019-10-13 21:09:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4571 transitions. [2019-10-13 21:09:48,798 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4571 transitions. Word has length 202 [2019-10-13 21:09:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:48,799 INFO L462 AbstractCegarLoop]: Abstraction has 2912 states and 4571 transitions. [2019-10-13 21:09:48,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4571 transitions. [2019-10-13 21:09:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-13 21:09:48,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:48,808 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:49,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:49,017 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1931127844, now seen corresponding path program 1 times [2019-10-13 21:09:49,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:49,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906280346] [2019-10-13 21:09:49,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:49,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:49,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat