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_spec3_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:08,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:08,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:08,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:08,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:08,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:08,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:08,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:08,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:08,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:08,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:08,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:08,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:08,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:08,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:08,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:08,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:08,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:08,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:08,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:08,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:08,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:08,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:08,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:08,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:08,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:08,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:08,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:08,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:08,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:08,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:08,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:08,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:08,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:08,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:08,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:08,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:08,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:08,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:08,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:08,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:08,171 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-15 01:11:08,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:08,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:08,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:08,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:08,194 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:08,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:08,194 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:08,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:08,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:08,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:08,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:08,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:08,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:08,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:08,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:08,197 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:08,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:08,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:08,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:08,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:08,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:08,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:08,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:08,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:08,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:08,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:08,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:08,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:08,199 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-15 01:11:08,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:08,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:08,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:08,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:08,525 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:08,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product30.cil.c [2019-10-15 01:11:08,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3569d1a18/fe65685605c548c9b8dbd503758e1c0e/FLAG2dbda49e4 [2019-10-15 01:11:09,256 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:09,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product30.cil.c [2019-10-15 01:11:09,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3569d1a18/fe65685605c548c9b8dbd503758e1c0e/FLAG2dbda49e4 [2019-10-15 01:11:09,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3569d1a18/fe65685605c548c9b8dbd503758e1c0e [2019-10-15 01:11:09,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:09,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:09,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:09,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:09,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:09,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:09" (1/1) ... [2019-10-15 01:11:09,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120087b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:09, skipping insertion in model container [2019-10-15 01:11:09,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:09" (1/1) ... [2019-10-15 01:11:09,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:09,550 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:10,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:10,306 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:10,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:10,551 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:10,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10 WrapperNode [2019-10-15 01:11:10,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:10,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:10,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:10,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:10,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:10,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:10,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:10,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:10,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (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-15 01:11:10,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:10,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:10,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:10,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:10,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:10,855 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:10,855 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:10,855 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:10,855 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:10,856 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:10,856 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:10,856 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:10,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:10,857 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:10,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:10,857 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:10,857 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:10,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:11:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:11:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:11:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-15 01:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-15 01:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:10,871 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:11:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:11:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:11:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:10,878 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-15 01:11:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:13,301 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:13,302 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:13,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:13 BoogieIcfgContainer [2019-10-15 01:11:13,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:13,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:13,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:13,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:13,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:09" (1/3) ... [2019-10-15 01:11:13,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3debbf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:13, skipping insertion in model container [2019-10-15 01:11:13,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10" (2/3) ... [2019-10-15 01:11:13,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3debbf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:13, skipping insertion in model container [2019-10-15 01:11:13,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:13" (3/3) ... [2019-10-15 01:11:13,313 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product30.cil.c [2019-10-15 01:11:13,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:13,336 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:13,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:13,393 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:13,393 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:13,394 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:13,394 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:13,394 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:13,394 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:13,394 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:13,394 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states. [2019-10-15 01:11:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:11:13,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:13,450 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:13,453 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash -517745057, now seen corresponding path program 1 times [2019-10-15 01:11:13,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:13,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224779672] [2019-10-15 01:11:13,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:13,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:14,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224779672] [2019-10-15 01:11:14,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:14,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:14,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123693252] [2019-10-15 01:11:14,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:14,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:14,096 INFO L87 Difference]: Start difference. First operand 828 states. Second operand 7 states. [2019-10-15 01:11:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:14,367 INFO L93 Difference]: Finished difference Result 1321 states and 2124 transitions. [2019-10-15 01:11:14,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:14,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-15 01:11:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:14,405 INFO L225 Difference]: With dead ends: 1321 [2019-10-15 01:11:14,405 INFO L226 Difference]: Without dead ends: 669 [2019-10-15 01:11:14,418 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-15 01:11:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-15 01:11:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2019-10-15 01:11:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-15 01:11:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1057 transitions. [2019-10-15 01:11:14,609 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1057 transitions. Word has length 93 [2019-10-15 01:11:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:14,610 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 1057 transitions. [2019-10-15 01:11:14,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1057 transitions. [2019-10-15 01:11:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:11:14,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:14,635 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:14,635 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1718929765, now seen corresponding path program 1 times [2019-10-15 01:11:14,636 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:14,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385304580] [2019-10-15 01:11:14,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:14,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:14,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:14,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385304580] [2019-10-15 01:11:14,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:14,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:14,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237788385] [2019-10-15 01:11:14,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:14,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:14,962 INFO L87 Difference]: Start difference. First operand 667 states and 1057 transitions. Second operand 4 states. [2019-10-15 01:11:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,045 INFO L93 Difference]: Finished difference Result 1300 states and 2079 transitions. [2019-10-15 01:11:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:15,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-15 01:11:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,052 INFO L225 Difference]: With dead ends: 1300 [2019-10-15 01:11:15,052 INFO L226 Difference]: Without dead ends: 649 [2019-10-15 01:11:15,104 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-15 01:11:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-15 01:11:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2019-10-15 01:11:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-15 01:11:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1024 transitions. [2019-10-15 01:11:15,132 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1024 transitions. Word has length 94 [2019-10-15 01:11:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,132 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 1024 transitions. [2019-10-15 01:11:15,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1024 transitions. [2019-10-15 01:11:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:11:15,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,137 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,137 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash -495368691, now seen corresponding path program 1 times [2019-10-15 01:11:15,138 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579021298] [2019-10-15 01:11:15,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:15,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579021298] [2019-10-15 01:11:15,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:15,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:15,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211989539] [2019-10-15 01:11:15,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:15,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:15,400 INFO L87 Difference]: Start difference. First operand 649 states and 1024 transitions. Second operand 7 states. [2019-10-15 01:11:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,521 INFO L93 Difference]: Finished difference Result 1269 states and 2021 transitions. [2019-10-15 01:11:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:15,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:11:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,529 INFO L225 Difference]: With dead ends: 1269 [2019-10-15 01:11:15,529 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:11:15,533 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-15 01:11:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:11:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:11:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:11:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1011 transitions. [2019-10-15 01:11:15,572 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1011 transitions. Word has length 94 [2019-10-15 01:11:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,575 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1011 transitions. [2019-10-15 01:11:15,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1011 transitions. [2019-10-15 01:11:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:11:15,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,583 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,583 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1956512957, now seen corresponding path program 1 times [2019-10-15 01:11:15,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826372907] [2019-10-15 01:11:15,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:15,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826372907] [2019-10-15 01:11:15,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:15,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:15,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72674942] [2019-10-15 01:11:15,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:15,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:15,808 INFO L87 Difference]: Start difference. First operand 643 states and 1011 transitions. Second operand 7 states. [2019-10-15 01:11:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,915 INFO L93 Difference]: Finished difference Result 1257 states and 1995 transitions. [2019-10-15 01:11:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:15,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:11:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,931 INFO L225 Difference]: With dead ends: 1257 [2019-10-15 01:11:15,931 INFO L226 Difference]: Without dead ends: 637 [2019-10-15 01:11:15,937 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-15 01:11:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-15 01:11:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-15 01:11:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-15 01:11:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 998 transitions. [2019-10-15 01:11:15,967 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 998 transitions. Word has length 95 [2019-10-15 01:11:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,967 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 998 transitions. [2019-10-15 01:11:15,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 998 transitions. [2019-10-15 01:11:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:11:15,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,971 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,971 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2132810737, now seen corresponding path program 1 times [2019-10-15 01:11:15,972 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926511911] [2019-10-15 01:11:15,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:16,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926511911] [2019-10-15 01:11:16,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:16,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144850246] [2019-10-15 01:11:16,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:16,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:16,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:16,230 INFO L87 Difference]: Start difference. First operand 637 states and 998 transitions. Second operand 7 states. [2019-10-15 01:11:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,333 INFO L93 Difference]: Finished difference Result 1245 states and 1969 transitions. [2019-10-15 01:11:16,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:16,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:11:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,346 INFO L225 Difference]: With dead ends: 1245 [2019-10-15 01:11:16,346 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:11:16,354 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-15 01:11:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:11:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:11:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:11:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 985 transitions. [2019-10-15 01:11:16,389 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 985 transitions. Word has length 96 [2019-10-15 01:11:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,390 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 985 transitions. [2019-10-15 01:11:16,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 985 transitions. [2019-10-15 01:11:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:11:16,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,394 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,394 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash -773214734, now seen corresponding path program 1 times [2019-10-15 01:11:16,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26993271] [2019-10-15 01:11:16,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:16,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26993271] [2019-10-15 01:11:16,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:16,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967933628] [2019-10-15 01:11:16,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:16,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:16,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:16,596 INFO L87 Difference]: Start difference. First operand 631 states and 985 transitions. Second operand 7 states. [2019-10-15 01:11:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,696 INFO L93 Difference]: Finished difference Result 1233 states and 1943 transitions. [2019-10-15 01:11:16,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:16,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:11:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,703 INFO L225 Difference]: With dead ends: 1233 [2019-10-15 01:11:16,703 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:11:16,707 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-15 01:11:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:11:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:11:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:11:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 984 transitions. [2019-10-15 01:11:16,730 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 984 transitions. Word has length 96 [2019-10-15 01:11:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,731 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 984 transitions. [2019-10-15 01:11:16,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 984 transitions. [2019-10-15 01:11:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:11:16,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,733 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,733 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2101985241, now seen corresponding path program 1 times [2019-10-15 01:11:16,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861707347] [2019-10-15 01:11:16,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:16,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861707347] [2019-10-15 01:11:16,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:16,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492010162] [2019-10-15 01:11:16,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:16,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:16,883 INFO L87 Difference]: Start difference. First operand 631 states and 984 transitions. Second operand 5 states. [2019-10-15 01:11:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,966 INFO L93 Difference]: Finished difference Result 1232 states and 1940 transitions. [2019-10-15 01:11:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:16,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-15 01:11:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,972 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:11:16,972 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:11:17,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:11:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:11:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:11:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 983 transitions. [2019-10-15 01:11:17,062 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 983 transitions. Word has length 97 [2019-10-15 01:11:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,062 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 983 transitions. [2019-10-15 01:11:17,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 983 transitions. [2019-10-15 01:11:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:11:17,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,065 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1046303197, now seen corresponding path program 1 times [2019-10-15 01:11:17,066 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968492716] [2019-10-15 01:11:17,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:17,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968492716] [2019-10-15 01:11:17,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:17,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243281515] [2019-10-15 01:11:17,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:17,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,229 INFO L87 Difference]: Start difference. First operand 631 states and 983 transitions. Second operand 5 states. [2019-10-15 01:11:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,309 INFO L93 Difference]: Finished difference Result 1232 states and 1938 transitions. [2019-10-15 01:11:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:17,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-15 01:11:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,315 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:11:17,315 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:11:17,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:11:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:11:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:11:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 982 transitions. [2019-10-15 01:11:17,341 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 982 transitions. Word has length 98 [2019-10-15 01:11:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,342 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 982 transitions. [2019-10-15 01:11:17,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 982 transitions. [2019-10-15 01:11:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:11:17,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,344 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,344 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2126960382, now seen corresponding path program 1 times [2019-10-15 01:11:17,345 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729604883] [2019-10-15 01:11:17,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:17,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729604883] [2019-10-15 01:11:17,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:17,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396167023] [2019-10-15 01:11:17,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:17,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,490 INFO L87 Difference]: Start difference. First operand 631 states and 982 transitions. Second operand 5 states. [2019-10-15 01:11:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,562 INFO L93 Difference]: Finished difference Result 1232 states and 1936 transitions. [2019-10-15 01:11:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:17,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-15 01:11:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,568 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:11:17,568 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:11:17,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:11:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:11:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:11:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 981 transitions. [2019-10-15 01:11:17,623 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 981 transitions. Word has length 99 [2019-10-15 01:11:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,624 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 981 transitions. [2019-10-15 01:11:17,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 981 transitions. [2019-10-15 01:11:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:11:17,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,628 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,629 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash -714656930, now seen corresponding path program 1 times [2019-10-15 01:11:17,630 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553665285] [2019-10-15 01:11:17,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:17,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553665285] [2019-10-15 01:11:17,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:17,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64945499] [2019-10-15 01:11:17,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:17,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,807 INFO L87 Difference]: Start difference. First operand 631 states and 981 transitions. Second operand 5 states. [2019-10-15 01:11:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,879 INFO L93 Difference]: Finished difference Result 1232 states and 1934 transitions. [2019-10-15 01:11:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:17,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 01:11:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,885 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:11:17,886 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:11:17,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:11:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:11:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:11:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 980 transitions. [2019-10-15 01:11:17,916 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 980 transitions. Word has length 100 [2019-10-15 01:11:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,916 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 980 transitions. [2019-10-15 01:11:17,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 980 transitions. [2019-10-15 01:11:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:11:17,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,918 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,919 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 670014941, now seen corresponding path program 1 times [2019-10-15 01:11:17,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146879992] [2019-10-15 01:11:17,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:11:18,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146879992] [2019-10-15 01:11:18,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888755592] [2019-10-15 01:11:18,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:11:19,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,169 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:19,292 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:19,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:11:19,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345357628] [2019-10-15 01:11:19,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:19,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:19,294 INFO L87 Difference]: Start difference. First operand 631 states and 980 transitions. Second operand 3 states. [2019-10-15 01:11:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,391 INFO L93 Difference]: Finished difference Result 1772 states and 2800 transitions. [2019-10-15 01:11:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:19,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:11:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,402 INFO L225 Difference]: With dead ends: 1772 [2019-10-15 01:11:19,403 INFO L226 Difference]: Without dead ends: 1175 [2019-10-15 01:11:19,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-15 01:11:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1162. [2019-10-15 01:11:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-10-15 01:11:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1823 transitions. [2019-10-15 01:11:19,504 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1823 transitions. Word has length 101 [2019-10-15 01:11:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,506 INFO L462 AbstractCegarLoop]: Abstraction has 1162 states and 1823 transitions. [2019-10-15 01:11:19,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1823 transitions. [2019-10-15 01:11:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:11:19,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,508 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:19,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:19,721 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 758547314, now seen corresponding path program 1 times [2019-10-15 01:11:19,722 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318774171] [2019-10-15 01:11:19,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:19,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318774171] [2019-10-15 01:11:19,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:19,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518905222] [2019-10-15 01:11:19,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:19,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:19,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:19,901 INFO L87 Difference]: Start difference. First operand 1162 states and 1823 transitions. Second operand 7 states. [2019-10-15 01:11:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,585 INFO L93 Difference]: Finished difference Result 3412 states and 5514 transitions. [2019-10-15 01:11:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:23,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-10-15 01:11:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:23,613 INFO L225 Difference]: With dead ends: 3412 [2019-10-15 01:11:23,614 INFO L226 Difference]: Without dead ends: 2284 [2019-10-15 01:11:23,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-10-15 01:11:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2218. [2019-10-15 01:11:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-10-15 01:11:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3559 transitions. [2019-10-15 01:11:23,756 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3559 transitions. Word has length 105 [2019-10-15 01:11:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,756 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 3559 transitions. [2019-10-15 01:11:23,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3559 transitions. [2019-10-15 01:11:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:11:23,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,758 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:23,759 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,759 INFO L82 PathProgramCache]: Analyzing trace with hash -60893374, now seen corresponding path program 1 times [2019-10-15 01:11:23,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524812649] [2019-10-15 01:11:23,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:11:23,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524812649] [2019-10-15 01:11:23,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813568087] [2019-10-15 01:11:23,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:11:24,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:24,637 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:24,743 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:24,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:11:24,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279211176] [2019-10-15 01:11:24,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:24,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:24,746 INFO L87 Difference]: Start difference. First operand 2218 states and 3559 transitions. Second operand 3 states. [2019-10-15 01:11:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,912 INFO L93 Difference]: Finished difference Result 5472 states and 8864 transitions. [2019-10-15 01:11:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:24,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-15 01:11:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,941 INFO L225 Difference]: With dead ends: 5472 [2019-10-15 01:11:24,941 INFO L226 Difference]: Without dead ends: 3288 [2019-10-15 01:11:24,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-10-15 01:11:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3188. [2019-10-15 01:11:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-10-15 01:11:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 5133 transitions. [2019-10-15 01:11:25,112 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 5133 transitions. Word has length 102 [2019-10-15 01:11:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,113 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 5133 transitions. [2019-10-15 01:11:25,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 5133 transitions. [2019-10-15 01:11:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:11:25,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,115 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:25,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:25,323 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1784972550, now seen corresponding path program 1 times [2019-10-15 01:11:25,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828361743] [2019-10-15 01:11:25,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:11:25,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828361743] [2019-10-15 01:11:25,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413210428] [2019-10-15 01:11:25,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 2970 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:11:26,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:26,273 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:26,631 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:26,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [11] total 20 [2019-10-15 01:11:26,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890479229] [2019-10-15 01:11:26,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:11:26,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:11:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:11:26,634 INFO L87 Difference]: Start difference. First operand 3188 states and 5133 transitions. Second operand 11 states. [2019-10-15 01:11:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:31,460 INFO L93 Difference]: Finished difference Result 14278 states and 23484 transitions. [2019-10-15 01:11:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:11:31,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-10-15 01:11:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:31,577 INFO L225 Difference]: With dead ends: 14278 [2019-10-15 01:11:31,577 INFO L226 Difference]: Without dead ends: 11124 [2019-10-15 01:11:31,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:11:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11124 states. [2019-10-15 01:11:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11124 to 11004. [2019-10-15 01:11:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11004 states. [2019-10-15 01:11:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11004 states to 11004 states and 17646 transitions. [2019-10-15 01:11:32,296 INFO L78 Accepts]: Start accepts. Automaton has 11004 states and 17646 transitions. Word has length 105 [2019-10-15 01:11:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:32,296 INFO L462 AbstractCegarLoop]: Abstraction has 11004 states and 17646 transitions. [2019-10-15 01:11:32,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:11:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11004 states and 17646 transitions. [2019-10-15 01:11:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:11:32,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:32,299 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:32,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:32,507 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1620322121, now seen corresponding path program 1 times [2019-10-15 01:11:32,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:32,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062397181] [2019-10-15 01:11:32,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:32,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062397181] [2019-10-15 01:11:32,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:32,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:32,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755548804] [2019-10-15 01:11:32,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:32,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:32,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:32,667 INFO L87 Difference]: Start difference. First operand 11004 states and 17646 transitions. Second operand 4 states. [2019-10-15 01:11:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:33,135 INFO L93 Difference]: Finished difference Result 21992 states and 35591 transitions. [2019-10-15 01:11:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:33,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:11:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:33,270 INFO L225 Difference]: With dead ends: 21992 [2019-10-15 01:11:33,271 INFO L226 Difference]: Without dead ends: 11022 [2019-10-15 01:11:33,324 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-15 01:11:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11022 states. [2019-10-15 01:11:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11022 to 10986. [2019-10-15 01:11:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10986 states. [2019-10-15 01:11:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10986 states to 10986 states and 17545 transitions. [2019-10-15 01:11:34,740 INFO L78 Accepts]: Start accepts. Automaton has 10986 states and 17545 transitions. Word has length 105 [2019-10-15 01:11:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:34,743 INFO L462 AbstractCegarLoop]: Abstraction has 10986 states and 17545 transitions. [2019-10-15 01:11:34,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10986 states and 17545 transitions. [2019-10-15 01:11:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:11:34,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:34,746 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:34,747 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1143886479, now seen corresponding path program 1 times [2019-10-15 01:11:34,747 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:34,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347392472] [2019-10-15 01:11:34,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:34,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:34,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:11:34,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347392472] [2019-10-15 01:11:34,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:34,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:34,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911909435] [2019-10-15 01:11:34,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:34,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:34,930 INFO L87 Difference]: Start difference. First operand 10986 states and 17545 transitions. Second operand 7 states. [2019-10-15 01:11:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:38,582 INFO L93 Difference]: Finished difference Result 32938 states and 54494 transitions. [2019-10-15 01:11:38,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:38,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-15 01:11:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:38,732 INFO L225 Difference]: With dead ends: 32938 [2019-10-15 01:11:38,732 INFO L226 Difference]: Without dead ends: 21986 [2019-10-15 01:11:38,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21986 states. [2019-10-15 01:11:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21986 to 21800. [2019-10-15 01:11:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-10-15 01:11:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 35491 transitions. [2019-10-15 01:11:39,891 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 35491 transitions. Word has length 113 [2019-10-15 01:11:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:39,893 INFO L462 AbstractCegarLoop]: Abstraction has 21800 states and 35491 transitions. [2019-10-15 01:11:39,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 35491 transitions. [2019-10-15 01:11:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:11:39,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:39,896 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:39,896 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -367218449, now seen corresponding path program 1 times [2019-10-15 01:11:39,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:39,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576079677] [2019-10-15 01:11:39,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:39,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:39,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:11:40,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576079677] [2019-10-15 01:11:40,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:40,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:40,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947414444] [2019-10-15 01:11:40,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:40,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:40,034 INFO L87 Difference]: Start difference. First operand 21800 states and 35491 transitions. Second operand 4 states. [2019-10-15 01:11:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:40,786 INFO L93 Difference]: Finished difference Result 43674 states and 71885 transitions. [2019-10-15 01:11:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:40,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:11:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted.