java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:34,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:34,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:34,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:34,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:34,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:34,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:34,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:34,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:34,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:34,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:34,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:34,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:34,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:34,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:34,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:34,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:34,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:34,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:34,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:34,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:34,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:34,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:34,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:34,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:34,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:34,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:34,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:34,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:34,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:34,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:34,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:34,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:34,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:34,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:34,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:34,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:34,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:34,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:34,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:34,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:34,238 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:10:34,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:34,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:34,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:34,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:34,266 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:34,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:34,267 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:34,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:34,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:34,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:34,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:34,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:34,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:34,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:34,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:34,268 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:34,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:34,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:34,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:34,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:34,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:34,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:34,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:34,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:34,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:34,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:34,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:34,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:34,271 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:10:34,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:34,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:34,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:34,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:34,574 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:34,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-10-13 21:10:34,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b540998/1ce2d7544b12412394c37cd94593fc86/FLAGef2abfa44 [2019-10-13 21:10:35,264 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:35,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-10-13 21:10:35,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b540998/1ce2d7544b12412394c37cd94593fc86/FLAGef2abfa44 [2019-10-13 21:10:35,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b540998/1ce2d7544b12412394c37cd94593fc86 [2019-10-13 21:10:35,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:35,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:35,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:35,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:35,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:35,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4e00a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35, skipping insertion in model container [2019-10-13 21:10:35,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,536 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:35,621 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:36,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:36,472 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:36,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:36,686 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:36,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36 WrapperNode [2019-10-13 21:10:36,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:36,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:36,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:36,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:36,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (1/1) ... [2019-10-13 21:10:36,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:36,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:36,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:36,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:36,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (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:10:36,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:36,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:36,975 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:36,991 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:36,991 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:36,991 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:37,010 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:39,280 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:39,280 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:39,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:39 BoogieIcfgContainer [2019-10-13 21:10:39,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:39,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:39,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:39,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:39,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:35" (1/3) ... [2019-10-13 21:10:39,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50af9997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:39, skipping insertion in model container [2019-10-13 21:10:39,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:36" (2/3) ... [2019-10-13 21:10:39,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50af9997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:39, skipping insertion in model container [2019-10-13 21:10:39,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:39" (3/3) ... [2019-10-13 21:10:39,295 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2019-10-13 21:10:39,307 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:39,319 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:39,332 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:39,376 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:39,376 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:39,376 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:39,377 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:39,377 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:39,377 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:39,377 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:39,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states. [2019-10-13 21:10:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 21:10:39,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,446 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,449 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1453471950, now seen corresponding path program 1 times [2019-10-13 21:10:39,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117957841] [2019-10-13 21:10:39,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:40,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117957841] [2019-10-13 21:10:40,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:40,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54786386] [2019-10-13 21:10:40,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:40,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:40,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:40,129 INFO L87 Difference]: Start difference. First operand 773 states. Second operand 4 states. [2019-10-13 21:10:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,352 INFO L93 Difference]: Finished difference Result 1209 states and 1957 transitions. [2019-10-13 21:10:40,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:40,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-13 21:10:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,390 INFO L225 Difference]: With dead ends: 1209 [2019-10-13 21:10:40,391 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:40,403 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:10:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 980 transitions. [2019-10-13 21:10:40,523 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 980 transitions. Word has length 124 [2019-10-13 21:10:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,524 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 980 transitions. [2019-10-13 21:10:40,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 980 transitions. [2019-10-13 21:10:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:10:40,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,531 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash -491101009, now seen corresponding path program 1 times [2019-10-13 21:10:40,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645301978] [2019-10-13 21:10:40,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:40,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645301978] [2019-10-13 21:10:40,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:40,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992963292] [2019-10-13 21:10:40,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:40,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:40,729 INFO L87 Difference]: Start difference. First operand 613 states and 980 transitions. Second operand 4 states. [2019-10-13 21:10:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,846 INFO L93 Difference]: Finished difference Result 1189 states and 1918 transitions. [2019-10-13 21:10:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:40,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-13 21:10:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,854 INFO L225 Difference]: With dead ends: 1189 [2019-10-13 21:10:40,854 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:40,864 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:10:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 979 transitions. [2019-10-13 21:10:40,920 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 979 transitions. Word has length 127 [2019-10-13 21:10:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,921 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 979 transitions. [2019-10-13 21:10:40,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 979 transitions. [2019-10-13 21:10:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:40,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,929 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,930 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2141971607, now seen corresponding path program 1 times [2019-10-13 21:10:40,933 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090522272] [2019-10-13 21:10:40,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:41,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090522272] [2019-10-13 21:10:41,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:41,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840485166] [2019-10-13 21:10:41,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:41,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:41,100 INFO L87 Difference]: Start difference. First operand 613 states and 979 transitions. Second operand 4 states. [2019-10-13 21:10:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,184 INFO L93 Difference]: Finished difference Result 1189 states and 1917 transitions. [2019-10-13 21:10:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:41,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-13 21:10:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,191 INFO L225 Difference]: With dead ends: 1189 [2019-10-13 21:10:41,191 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:41,194 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:10:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 978 transitions. [2019-10-13 21:10:41,241 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 978 transitions. Word has length 128 [2019-10-13 21:10:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,243 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 978 transitions. [2019-10-13 21:10:41,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 978 transitions. [2019-10-13 21:10:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:10:41,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,248 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,248 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 923417843, now seen corresponding path program 1 times [2019-10-13 21:10:41,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915683830] [2019-10-13 21:10:41,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:41,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915683830] [2019-10-13 21:10:41,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:41,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488828024] [2019-10-13 21:10:41,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:41,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:41,453 INFO L87 Difference]: Start difference. First operand 613 states and 978 transitions. Second operand 4 states. [2019-10-13 21:10:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,518 INFO L93 Difference]: Finished difference Result 1189 states and 1916 transitions. [2019-10-13 21:10:41,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:41,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-13 21:10:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,523 INFO L225 Difference]: With dead ends: 1189 [2019-10-13 21:10:41,523 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:41,526 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:10:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 977 transitions. [2019-10-13 21:10:41,549 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 977 transitions. Word has length 129 [2019-10-13 21:10:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,549 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 977 transitions. [2019-10-13 21:10:41,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 977 transitions. [2019-10-13 21:10:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:10:41,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,553 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,554 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -130986579, now seen corresponding path program 1 times [2019-10-13 21:10:41,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204518060] [2019-10-13 21:10:41,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:41,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204518060] [2019-10-13 21:10:41,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:41,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777206351] [2019-10-13 21:10:41,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:41,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:41,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:41,720 INFO L87 Difference]: Start difference. First operand 613 states and 977 transitions. Second operand 4 states. [2019-10-13 21:10:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,779 INFO L93 Difference]: Finished difference Result 1189 states and 1915 transitions. [2019-10-13 21:10:41,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:41,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-10-13 21:10:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,784 INFO L225 Difference]: With dead ends: 1189 [2019-10-13 21:10:41,784 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:41,787 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:10:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 976 transitions. [2019-10-13 21:10:41,809 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 976 transitions. Word has length 130 [2019-10-13 21:10:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,810 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 976 transitions. [2019-10-13 21:10:41,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 976 transitions. [2019-10-13 21:10:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:10:41,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,814 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash -49982153, now seen corresponding path program 1 times [2019-10-13 21:10:41,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130202246] [2019-10-13 21:10:41,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:41,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130202246] [2019-10-13 21:10:41,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:41,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986557164] [2019-10-13 21:10:41,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:41,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:41,985 INFO L87 Difference]: Start difference. First operand 613 states and 976 transitions. Second operand 10 states. [2019-10-13 21:10:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,130 INFO L93 Difference]: Finished difference Result 1147 states and 1835 transitions. [2019-10-13 21:10:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:42,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-10-13 21:10:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,135 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:42,136 INFO L226 Difference]: Without dead ends: 622 [2019-10-13 21:10:42,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:10:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-13 21:10:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-13 21:10:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:10:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-10-13 21:10:42,166 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-10-13 21:10:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,168 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-10-13 21:10:42,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-10-13 21:10:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:10:42,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,177 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,177 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 625710456, now seen corresponding path program 1 times [2019-10-13 21:10:42,178 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639693756] [2019-10-13 21:10:42,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:42,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639693756] [2019-10-13 21:10:42,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:42,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085848210] [2019-10-13 21:10:42,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:42,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:42,347 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-10-13 21:10:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,412 INFO L93 Difference]: Finished difference Result 1195 states and 1921 transitions. [2019-10-13 21:10:42,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:42,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-10-13 21:10:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,420 INFO L225 Difference]: With dead ends: 1195 [2019-10-13 21:10:42,420 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:10:42,425 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:10:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:10:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:10:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:10:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 962 transitions. [2019-10-13 21:10:42,450 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 962 transitions. Word has length 131 [2019-10-13 21:10:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,453 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 962 transitions. [2019-10-13 21:10:42,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 962 transitions. [2019-10-13 21:10:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:10:42,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,458 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,458 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1002453247, now seen corresponding path program 1 times [2019-10-13 21:10:42,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73372753] [2019-10-13 21:10:42,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:42,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73372753] [2019-10-13 21:10:42,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:42,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704605186] [2019-10-13 21:10:42,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:42,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:42,611 INFO L87 Difference]: Start difference. First operand 607 states and 962 transitions. Second operand 6 states. [2019-10-13 21:10:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,876 INFO L93 Difference]: Finished difference Result 1135 states and 1813 transitions. [2019-10-13 21:10:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:42,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-13 21:10:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,883 INFO L225 Difference]: With dead ends: 1135 [2019-10-13 21:10:42,883 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:10:42,888 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:10:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:10:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:10:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:10:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 958 transitions. [2019-10-13 21:10:42,918 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 958 transitions. Word has length 132 [2019-10-13 21:10:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,919 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 958 transitions. [2019-10-13 21:10:42,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 958 transitions. [2019-10-13 21:10:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:42,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,926 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,926 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1646126772, now seen corresponding path program 1 times [2019-10-13 21:10:42,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372254895] [2019-10-13 21:10:42,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:43,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372254895] [2019-10-13 21:10:43,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:43,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:43,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139653765] [2019-10-13 21:10:43,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:43,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:43,154 INFO L87 Difference]: Start difference. First operand 607 states and 958 transitions. Second operand 6 states. [2019-10-13 21:10:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,363 INFO L93 Difference]: Finished difference Result 1135 states and 1809 transitions. [2019-10-13 21:10:43,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:43,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-13 21:10:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,370 INFO L225 Difference]: With dead ends: 1135 [2019-10-13 21:10:43,370 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:10:43,373 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:10:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:10:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:10:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:10:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 954 transitions. [2019-10-13 21:10:43,395 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 954 transitions. Word has length 133 [2019-10-13 21:10:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,396 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 954 transitions. [2019-10-13 21:10:43,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 954 transitions. [2019-10-13 21:10:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:10:43,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,401 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,402 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1808478140, now seen corresponding path program 1 times [2019-10-13 21:10:43,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453469518] [2019-10-13 21:10:43,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:43,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453469518] [2019-10-13 21:10:43,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:43,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:43,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227510264] [2019-10-13 21:10:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:43,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:43,561 INFO L87 Difference]: Start difference. First operand 607 states and 954 transitions. Second operand 6 states. [2019-10-13 21:10:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,763 INFO L93 Difference]: Finished difference Result 1135 states and 1805 transitions. [2019-10-13 21:10:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:43,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-13 21:10:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,768 INFO L225 Difference]: With dead ends: 1135 [2019-10-13 21:10:43,768 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:10:43,777 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:10:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:10:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:10:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:10:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 950 transitions. [2019-10-13 21:10:43,806 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 950 transitions. Word has length 134 [2019-10-13 21:10:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,806 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 950 transitions. [2019-10-13 21:10:43,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 950 transitions. [2019-10-13 21:10:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:10:43,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,813 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,813 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1695866052, now seen corresponding path program 1 times [2019-10-13 21:10:43,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893725526] [2019-10-13 21:10:43,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:44,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893725526] [2019-10-13 21:10:44,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:44,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:44,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904614537] [2019-10-13 21:10:44,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:44,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:44,069 INFO L87 Difference]: Start difference. First operand 607 states and 950 transitions. Second operand 7 states. [2019-10-13 21:10:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:44,156 INFO L93 Difference]: Finished difference Result 1135 states and 1801 transitions. [2019-10-13 21:10:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:44,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-13 21:10:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:44,161 INFO L225 Difference]: With dead ends: 1135 [2019-10-13 21:10:44,161 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:44,164 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:10:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-13 21:10:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 21:10:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 916 transitions. [2019-10-13 21:10:44,185 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 916 transitions. Word has length 134 [2019-10-13 21:10:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:44,186 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 916 transitions. [2019-10-13 21:10:44,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 916 transitions. [2019-10-13 21:10:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:10:44,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:44,191 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:44,191 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2087814641, now seen corresponding path program 1 times [2019-10-13 21:10:44,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:44,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328788189] [2019-10-13 21:10:44,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:44,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328788189] [2019-10-13 21:10:44,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:44,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:44,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258196184] [2019-10-13 21:10:44,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:44,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:44,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:44,329 INFO L87 Difference]: Start difference. First operand 586 states and 916 transitions. Second operand 6 states. [2019-10-13 21:10:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:44,427 INFO L93 Difference]: Finished difference Result 1114 states and 1767 transitions. [2019-10-13 21:10:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:44,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-13 21:10:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:44,432 INFO L225 Difference]: With dead ends: 1114 [2019-10-13 21:10:44,432 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:44,437 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:10:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-13 21:10:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 21:10:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 915 transitions. [2019-10-13 21:10:44,462 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 915 transitions. Word has length 135 [2019-10-13 21:10:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 915 transitions. [2019-10-13 21:10:44,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 915 transitions. [2019-10-13 21:10:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:10:44,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:44,469 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:44,470 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1341910135, now seen corresponding path program 1 times [2019-10-13 21:10:44,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:44,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489430630] [2019-10-13 21:10:44,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:44,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489430630] [2019-10-13 21:10:44,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:44,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:44,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694706959] [2019-10-13 21:10:44,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:44,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:44,599 INFO L87 Difference]: Start difference. First operand 586 states and 915 transitions. Second operand 6 states. [2019-10-13 21:10:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:44,688 INFO L93 Difference]: Finished difference Result 1114 states and 1766 transitions. [2019-10-13 21:10:44,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:44,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-13 21:10:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:44,693 INFO L225 Difference]: With dead ends: 1114 [2019-10-13 21:10:44,693 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:44,696 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:10:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-13 21:10:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 21:10:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 914 transitions. [2019-10-13 21:10:44,717 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 914 transitions. Word has length 136 [2019-10-13 21:10:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:44,717 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 914 transitions. [2019-10-13 21:10:44,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 914 transitions. [2019-10-13 21:10:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:10:44,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:44,722 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:44,722 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash -50054806, now seen corresponding path program 1 times [2019-10-13 21:10:44,722 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:44,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146650023] [2019-10-13 21:10:44,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:44,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146650023] [2019-10-13 21:10:44,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:44,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:44,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674523122] [2019-10-13 21:10:44,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:44,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:44,951 INFO L87 Difference]: Start difference. First operand 586 states and 914 transitions. Second operand 12 states. [2019-10-13 21:10:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:45,127 INFO L93 Difference]: Finished difference Result 1115 states and 1765 transitions. [2019-10-13 21:10:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:45,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-10-13 21:10:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:45,134 INFO L225 Difference]: With dead ends: 1115 [2019-10-13 21:10:45,134 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:45,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-13 21:10:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 21:10:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 913 transitions. [2019-10-13 21:10:45,166 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 913 transitions. Word has length 137 [2019-10-13 21:10:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:45,167 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 913 transitions. [2019-10-13 21:10:45,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 913 transitions. [2019-10-13 21:10:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:10:45,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:45,171 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:45,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash -749925748, now seen corresponding path program 1 times [2019-10-13 21:10:45,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:45,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875810022] [2019-10-13 21:10:45,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:45,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:45,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:45,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875810022] [2019-10-13 21:10:45,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:45,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:45,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448725321] [2019-10-13 21:10:45,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:45,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:45,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:45,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:45,332 INFO L87 Difference]: Start difference. First operand 586 states and 913 transitions. Second operand 6 states. [2019-10-13 21:10:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:49,044 INFO L93 Difference]: Finished difference Result 1727 states and 2803 transitions. [2019-10-13 21:10:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:10:49,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-13 21:10:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:49,054 INFO L225 Difference]: With dead ends: 1727 [2019-10-13 21:10:49,054 INFO L226 Difference]: Without dead ends: 1207 [2019-10-13 21:10:49,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-10-13 21:10:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1124. [2019-10-13 21:10:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-13 21:10:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1787 transitions. [2019-10-13 21:10:49,131 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1787 transitions. Word has length 138 [2019-10-13 21:10:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:49,131 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1787 transitions. [2019-10-13 21:10:49,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1787 transitions. [2019-10-13 21:10:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:10:49,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:49,136 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:49,136 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash -84982961, now seen corresponding path program 1 times [2019-10-13 21:10:49,137 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:49,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286541541] [2019-10-13 21:10:49,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:49,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:49,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:49,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286541541] [2019-10-13 21:10:49,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:49,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:49,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346814799] [2019-10-13 21:10:49,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:49,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:49,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:49,285 INFO L87 Difference]: Start difference. First operand 1124 states and 1787 transitions. Second operand 6 states. [2019-10-13 21:10:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:53,125 INFO L93 Difference]: Finished difference Result 3556 states and 5857 transitions. [2019-10-13 21:10:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:10:53,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-13 21:10:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:53,147 INFO L225 Difference]: With dead ends: 3556 [2019-10-13 21:10:53,147 INFO L226 Difference]: Without dead ends: 2499 [2019-10-13 21:10:53,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-10-13 21:10:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2306. [2019-10-13 21:10:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-10-13 21:10:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3726 transitions. [2019-10-13 21:10:53,298 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3726 transitions. Word has length 139 [2019-10-13 21:10:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:53,298 INFO L462 AbstractCegarLoop]: Abstraction has 2306 states and 3726 transitions. [2019-10-13 21:10:53,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3726 transitions. [2019-10-13 21:10:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:53,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:53,303 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:53,303 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash -708797968, now seen corresponding path program 1 times [2019-10-13 21:10:53,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:53,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098793215] [2019-10-13 21:10:53,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:53,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:53,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:53,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098793215] [2019-10-13 21:10:53,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:53,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:53,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106313925] [2019-10-13 21:10:53,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:53,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:53,457 INFO L87 Difference]: Start difference. First operand 2306 states and 3726 transitions. Second operand 6 states. [2019-10-13 21:10:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:57,323 INFO L93 Difference]: Finished difference Result 7701 states and 12901 transitions. [2019-10-13 21:10:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:10:57,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-13 21:10:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:57,362 INFO L225 Difference]: With dead ends: 7701 [2019-10-13 21:10:57,362 INFO L226 Difference]: Without dead ends: 5464 [2019-10-13 21:10:57,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-10-13 21:10:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 4964. [2019-10-13 21:10:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4964 states. [2019-10-13 21:10:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8151 transitions. [2019-10-13 21:10:57,670 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8151 transitions. Word has length 140 [2019-10-13 21:10:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:57,670 INFO L462 AbstractCegarLoop]: Abstraction has 4964 states and 8151 transitions. [2019-10-13 21:10:57,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8151 transitions. [2019-10-13 21:10:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:10:57,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:57,676 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:57,676 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1665568371, now seen corresponding path program 1 times [2019-10-13 21:10:57,677 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:57,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603906184] [2019-10-13 21:10:57,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:57,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:57,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:10:57,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603906184] [2019-10-13 21:10:57,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:57,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:57,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7329547] [2019-10-13 21:10:57,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:57,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:57,815 INFO L87 Difference]: Start difference. First operand 4964 states and 8151 transitions. Second operand 6 states. [2019-10-13 21:11:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,735 INFO L93 Difference]: Finished difference Result 17370 states and 29709 transitions. [2019-10-13 21:11:01,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:11:01,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:11:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,841 INFO L225 Difference]: With dead ends: 17370 [2019-10-13 21:11:01,841 INFO L226 Difference]: Without dead ends: 12479 [2019-10-13 21:11:01,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2019-10-13 21:11:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 11114. [2019-10-13 21:11:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2019-10-13 21:11:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 18594 transitions. [2019-10-13 21:11:02,631 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 18594 transitions. Word has length 141 [2019-10-13 21:11:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,631 INFO L462 AbstractCegarLoop]: Abstraction has 11114 states and 18594 transitions. [2019-10-13 21:11:02,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 18594 transitions. [2019-10-13 21:11:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:02,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,636 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,637 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691372, now seen corresponding path program 1 times [2019-10-13 21:11:02,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104963416] [2019-10-13 21:11:02,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:02,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104963416] [2019-10-13 21:11:02,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:02,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149196993] [2019-10-13 21:11:02,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:02,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:02,771 INFO L87 Difference]: Start difference. First operand 11114 states and 18594 transitions. Second operand 6 states.