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_spec9_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:12:11,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:12:11,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:12:11,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:12:11,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:12:11,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:12:11,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:12:11,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:12:11,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:12:11,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:12:11,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:12:11,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:12:11,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:12:11,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:12:11,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:12:11,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:12:11,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:12:11,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:12:11,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:12:11,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:12:11,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:12:11,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:12:11,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:12:11,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:12:11,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:12:11,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:12:11,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:12:11,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:12:11,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:12:11,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:12:11,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:12:11,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:12:11,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:12:11,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:12:11,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:12:11,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:12:11,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:12:11,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:12:11,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:12:11,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:12:11,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:12:11,064 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:12:11,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:12:11,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:12:11,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:12:11,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:12:11,093 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:12:11,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:12:11,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:12:11,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:12:11,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:12:11,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:12:11,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:12:11,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:12:11,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:12:11,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:12:11,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:12:11,096 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:12:11,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:12:11,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:12:11,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:12:11,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:12:11,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:12:11,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:11,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:12:11,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:12:11,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:12:11,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:12:11,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:12:11,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:12:11,099 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:12:11,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:12:11,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:12:11,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:12:11,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:12:11,406 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:12:11,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-13 21:12:11,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab30d79c/6a465db95bff4d45994333c89aba4f79/FLAG9a57d12e7 [2019-10-13 21:12:12,080 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:12:12,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-13 21:12:12,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab30d79c/6a465db95bff4d45994333c89aba4f79/FLAG9a57d12e7 [2019-10-13 21:12:12,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab30d79c/6a465db95bff4d45994333c89aba4f79 [2019-10-13 21:12:12,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:12:12,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:12:12,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:12,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:12:12,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:12:12,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319c2be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12, skipping insertion in model container [2019-10-13 21:12:12,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,326 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:12:12,387 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:12:13,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:13,100 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:12:13,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:13,291 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:12:13,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13 WrapperNode [2019-10-13 21:12:13,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:13,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:12:13,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:12:13,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:12:13,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (1/1) ... [2019-10-13 21:12:13,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:12:13,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:12:13,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:12:13,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:12:13,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (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:12:13,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:12:13,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:12:13,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:13,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:12:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:12:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:12:13,551 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:12:13,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:13,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:13,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:12:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:12:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:12:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:12:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:12:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:12:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:12:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:12:13,555 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:12:13,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:12:13,556 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:12:13,556 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:12:13,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:12:13,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:12:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:12:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:12:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:12:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:12:13,558 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:12:13,558 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:13,558 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:12:13,558 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:12:13,558 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-13 21:12:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:12:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-13 21:12:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:12:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:12:13,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:12:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:12:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:12:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:12:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:12:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:12:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:12:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:12:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:12:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:12:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:12:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:12:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:12:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:12:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:12:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:12:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:12:13,564 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:12:13,565 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:12:13,565 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:12:13,565 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:12:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:12:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:12:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:12:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:12:13,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:12:13,567 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:12:13,567 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:12:13,567 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:12:13,567 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:12:13,568 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:12:13,568 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:12:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:12:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:12:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:12:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:12:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:12:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:12:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:12:13,572 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:12:13,572 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:13,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:12:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:12:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:12:13,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:12:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:13,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:12:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:12:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:12:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:12:13,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:12:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:12:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:12:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:12:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:12:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:12:13,576 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:12:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:12:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:12:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:13,577 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:12:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:12:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:12:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:12:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:12:13,578 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:12:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:12:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:12:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:12:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:12:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:12:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:12:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:12:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:12:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:12:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:12:13,582 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:12:13,582 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:12:13,585 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:12:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:12:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:12:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:12:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:12:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:12:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:12:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:12:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:12:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:12:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:12:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:12:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:12:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:12:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:12:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:12:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:12:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:12:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:12:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:12:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:12:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:12:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:12:15,788 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:12:15,789 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:12:15,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:15 BoogieIcfgContainer [2019-10-13 21:12:15,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:12:15,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:12:15,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:12:15,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:12:15,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:12" (1/3) ... [2019-10-13 21:12:15,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2067c507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:15, skipping insertion in model container [2019-10-13 21:12:15,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:13" (2/3) ... [2019-10-13 21:12:15,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2067c507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:15, skipping insertion in model container [2019-10-13 21:12:15,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:15" (3/3) ... [2019-10-13 21:12:15,800 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2019-10-13 21:12:15,810 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:12:15,819 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:12:15,831 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:12:15,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:12:15,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:12:15,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:12:15,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:12:15,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:12:15,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:12:15,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:12:15,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:12:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-10-13 21:12:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:12:15,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:15,943 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] [2019-10-13 21:12:15,947 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 750707123, now seen corresponding path program 1 times [2019-10-13 21:12:15,964 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:15,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093845863] [2019-10-13 21:12:15,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,502 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:12:16,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093845863] [2019-10-13 21:12:16,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:16,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156212616] [2019-10-13 21:12:16,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:16,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:16,527 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-10-13 21:12:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,738 INFO L93 Difference]: Finished difference Result 1179 states and 1913 transitions. [2019-10-13 21:12:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:16,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-13 21:12:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,772 INFO L225 Difference]: With dead ends: 1179 [2019-10-13 21:12:16,772 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:16,784 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:12:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:12:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:12:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-10-13 21:12:16,902 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 87 [2019-10-13 21:12:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,902 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-10-13 21:12:16,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-10-13 21:12:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:12:16,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,908 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:12:16,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 773508994, now seen corresponding path program 1 times [2019-10-13 21:12:16,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004289547] [2019-10-13 21:12:16,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,063 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:12:17,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004289547] [2019-10-13 21:12:17,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048199999] [2019-10-13 21:12:17,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,068 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-10-13 21:12:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,199 INFO L93 Difference]: Finished difference Result 1159 states and 1874 transitions. [2019-10-13 21:12:17,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:12:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,205 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:12:17,205 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:17,209 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:12:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:12:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:12:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-10-13 21:12:17,248 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 90 [2019-10-13 21:12:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,248 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-10-13 21:12:17,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-10-13 21:12:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:12:17,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,253 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:12:17,253 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -580839806, now seen corresponding path program 1 times [2019-10-13 21:12:17,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911963153] [2019-10-13 21:12:17,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,438 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:12:17,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911963153] [2019-10-13 21:12:17,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832957857] [2019-10-13 21:12:17,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,443 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-10-13 21:12:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,506 INFO L93 Difference]: Finished difference Result 1159 states and 1873 transitions. [2019-10-13 21:12:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:12:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,514 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:12:17,515 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:17,518 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:12:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:12:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:12:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-10-13 21:12:17,565 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 91 [2019-10-13 21:12:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,565 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-10-13 21:12:17,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-10-13 21:12:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:12:17,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,570 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:12:17,570 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1251478526, now seen corresponding path program 1 times [2019-10-13 21:12:17,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765863] [2019-10-13 21:12:17,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,745 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:12:17,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765863] [2019-10-13 21:12:17,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409304735] [2019-10-13 21:12:17,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,748 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 4 states. [2019-10-13 21:12:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,821 INFO L93 Difference]: Finished difference Result 1159 states and 1872 transitions. [2019-10-13 21:12:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:12:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,831 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:12:17,831 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:17,836 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:12:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:12:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:12:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-10-13 21:12:17,864 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-10-13 21:12:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,865 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-10-13 21:12:17,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-10-13 21:12:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:12:17,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,868 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:12:17,868 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1208737154, now seen corresponding path program 1 times [2019-10-13 21:12:17,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041190792] [2019-10-13 21:12:17,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,058 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:12:18,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041190792] [2019-10-13 21:12:18,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:18,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876378971] [2019-10-13 21:12:18,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:18,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:18,061 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-10-13 21:12:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,108 INFO L93 Difference]: Finished difference Result 1159 states and 1871 transitions. [2019-10-13 21:12:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:18,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-13 21:12:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,113 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:12:18,113 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:18,116 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:12:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:12:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:12:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 954 transitions. [2019-10-13 21:12:18,135 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 954 transitions. Word has length 93 [2019-10-13 21:12:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,135 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 954 transitions. [2019-10-13 21:12:18,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 954 transitions. [2019-10-13 21:12:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:12:18,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,138 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:12:18,138 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1229172839, now seen corresponding path program 1 times [2019-10-13 21:12:18,139 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023164353] [2019-10-13 21:12:18,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,236 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:12:18,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023164353] [2019-10-13 21:12:18,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:18,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815232107] [2019-10-13 21:12:18,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:18,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:18,239 INFO L87 Difference]: Start difference. First operand 598 states and 954 transitions. Second operand 4 states. [2019-10-13 21:12:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,285 INFO L93 Difference]: Finished difference Result 1159 states and 1870 transitions. [2019-10-13 21:12:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:18,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-13 21:12:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,296 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:12:18,296 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:18,301 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:12:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:12:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:12:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 953 transitions. [2019-10-13 21:12:18,320 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 953 transitions. Word has length 94 [2019-10-13 21:12:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,321 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 953 transitions. [2019-10-13 21:12:18,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 953 transitions. [2019-10-13 21:12:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:12:18,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,324 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:12:18,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 701446266, now seen corresponding path program 1 times [2019-10-13 21:12:18,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792280632] [2019-10-13 21:12:18,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,492 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:12:18,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792280632] [2019-10-13 21:12:18,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:18,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117380989] [2019-10-13 21:12:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:18,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:18,497 INFO L87 Difference]: Start difference. First operand 598 states and 953 transitions. Second operand 10 states. [2019-10-13 21:12:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,695 INFO L93 Difference]: Finished difference Result 1111 states and 1782 transitions. [2019-10-13 21:12:18,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:18,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-13 21:12:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,705 INFO L225 Difference]: With dead ends: 1111 [2019-10-13 21:12:18,705 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:12:18,708 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:12:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:12:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:12:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:12:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 940 transitions. [2019-10-13 21:12:18,728 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 940 transitions. Word has length 94 [2019-10-13 21:12:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,729 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 940 transitions. [2019-10-13 21:12:18,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 940 transitions. [2019-10-13 21:12:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:12:18,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,731 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:12:18,731 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -870815129, now seen corresponding path program 1 times [2019-10-13 21:12:18,732 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895173037] [2019-10-13 21:12:18,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,872 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:12:18,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895173037] [2019-10-13 21:12:18,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:18,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063248405] [2019-10-13 21:12:18,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:18,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:18,874 INFO L87 Difference]: Start difference. First operand 592 states and 940 transitions. Second operand 6 states. [2019-10-13 21:12:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,085 INFO L93 Difference]: Finished difference Result 1105 states and 1769 transitions. [2019-10-13 21:12:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:12:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,090 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:12:19,090 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:12:19,094 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:12:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:12:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:12:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:12:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 936 transitions. [2019-10-13 21:12:19,114 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 936 transitions. Word has length 95 [2019-10-13 21:12:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,114 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 936 transitions. [2019-10-13 21:12:19,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 936 transitions. [2019-10-13 21:12:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:12:19,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,117 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:12:19,117 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,117 INFO L82 PathProgramCache]: Analyzing trace with hash 48330685, now seen corresponding path program 1 times [2019-10-13 21:12:19,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622888994] [2019-10-13 21:12:19,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,251 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:12:19,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622888994] [2019-10-13 21:12:19,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856237723] [2019-10-13 21:12:19,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,253 INFO L87 Difference]: Start difference. First operand 592 states and 936 transitions. Second operand 6 states. [2019-10-13 21:12:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,467 INFO L93 Difference]: Finished difference Result 1105 states and 1765 transitions. [2019-10-13 21:12:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:12:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,472 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:12:19,473 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:12:19,476 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:12:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:12:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:12:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:12:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 932 transitions. [2019-10-13 21:12:19,494 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 932 transitions. Word has length 96 [2019-10-13 21:12:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,495 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 932 transitions. [2019-10-13 21:12:19,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 932 transitions. [2019-10-13 21:12:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:12:19,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,497 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:12:19,497 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash -151934484, now seen corresponding path program 1 times [2019-10-13 21:12:19,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452610681] [2019-10-13 21:12:19,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,683 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:12:19,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452610681] [2019-10-13 21:12:19,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177737487] [2019-10-13 21:12:19,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,687 INFO L87 Difference]: Start difference. First operand 592 states and 932 transitions. Second operand 6 states. [2019-10-13 21:12:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,884 INFO L93 Difference]: Finished difference Result 1105 states and 1761 transitions. [2019-10-13 21:12:19,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:12:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,890 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:12:19,890 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:12:19,897 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:12:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:12:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:12:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:12:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 928 transitions. [2019-10-13 21:12:19,916 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 928 transitions. Word has length 97 [2019-10-13 21:12:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,917 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 928 transitions. [2019-10-13 21:12:19,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 928 transitions. [2019-10-13 21:12:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:12:19,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,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, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:19,921 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1813612140, now seen corresponding path program 1 times [2019-10-13 21:12:19,922 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404522561] [2019-10-13 21:12:19,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,076 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:12:20,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404522561] [2019-10-13 21:12:20,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:20,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996676667] [2019-10-13 21:12:20,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:20,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:20,079 INFO L87 Difference]: Start difference. First operand 592 states and 928 transitions. Second operand 7 states. [2019-10-13 21:12:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,185 INFO L93 Difference]: Finished difference Result 1105 states and 1757 transitions. [2019-10-13 21:12:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:20,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-13 21:12:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,194 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:12:20,195 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:12:20,199 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:12:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:12:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:12:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:12:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-10-13 21:12:20,227 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 97 [2019-10-13 21:12:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,227 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-10-13 21:12:20,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-10-13 21:12:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:12:20,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,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, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:20,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash -694201758, now seen corresponding path program 1 times [2019-10-13 21:12:20,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575941563] [2019-10-13 21:12:20,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,369 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:12:20,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575941563] [2019-10-13 21:12:20,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:20,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511564017] [2019-10-13 21:12:20,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:20,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:20,372 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 6 states. [2019-10-13 21:12:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,459 INFO L93 Difference]: Finished difference Result 1084 states and 1723 transitions. [2019-10-13 21:12:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:20,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-13 21:12:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,496 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 21:12:20,497 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:12:20,499 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:12:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:12:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:12:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:12:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-10-13 21:12:20,515 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 98 [2019-10-13 21:12:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,516 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-10-13 21:12:20,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-10-13 21:12:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:12:20,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,518 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:12:20,518 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1046367601, now seen corresponding path program 1 times [2019-10-13 21:12:20,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607172115] [2019-10-13 21:12:20,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,627 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:12:20,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607172115] [2019-10-13 21:12:20,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:20,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840501503] [2019-10-13 21:12:20,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:20,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:20,630 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 6 states. [2019-10-13 21:12:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,725 INFO L93 Difference]: Finished difference Result 1084 states and 1722 transitions. [2019-10-13 21:12:20,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:20,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-13 21:12:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,729 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 21:12:20,729 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:12:20,732 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:12:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:12:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:12:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:12:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 892 transitions. [2019-10-13 21:12:20,749 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 892 transitions. Word has length 99 [2019-10-13 21:12:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,749 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 892 transitions. [2019-10-13 21:12:20,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 892 transitions. [2019-10-13 21:12:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:12:20,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,751 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:12:20,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 540428551, now seen corresponding path program 1 times [2019-10-13 21:12:20,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310254433] [2019-10-13 21:12:20,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,920 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:12:20,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310254433] [2019-10-13 21:12:20,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:20,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112327450] [2019-10-13 21:12:20,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:20,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:20,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:20,922 INFO L87 Difference]: Start difference. First operand 571 states and 892 transitions. Second operand 12 states. [2019-10-13 21:12:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,163 INFO L93 Difference]: Finished difference Result 1085 states and 1721 transitions. [2019-10-13 21:12:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:12:21,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-13 21:12:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,170 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:12:21,170 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:12:21,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:12:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:12:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:12:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:12:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 891 transitions. [2019-10-13 21:12:21,216 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 891 transitions. Word has length 100 [2019-10-13 21:12:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,218 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 891 transitions. [2019-10-13 21:12:21,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 891 transitions. [2019-10-13 21:12:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:12:21,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,225 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:12:21,225 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1660047310, now seen corresponding path program 1 times [2019-10-13 21:12:21,226 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107141354] [2019-10-13 21:12:21,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,466 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:12:21,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107141354] [2019-10-13 21:12:21,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:21,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105644193] [2019-10-13 21:12:21,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:21,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:21,469 INFO L87 Difference]: Start difference. First operand 571 states and 891 transitions. Second operand 6 states. [2019-10-13 21:12:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:24,558 INFO L93 Difference]: Finished difference Result 1686 states and 2716 transitions. [2019-10-13 21:12:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:24,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-13 21:12:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:24,568 INFO L225 Difference]: With dead ends: 1686 [2019-10-13 21:12:24,569 INFO L226 Difference]: Without dead ends: 1181 [2019-10-13 21:12:24,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-13 21:12:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1054. [2019-10-13 21:12:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-13 21:12:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1692 transitions. [2019-10-13 21:12:24,644 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1692 transitions. Word has length 101 [2019-10-13 21:12:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:24,644 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1692 transitions. [2019-10-13 21:12:24,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1692 transitions. [2019-10-13 21:12:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:12:24,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:24,650 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, 1, 1, 1, 1, 1, 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:12:24,650 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash 335474846, now seen corresponding path program 1 times [2019-10-13 21:12:24,651 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:24,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808724828] [2019-10-13 21:12:24,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:24,908 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:12:24,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808724828] [2019-10-13 21:12:24,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:24,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:24,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171272542] [2019-10-13 21:12:24,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:24,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:24,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:24,918 INFO L87 Difference]: Start difference. First operand 1054 states and 1692 transitions. Second operand 12 states. [2019-10-13 21:12:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:34,271 INFO L93 Difference]: Finished difference Result 3366 states and 5439 transitions. [2019-10-13 21:12:34,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:12:34,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2019-10-13 21:12:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:34,292 INFO L225 Difference]: With dead ends: 3366 [2019-10-13 21:12:34,292 INFO L226 Difference]: Without dead ends: 2378 [2019-10-13 21:12:34,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:12:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-10-13 21:12:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2320. [2019-10-13 21:12:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-10-13 21:12:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3712 transitions. [2019-10-13 21:12:34,410 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3712 transitions. Word has length 133 [2019-10-13 21:12:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:34,411 INFO L462 AbstractCegarLoop]: Abstraction has 2320 states and 3712 transitions. [2019-10-13 21:12:34,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3712 transitions. [2019-10-13 21:12:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:12:34,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:34,415 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, 1, 1, 1, 1, 1, 1, 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:12:34,415 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash -165410431, now seen corresponding path program 1 times [2019-10-13 21:12:34,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:34,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147098377] [2019-10-13 21:12:34,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:34,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:34,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:34,598 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:12:34,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147098377] [2019-10-13 21:12:34,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:34,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:12:34,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797637996] [2019-10-13 21:12:34,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:34,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:34,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:34,600 INFO L87 Difference]: Start difference. First operand 2320 states and 3712 transitions. Second operand 9 states. [2019-10-13 21:12:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:38,197 INFO L93 Difference]: Finished difference Result 4614 states and 7541 transitions. [2019-10-13 21:12:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:12:38,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-13 21:12:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:38,212 INFO L225 Difference]: With dead ends: 4614 [2019-10-13 21:12:38,212 INFO L226 Difference]: Without dead ends: 2360 [2019-10-13 21:12:38,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-10-13 21:12:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2344. [2019-10-13 21:12:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-10-13 21:12:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3796 transitions. [2019-10-13 21:12:38,335 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3796 transitions. Word has length 134 [2019-10-13 21:12:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:38,336 INFO L462 AbstractCegarLoop]: Abstraction has 2344 states and 3796 transitions. [2019-10-13 21:12:38,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:12:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3796 transitions. [2019-10-13 21:12:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:12:38,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:38,340 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, 1, 1, 1, 1, 1, 1, 1, 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:12:38,340 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:38,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1058567112, now seen corresponding path program 1 times [2019-10-13 21:12:38,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:38,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876308619] [2019-10-13 21:12:38,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:38,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:38,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:38,487 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:12:38,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876308619] [2019-10-13 21:12:38,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:38,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:12:38,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493740330] [2019-10-13 21:12:38,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:12:38,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:38,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:12:38,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:38,489 INFO L87 Difference]: Start difference. First operand 2344 states and 3796 transitions. Second operand 8 states. [2019-10-13 21:12:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:44,114 INFO L93 Difference]: Finished difference Result 7947 states and 13293 transitions. [2019-10-13 21:12:44,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:12:44,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-10-13 21:12:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:44,152 INFO L225 Difference]: With dead ends: 7947 [2019-10-13 21:12:44,152 INFO L226 Difference]: Without dead ends: 5669 [2019-10-13 21:12:44,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:12:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-10-13 21:12:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5621. [2019-10-13 21:12:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5621 states. [2019-10-13 21:12:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 8997 transitions. [2019-10-13 21:12:44,412 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 8997 transitions. Word has length 135 [2019-10-13 21:12:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:44,413 INFO L462 AbstractCegarLoop]: Abstraction has 5621 states and 8997 transitions. [2019-10-13 21:12:44,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:12:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 8997 transitions. [2019-10-13 21:12:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:12:44,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:44,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:44,419 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2066663089, now seen corresponding path program 1 times [2019-10-13 21:12:44,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:44,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878267726] [2019-10-13 21:12:44,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:44,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:44,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:44,577 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:12:44,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878267726] [2019-10-13 21:12:44,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:44,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:12:44,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692649907] [2019-10-13 21:12:44,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:44,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:44,580 INFO L87 Difference]: Start difference. First operand 5621 states and 8997 transitions. Second operand 9 states.