java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:00,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:00,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:01,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:01,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:01,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:01,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:01,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:01,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:01,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:01,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:01,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:01,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:01,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:01,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:01,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:01,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:01,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:01,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:01,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:01,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:01,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:01,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:01,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:01,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:01,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:01,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:01,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:01,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:01,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:01,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:01,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:01,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:01,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:01,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:01,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:01,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:01,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:01,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:01,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:01,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:01,052 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:11:01,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:01,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:01,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:01,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:01,078 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:01,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:01,079 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:01,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:01,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:01,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:01,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:01,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:01,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:01,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:01,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:01,082 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:01,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:01,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:01,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:01,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:01,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:01,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:01,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:01,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:01,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:01,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:01,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:01,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:01,084 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:11:01,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:01,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:01,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:01,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:01,385 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:01,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-10-13 21:11:01,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afa56ed3/88ddceda03704a8496d24a2b516f07bd/FLAGca90ca4ac [2019-10-13 21:11:02,150 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:02,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-10-13 21:11:02,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afa56ed3/88ddceda03704a8496d24a2b516f07bd/FLAGca90ca4ac [2019-10-13 21:11:02,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afa56ed3/88ddceda03704a8496d24a2b516f07bd [2019-10-13 21:11:02,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:02,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:02,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:02,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:02,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:02,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:02" (1/1) ... [2019-10-13 21:11:02,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225cf470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:02, skipping insertion in model container [2019-10-13 21:11:02,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:02" (1/1) ... [2019-10-13 21:11:02,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:02,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:03,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:03,121 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:03,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:03,367 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:03,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03 WrapperNode [2019-10-13 21:11:03,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:03,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:03,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:03,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:03,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (1/1) ... [2019-10-13 21:11:03,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:03,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:03,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:03,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:03,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (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:11:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:03,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:03,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:03,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:03,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:03,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:03,637 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:03,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:03,637 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:03,637 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:03,638 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:03,638 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:03,638 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:03,638 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:03,639 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:03,639 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:03,639 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:03,639 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:03,639 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:03,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:03,642 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:03,642 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:03,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:11:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:11:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:11:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:11:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:11:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:11:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:11:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:11:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:03,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-13 21:11:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-13 21:11:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:03,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:11:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:11:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:03,658 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:03,659 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:11:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:11:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:11:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:11:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:11:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:03,666 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:03,666 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:11:03,666 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:03,666 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:05,928 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:05,928 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:05,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:05 BoogieIcfgContainer [2019-10-13 21:11:05,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:05,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:05,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:05,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:05,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:02" (1/3) ... [2019-10-13 21:11:05,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1114b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:05, skipping insertion in model container [2019-10-13 21:11:05,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:03" (2/3) ... [2019-10-13 21:11:05,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1114b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:05, skipping insertion in model container [2019-10-13 21:11:05,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:05" (3/3) ... [2019-10-13 21:11:05,941 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2019-10-13 21:11:05,951 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:05,962 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:05,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:06,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:06,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:06,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:06,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:06,021 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:06,021 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:06,021 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:06,021 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states. [2019-10-13 21:11:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:11:06,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:06,092 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:06,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash -157007896, now seen corresponding path program 1 times [2019-10-13 21:11:06,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:06,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731328183] [2019-10-13 21:11:06,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:06,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731328183] [2019-10-13 21:11:06,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:06,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:06,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262086532] [2019-10-13 21:11:06,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:06,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:06,791 INFO L87 Difference]: Start difference. First operand 805 states. Second operand 4 states. [2019-10-13 21:11:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:06,993 INFO L93 Difference]: Finished difference Result 1259 states and 2029 transitions. [2019-10-13 21:11:06,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:06,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-13 21:11:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:07,031 INFO L225 Difference]: With dead ends: 1259 [2019-10-13 21:11:07,031 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:07,044 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:11:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-13 21:11:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-13 21:11:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1016 transitions. [2019-10-13 21:11:07,187 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1016 transitions. Word has length 85 [2019-10-13 21:11:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:07,187 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1016 transitions. [2019-10-13 21:11:07,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1016 transitions. [2019-10-13 21:11:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:11:07,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:07,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:07,197 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:07,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2067866645, now seen corresponding path program 1 times [2019-10-13 21:11:07,199 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:07,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237258520] [2019-10-13 21:11:07,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:07,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237258520] [2019-10-13 21:11:07,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:07,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:07,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167643432] [2019-10-13 21:11:07,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:07,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:07,451 INFO L87 Difference]: Start difference. First operand 638 states and 1016 transitions. Second operand 4 states. [2019-10-13 21:11:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:07,548 INFO L93 Difference]: Finished difference Result 1239 states and 1990 transitions. [2019-10-13 21:11:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:07,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:11:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:07,556 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 21:11:07,559 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:07,572 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:11:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-13 21:11:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-13 21:11:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1015 transitions. [2019-10-13 21:11:07,617 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1015 transitions. Word has length 88 [2019-10-13 21:11:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:07,618 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1015 transitions. [2019-10-13 21:11:07,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1015 transitions. [2019-10-13 21:11:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:11:07,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:07,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:07,621 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1753669847, now seen corresponding path program 1 times [2019-10-13 21:11:07,621 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:07,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016019797] [2019-10-13 21:11:07,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:07,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016019797] [2019-10-13 21:11:07,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:07,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:07,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635205140] [2019-10-13 21:11:07,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:07,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:07,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:07,755 INFO L87 Difference]: Start difference. First operand 638 states and 1015 transitions. Second operand 4 states. [2019-10-13 21:11:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:07,859 INFO L93 Difference]: Finished difference Result 1239 states and 1989 transitions. [2019-10-13 21:11:07,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:07,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-13 21:11:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:07,868 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 21:11:07,868 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:07,871 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:11:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-13 21:11:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-13 21:11:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1014 transitions. [2019-10-13 21:11:07,919 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1014 transitions. Word has length 89 [2019-10-13 21:11:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:07,919 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1014 transitions. [2019-10-13 21:11:07,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1014 transitions. [2019-10-13 21:11:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:11:07,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:07,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:07,922 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 43566311, now seen corresponding path program 1 times [2019-10-13 21:11:07,923 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:07,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292426327] [2019-10-13 21:11:07,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:08,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292426327] [2019-10-13 21:11:08,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:08,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:08,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308852434] [2019-10-13 21:11:08,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:08,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:08,085 INFO L87 Difference]: Start difference. First operand 638 states and 1014 transitions. Second operand 4 states. [2019-10-13 21:11:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:08,162 INFO L93 Difference]: Finished difference Result 1239 states and 1988 transitions. [2019-10-13 21:11:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:08,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:11:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:08,183 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 21:11:08,183 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:08,188 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:11:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-13 21:11:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-13 21:11:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1013 transitions. [2019-10-13 21:11:08,224 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1013 transitions. Word has length 90 [2019-10-13 21:11:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:08,226 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1013 transitions. [2019-10-13 21:11:08,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1013 transitions. [2019-10-13 21:11:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:11:08,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:08,231 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:08,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1348686253, now seen corresponding path program 1 times [2019-10-13 21:11:08,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:08,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522312394] [2019-10-13 21:11:08,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:08,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522312394] [2019-10-13 21:11:08,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:08,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:08,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763883325] [2019-10-13 21:11:08,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:08,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:08,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:08,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:08,392 INFO L87 Difference]: Start difference. First operand 638 states and 1013 transitions. Second operand 4 states. [2019-10-13 21:11:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:08,465 INFO L93 Difference]: Finished difference Result 1239 states and 1987 transitions. [2019-10-13 21:11:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:08,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:11:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:08,473 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 21:11:08,473 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:08,476 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:11:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-13 21:11:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-13 21:11:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1012 transitions. [2019-10-13 21:11:08,501 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1012 transitions. Word has length 91 [2019-10-13 21:11:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:08,501 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1012 transitions. [2019-10-13 21:11:08,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1012 transitions. [2019-10-13 21:11:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:11:08,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:08,507 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:08,508 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1477493277, now seen corresponding path program 1 times [2019-10-13 21:11:08,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:08,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693058188] [2019-10-13 21:11:08,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:08,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693058188] [2019-10-13 21:11:08,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:08,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:11:08,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879474007] [2019-10-13 21:11:08,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:11:08,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:08,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:11:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:08,712 INFO L87 Difference]: Start difference. First operand 638 states and 1012 transitions. Second operand 10 states. [2019-10-13 21:11:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:08,939 INFO L93 Difference]: Finished difference Result 1197 states and 1907 transitions. [2019-10-13 21:11:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:08,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 21:11:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:08,945 INFO L225 Difference]: With dead ends: 1197 [2019-10-13 21:11:08,945 INFO L226 Difference]: Without dead ends: 647 [2019-10-13 21:11:08,948 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:11:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-13 21:11:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-10-13 21:11:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-13 21:11:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1021 transitions. [2019-10-13 21:11:08,976 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1021 transitions. Word has length 92 [2019-10-13 21:11:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:08,977 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 1021 transitions. [2019-10-13 21:11:08,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:11:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1021 transitions. [2019-10-13 21:11:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:11:08,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:08,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:08,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1457155902, now seen corresponding path program 1 times [2019-10-13 21:11:08,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:08,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303828564] [2019-10-13 21:11:08,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:09,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303828564] [2019-10-13 21:11:09,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:09,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:09,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55080614] [2019-10-13 21:11:09,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:09,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:09,085 INFO L87 Difference]: Start difference. First operand 645 states and 1021 transitions. Second operand 4 states. [2019-10-13 21:11:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:09,140 INFO L93 Difference]: Finished difference Result 1245 states and 1993 transitions. [2019-10-13 21:11:09,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:09,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:11:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:09,146 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:11:09,146 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 21:11:09,150 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:11:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 21:11:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-13 21:11:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-13 21:11:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 998 transitions. [2019-10-13 21:11:09,175 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 998 transitions. Word has length 92 [2019-10-13 21:11:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:09,176 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 998 transitions. [2019-10-13 21:11:09,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 998 transitions. [2019-10-13 21:11:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:11:09,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:09,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:09,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1488514411, now seen corresponding path program 1 times [2019-10-13 21:11:09,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:09,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298690579] [2019-10-13 21:11:09,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:09,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298690579] [2019-10-13 21:11:09,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:09,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:09,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572973771] [2019-10-13 21:11:09,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:09,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:09,324 INFO L87 Difference]: Start difference. First operand 632 states and 998 transitions. Second operand 6 states. [2019-10-13 21:11:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:09,545 INFO L93 Difference]: Finished difference Result 1185 states and 1885 transitions. [2019-10-13 21:11:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:09,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-13 21:11:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:09,550 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:11:09,550 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 21:11:09,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 21:11:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-13 21:11:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-13 21:11:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 994 transitions. [2019-10-13 21:11:09,578 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 994 transitions. Word has length 93 [2019-10-13 21:11:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:09,578 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 994 transitions. [2019-10-13 21:11:09,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 994 transitions. [2019-10-13 21:11:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:11:09,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:09,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:09,581 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1742740858, now seen corresponding path program 1 times [2019-10-13 21:11:09,581 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:09,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412796655] [2019-10-13 21:11:09,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:09,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412796655] [2019-10-13 21:11:09,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:09,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:09,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690723381] [2019-10-13 21:11:09,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:09,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:09,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:09,752 INFO L87 Difference]: Start difference. First operand 632 states and 994 transitions. Second operand 6 states. [2019-10-13 21:11:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:09,945 INFO L93 Difference]: Finished difference Result 1185 states and 1881 transitions. [2019-10-13 21:11:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:09,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-13 21:11:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:09,951 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:11:09,951 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 21:11:09,954 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:11:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 21:11:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-13 21:11:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-13 21:11:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 990 transitions. [2019-10-13 21:11:09,982 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 990 transitions. Word has length 94 [2019-10-13 21:11:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:09,982 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 990 transitions. [2019-10-13 21:11:09,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 990 transitions. [2019-10-13 21:11:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:11:09,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:09,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:09,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1072622918, now seen corresponding path program 1 times [2019-10-13 21:11:09,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:09,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658103500] [2019-10-13 21:11:09,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:10,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658103500] [2019-10-13 21:11:10,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:10,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:10,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457670459] [2019-10-13 21:11:10,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:10,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:10,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:10,119 INFO L87 Difference]: Start difference. First operand 632 states and 990 transitions. Second operand 6 states. [2019-10-13 21:11:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:10,335 INFO L93 Difference]: Finished difference Result 1185 states and 1877 transitions. [2019-10-13 21:11:10,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:10,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:11:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:10,341 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:11:10,341 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 21:11:10,348 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:11:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 21:11:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-13 21:11:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-13 21:11:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 986 transitions. [2019-10-13 21:11:10,370 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 986 transitions. Word has length 95 [2019-10-13 21:11:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:10,370 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 986 transitions. [2019-10-13 21:11:10,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 986 transitions. [2019-10-13 21:11:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:11:10,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:10,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:10,373 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -24768710, now seen corresponding path program 1 times [2019-10-13 21:11:10,373 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:10,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816127008] [2019-10-13 21:11:10,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:10,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:10,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:10,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816127008] [2019-10-13 21:11:10,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:10,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:10,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405373626] [2019-10-13 21:11:10,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:10,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:10,501 INFO L87 Difference]: Start difference. First operand 632 states and 986 transitions. Second operand 7 states. [2019-10-13 21:11:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:10,579 INFO L93 Difference]: Finished difference Result 1185 states and 1873 transitions. [2019-10-13 21:11:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:10,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:11:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:10,584 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:11:10,585 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:11:10,588 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:11:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:11:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:11:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:11:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 952 transitions. [2019-10-13 21:11:10,606 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 952 transitions. Word has length 95 [2019-10-13 21:11:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:10,607 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 952 transitions. [2019-10-13 21:11:10,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 952 transitions. [2019-10-13 21:11:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:11:10,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:10,609 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:10,609 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1812600053, now seen corresponding path program 1 times [2019-10-13 21:11:10,610 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:10,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479855031] [2019-10-13 21:11:10,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:10,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:10,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479855031] [2019-10-13 21:11:10,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:10,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:10,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482155278] [2019-10-13 21:11:10,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:10,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:10,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:10,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:10,728 INFO L87 Difference]: Start difference. First operand 611 states and 952 transitions. Second operand 6 states. [2019-10-13 21:11:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:10,913 INFO L93 Difference]: Finished difference Result 1164 states and 1839 transitions. [2019-10-13 21:11:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:10,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:11:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:10,918 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 21:11:10,918 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:11:10,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:11:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:11:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:11:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-13 21:11:10,946 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 96 [2019-10-13 21:11:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:10,948 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-13 21:11:10,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-13 21:11:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:11:10,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:10,950 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:10,951 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash 979115743, now seen corresponding path program 1 times [2019-10-13 21:11:10,951 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:10,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930026071] [2019-10-13 21:11:10,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:10,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:10,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:11,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930026071] [2019-10-13 21:11:11,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:11,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:11,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731324235] [2019-10-13 21:11:11,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:11,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:11,086 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-10-13 21:11:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:11,207 INFO L93 Difference]: Finished difference Result 1164 states and 1838 transitions. [2019-10-13 21:11:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:11,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:11:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:11,214 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 21:11:11,215 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:11:11,219 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:11:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:11:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:11:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:11:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 950 transitions. [2019-10-13 21:11:11,246 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 950 transitions. Word has length 97 [2019-10-13 21:11:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:11,248 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 950 transitions. [2019-10-13 21:11:11,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 950 transitions. [2019-10-13 21:11:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:11:11,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:11,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:11,250 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1568643986, now seen corresponding path program 1 times [2019-10-13 21:11:11,251 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:11,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450737520] [2019-10-13 21:11:11,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:11,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:11,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:11,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450737520] [2019-10-13 21:11:11,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:11,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:11,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027296892] [2019-10-13 21:11:11,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:11,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:11,359 INFO L87 Difference]: Start difference. First operand 611 states and 950 transitions. Second operand 4 states. [2019-10-13 21:11:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:11,409 INFO L93 Difference]: Finished difference Result 1164 states and 1837 transitions. [2019-10-13 21:11:11,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:11,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-13 21:11:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:11,415 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 21:11:11,415 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:11:11,420 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:11:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:11:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:11:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:11:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 949 transitions. [2019-10-13 21:11:11,441 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 949 transitions. Word has length 98 [2019-10-13 21:11:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:11,442 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 949 transitions. [2019-10-13 21:11:11,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 949 transitions. [2019-10-13 21:11:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:11:11,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:11,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:11,444 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:11,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1584162704, now seen corresponding path program 1 times [2019-10-13 21:11:11,444 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:11,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748494195] [2019-10-13 21:11:11,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:11,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:11,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:11,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748494195] [2019-10-13 21:11:11,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:11,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:11:11,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13029002] [2019-10-13 21:11:11,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:11:11,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:11:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:11,624 INFO L87 Difference]: Start difference. First operand 611 states and 949 transitions. Second operand 12 states. [2019-10-13 21:11:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:11,834 INFO L93 Difference]: Finished difference Result 1165 states and 1836 transitions. [2019-10-13 21:11:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:11:11,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-13 21:11:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:11,842 INFO L225 Difference]: With dead ends: 1165 [2019-10-13 21:11:11,842 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:11:11,849 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:11:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:11:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:11:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:11:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 948 transitions. [2019-10-13 21:11:11,880 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 948 transitions. Word has length 98 [2019-10-13 21:11:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:11,880 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 948 transitions. [2019-10-13 21:11:11,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:11:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 948 transitions. [2019-10-13 21:11:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:11:11,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:11,883 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:11,884 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -225790824, now seen corresponding path program 1 times [2019-10-13 21:11:11,884 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:11,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947905070] [2019-10-13 21:11:11,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:11,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:11,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:12,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947905070] [2019-10-13 21:11:12,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:12,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:12,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027281651] [2019-10-13 21:11:12,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:12,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:12,131 INFO L87 Difference]: Start difference. First operand 611 states and 948 transitions. Second operand 9 states. [2019-10-13 21:11:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,392 INFO L93 Difference]: Finished difference Result 1667 states and 2655 transitions. [2019-10-13 21:11:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:11:19,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-13 21:11:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,402 INFO L225 Difference]: With dead ends: 1667 [2019-10-13 21:11:19,402 INFO L226 Difference]: Without dead ends: 1122 [2019-10-13 21:11:19,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:11:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-10-13 21:11:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1090. [2019-10-13 21:11:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-10-13 21:11:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1688 transitions. [2019-10-13 21:11:19,468 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1688 transitions. Word has length 99 [2019-10-13 21:11:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,469 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1688 transitions. [2019-10-13 21:11:19,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1688 transitions. [2019-10-13 21:11:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:11:19,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:19,471 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 238992682, now seen corresponding path program 1 times [2019-10-13 21:11:19,472 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458745003] [2019-10-13 21:11:19,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:19,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458745003] [2019-10-13 21:11:19,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:19,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409805735] [2019-10-13 21:11:19,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:19,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:19,694 INFO L87 Difference]: Start difference. First operand 1090 states and 1688 transitions. Second operand 5 states. [2019-10-13 21:11:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:21,848 INFO L93 Difference]: Finished difference Result 3272 states and 5205 transitions. [2019-10-13 21:11:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:21,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 21:11:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:21,867 INFO L225 Difference]: With dead ends: 3272 [2019-10-13 21:11:21,867 INFO L226 Difference]: Without dead ends: 2249 [2019-10-13 21:11:21,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-10-13 21:11:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2221. [2019-10-13 21:11:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-10-13 21:11:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3535 transitions. [2019-10-13 21:11:22,008 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3535 transitions. Word has length 100 [2019-10-13 21:11:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:22,009 INFO L462 AbstractCegarLoop]: Abstraction has 2221 states and 3535 transitions. [2019-10-13 21:11:22,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3535 transitions. [2019-10-13 21:11:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:22,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:22,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:22,011 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1182567146, now seen corresponding path program 1 times [2019-10-13 21:11:22,012 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:22,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618308693] [2019-10-13 21:11:22,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:22,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618308693] [2019-10-13 21:11:22,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:22,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:22,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413239247] [2019-10-13 21:11:22,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:22,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:22,122 INFO L87 Difference]: Start difference. First operand 2221 states and 3535 transitions. Second operand 4 states. [2019-10-13 21:11:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:24,380 INFO L93 Difference]: Finished difference Result 6897 states and 11306 transitions. [2019-10-13 21:11:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:24,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-13 21:11:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:24,433 INFO L225 Difference]: With dead ends: 6897 [2019-10-13 21:11:24,434 INFO L226 Difference]: Without dead ends: 4744 [2019-10-13 21:11:24,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2019-10-13 21:11:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4687. [2019-10-13 21:11:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-10-13 21:11:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 7714 transitions. [2019-10-13 21:11:24,746 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 7714 transitions. Word has length 101 [2019-10-13 21:11:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:24,746 INFO L462 AbstractCegarLoop]: Abstraction has 4687 states and 7714 transitions. [2019-10-13 21:11:24,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 7714 transitions. [2019-10-13 21:11:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:11:24,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:24,748 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:24,749 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1993722348, now seen corresponding path program 1 times [2019-10-13 21:11:24,749 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:24,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16525392] [2019-10-13 21:11:24,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:24,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:24,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:24,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16525392] [2019-10-13 21:11:24,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:24,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:24,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751995286] [2019-10-13 21:11:24,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:24,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:24,853 INFO L87 Difference]: Start difference. First operand 4687 states and 7714 transitions. Second operand 4 states. [2019-10-13 21:11:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:27,041 INFO L93 Difference]: Finished difference Result 14913 states and 25594 transitions. [2019-10-13 21:11:27,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:27,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 21:11:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:27,126 INFO L225 Difference]: With dead ends: 14913 [2019-10-13 21:11:27,127 INFO L226 Difference]: Without dead ends: 10296 [2019-10-13 21:11:27,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10296 states. [2019-10-13 21:11:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10296 to 10178. [2019-10-13 21:11:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10178 states. [2019-10-13 21:11:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10178 states to 10178 states and 17570 transitions. [2019-10-13 21:11:27,695 INFO L78 Accepts]: Start accepts. Automaton has 10178 states and 17570 transitions. Word has length 102 [2019-10-13 21:11:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:27,695 INFO L462 AbstractCegarLoop]: Abstraction has 10178 states and 17570 transitions. [2019-10-13 21:11:27,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 10178 states and 17570 transitions. [2019-10-13 21:11:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:11:27,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:27,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:27,698 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1674452760, now seen corresponding path program 1 times [2019-10-13 21:11:27,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:27,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103207783] [2019-10-13 21:11:27,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:27,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103207783] [2019-10-13 21:11:27,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:27,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:27,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505408205] [2019-10-13 21:11:27,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:27,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:27,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:27,810 INFO L87 Difference]: Start difference. First operand 10178 states and 17570 transitions. Second operand 4 states. [2019-10-13 21:11:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:31,072 INFO L93 Difference]: Finished difference Result 33056 states and 60889 transitions. [2019-10-13 21:11:31,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:31,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-13 21:11:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:31,237 INFO L225 Difference]: With dead ends: 33056 [2019-10-13 21:11:31,237 INFO L226 Difference]: Without dead ends: 22952 [2019-10-13 21:11:31,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22952 states. [2019-10-13 21:11:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22952 to 22701. [2019-10-13 21:11:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22701 states. [2019-10-13 21:11:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22701 states to 22701 states and 42042 transitions. [2019-10-13 21:11:32,719 INFO L78 Accepts]: Start accepts. Automaton has 22701 states and 42042 transitions. Word has length 103 [2019-10-13 21:11:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:32,720 INFO L462 AbstractCegarLoop]: Abstraction has 22701 states and 42042 transitions. [2019-10-13 21:11:32,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 22701 states and 42042 transitions. [2019-10-13 21:11:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:11:32,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:32,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:32,722 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash 367034030, now seen corresponding path program 1 times [2019-10-13 21:11:32,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:32,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792335645] [2019-10-13 21:11:32,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:32,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:32,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:32,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792335645] [2019-10-13 21:11:32,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:32,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:32,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261295151] [2019-10-13 21:11:32,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:32,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:32,826 INFO L87 Difference]: Start difference. First operand 22701 states and 42042 transitions. Second operand 4 states.