java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:55,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:55,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:55,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:55,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:55,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:55,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:55,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:55,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:55,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:55,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:55,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:55,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:55,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:55,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:55,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:55,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:55,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:55,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:55,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:55,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:55,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:55,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:55,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:55,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:55,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:55,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:55,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:55,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:55,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:55,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:55,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:55,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:55,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:55,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:55,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:55,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:55,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:55,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:55,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:55,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:55,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:10:55,910 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:55,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:55,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:55,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:55,914 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:55,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:55,914 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:55,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:55,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:55,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:55,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:55,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:55,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:55,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:55,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:55,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:55,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:55,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:55,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:55,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:55,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:55,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:55,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:55,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:55,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:55,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:55,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:55,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:55,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:10:56,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:56,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:56,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:56,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:56,279 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:56,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-10-13 21:10:56,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207bd2dc9/f3fe42b2ad3f461ea9cc0bdc0591154d/FLAGf7c5b8d3f [2019-10-13 21:10:56,934 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:56,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-10-13 21:10:56,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207bd2dc9/f3fe42b2ad3f461ea9cc0bdc0591154d/FLAGf7c5b8d3f [2019-10-13 21:10:57,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207bd2dc9/f3fe42b2ad3f461ea9cc0bdc0591154d [2019-10-13 21:10:57,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:57,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:57,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:57,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:57,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:57,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:57" (1/1) ... [2019-10-13 21:10:57,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc90f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:57, skipping insertion in model container [2019-10-13 21:10:57,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:57" (1/1) ... [2019-10-13 21:10:57,175 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:57,252 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:58,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:58,070 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:58,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:58,309 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:58,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58 WrapperNode [2019-10-13 21:10:58,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:58,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:58,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:58,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:58,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... [2019-10-13 21:10:58,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:58,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:58,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:58,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:58,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:58,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:58,592 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:58,593 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:58,593 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:58,593 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:58,593 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:58,594 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:58,594 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:58,594 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:58,594 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:58,594 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:58,595 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:58,595 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:58,595 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:58,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:58,596 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:58,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:58,596 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:58,596 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:10:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-13 21:10:58,601 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:58,601 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-13 21:10:58,601 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:58,601 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:58,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:10:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-13 21:10:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:01,230 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:01,231 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:01,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:01 BoogieIcfgContainer [2019-10-13 21:11:01,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:01,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:01,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:01,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:01,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:57" (1/3) ... [2019-10-13 21:11:01,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae3c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:01, skipping insertion in model container [2019-10-13 21:11:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:58" (2/3) ... [2019-10-13 21:11:01,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae3c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:01, skipping insertion in model container [2019-10-13 21:11:01,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:01" (3/3) ... [2019-10-13 21:11:01,247 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2019-10-13 21:11:01,258 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:01,271 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:01,286 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:01,324 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:01,324 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:01,324 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:01,324 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:01,324 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:01,325 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:01,325 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:01,325 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-10-13 21:11:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:11:01,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1815299235, now seen corresponding path program 1 times [2019-10-13 21:11:01,406 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670988091] [2019-10-13 21:11:01,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:02,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670988091] [2019-10-13 21:11:02,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:02,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527534765] [2019-10-13 21:11:02,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:02,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:02,054 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-10-13 21:11:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,248 INFO L93 Difference]: Finished difference Result 1197 states and 1943 transitions. [2019-10-13 21:11:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:02,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-13 21:11:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,282 INFO L225 Difference]: With dead ends: 1197 [2019-10-13 21:11:02,283 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:02,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:11:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:11:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 973 transitions. [2019-10-13 21:11:02,449 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 973 transitions. Word has length 85 [2019-10-13 21:11:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,450 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 973 transitions. [2019-10-13 21:11:02,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 973 transitions. [2019-10-13 21:11:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:11:02,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,464 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1195495049, now seen corresponding path program 1 times [2019-10-13 21:11:02,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527751898] [2019-10-13 21:11:02,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:02,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527751898] [2019-10-13 21:11:02,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:02,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437868168] [2019-10-13 21:11:02,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:02,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:02,698 INFO L87 Difference]: Start difference. First operand 607 states and 973 transitions. Second operand 4 states. [2019-10-13 21:11:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,815 INFO L93 Difference]: Finished difference Result 1177 states and 1904 transitions. [2019-10-13 21:11:02,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:02,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:11:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,825 INFO L225 Difference]: With dead ends: 1177 [2019-10-13 21:11:02,825 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:02,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:11:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:11:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 972 transitions. [2019-10-13 21:11:02,886 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 972 transitions. Word has length 88 [2019-10-13 21:11:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,887 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 972 transitions. [2019-10-13 21:11:02,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 972 transitions. [2019-10-13 21:11:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:11:02,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,901 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,901 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash -709071794, now seen corresponding path program 1 times [2019-10-13 21:11:02,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375681837] [2019-10-13 21:11:02,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375681837] [2019-10-13 21:11:03,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:03,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496601966] [2019-10-13 21:11:03,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:03,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:03,125 INFO L87 Difference]: Start difference. First operand 607 states and 972 transitions. Second operand 4 states. [2019-10-13 21:11:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,203 INFO L93 Difference]: Finished difference Result 1177 states and 1903 transitions. [2019-10-13 21:11:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:03,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-13 21:11:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,213 INFO L225 Difference]: With dead ends: 1177 [2019-10-13 21:11:03,213 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:03,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:11:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:11:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 971 transitions. [2019-10-13 21:11:03,257 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 971 transitions. Word has length 89 [2019-10-13 21:11:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,258 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 971 transitions. [2019-10-13 21:11:03,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 971 transitions. [2019-10-13 21:11:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:11:03,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,261 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1566496723, now seen corresponding path program 1 times [2019-10-13 21:11:03,261 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590159059] [2019-10-13 21:11:03,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590159059] [2019-10-13 21:11:03,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:03,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858810615] [2019-10-13 21:11:03,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:03,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:03,394 INFO L87 Difference]: Start difference. First operand 607 states and 971 transitions. Second operand 4 states. [2019-10-13 21:11:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,449 INFO L93 Difference]: Finished difference Result 1177 states and 1902 transitions. [2019-10-13 21:11:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:03,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:11:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,455 INFO L225 Difference]: With dead ends: 1177 [2019-10-13 21:11:03,455 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:03,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:11:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:11:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 970 transitions. [2019-10-13 21:11:03,485 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 970 transitions. Word has length 90 [2019-10-13 21:11:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,485 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 970 transitions. [2019-10-13 21:11:03,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2019-10-13 21:11:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:11:03,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,488 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash -823973782, now seen corresponding path program 1 times [2019-10-13 21:11:03,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545314536] [2019-10-13 21:11:03,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545314536] [2019-10-13 21:11:03,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:03,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752652204] [2019-10-13 21:11:03,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:03,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:03,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:03,614 INFO L87 Difference]: Start difference. First operand 607 states and 970 transitions. Second operand 4 states. [2019-10-13 21:11:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,683 INFO L93 Difference]: Finished difference Result 1177 states and 1901 transitions. [2019-10-13 21:11:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:03,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:11:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,690 INFO L225 Difference]: With dead ends: 1177 [2019-10-13 21:11:03,690 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:03,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:11:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:11:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 969 transitions. [2019-10-13 21:11:03,724 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 969 transitions. Word has length 91 [2019-10-13 21:11:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,725 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 969 transitions. [2019-10-13 21:11:03,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 969 transitions. [2019-10-13 21:11:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:11:03,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1832765905, now seen corresponding path program 1 times [2019-10-13 21:11:03,733 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369459046] [2019-10-13 21:11:03,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369459046] [2019-10-13 21:11:03,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:11:03,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961205363] [2019-10-13 21:11:03,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:11:03,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:11:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:03,988 INFO L87 Difference]: Start difference. First operand 607 states and 969 transitions. Second operand 10 states. [2019-10-13 21:11:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,161 INFO L93 Difference]: Finished difference Result 1135 states and 1821 transitions. [2019-10-13 21:11:04,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:04,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 21:11:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,167 INFO L225 Difference]: With dead ends: 1135 [2019-10-13 21:11:04,167 INFO L226 Difference]: Without dead ends: 616 [2019-10-13 21:11:04,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:11:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-13 21:11:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-10-13 21:11:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:11:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 978 transitions. [2019-10-13 21:11:04,207 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 978 transitions. Word has length 92 [2019-10-13 21:11:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,207 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 978 transitions. [2019-10-13 21:11:04,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:11:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 978 transitions. [2019-10-13 21:11:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:11:04,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,211 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1812428530, now seen corresponding path program 1 times [2019-10-13 21:11:04,212 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342046909] [2019-10-13 21:11:04,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:04,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342046909] [2019-10-13 21:11:04,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:04,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011951434] [2019-10-13 21:11:04,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:04,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:04,316 INFO L87 Difference]: Start difference. First operand 614 states and 978 transitions. Second operand 4 states. [2019-10-13 21:11:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,375 INFO L93 Difference]: Finished difference Result 1183 states and 1907 transitions. [2019-10-13 21:11:04,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:04,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:11:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,381 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:11:04,382 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 21:11:04,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 21:11:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-13 21:11:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-13 21:11:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 955 transitions. [2019-10-13 21:11:04,410 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 955 transitions. Word has length 92 [2019-10-13 21:11:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,410 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 955 transitions. [2019-10-13 21:11:04,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 955 transitions. [2019-10-13 21:11:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:11:04,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1505086713, now seen corresponding path program 1 times [2019-10-13 21:11:04,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386966249] [2019-10-13 21:11:04,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:04,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386966249] [2019-10-13 21:11:04,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:04,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060317514] [2019-10-13 21:11:04,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:04,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:04,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:04,595 INFO L87 Difference]: Start difference. First operand 601 states and 955 transitions. Second operand 6 states. [2019-10-13 21:11:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,824 INFO L93 Difference]: Finished difference Result 1123 states and 1799 transitions. [2019-10-13 21:11:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:04,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-13 21:11:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,830 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:11:04,830 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 21:11:04,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 21:11:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-13 21:11:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-13 21:11:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 951 transitions. [2019-10-13 21:11:04,860 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 951 transitions. Word has length 93 [2019-10-13 21:11:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,862 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 951 transitions. [2019-10-13 21:11:04,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 951 transitions. [2019-10-13 21:11:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:11:04,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash 150462354, now seen corresponding path program 1 times [2019-10-13 21:11:04,870 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886275512] [2019-10-13 21:11:04,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:05,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886275512] [2019-10-13 21:11:05,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:05,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:05,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702233660] [2019-10-13 21:11:05,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:05,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:05,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:05,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:05,044 INFO L87 Difference]: Start difference. First operand 601 states and 951 transitions. Second operand 6 states. [2019-10-13 21:11:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:05,259 INFO L93 Difference]: Finished difference Result 1123 states and 1795 transitions. [2019-10-13 21:11:05,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:05,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-13 21:11:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:05,264 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:11:05,265 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 21:11:05,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 21:11:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-13 21:11:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-13 21:11:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 947 transitions. [2019-10-13 21:11:05,292 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 947 transitions. Word has length 94 [2019-10-13 21:11:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:05,293 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 947 transitions. [2019-10-13 21:11:05,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 947 transitions. [2019-10-13 21:11:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:11:05,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:05,295 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:05,296 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash -105920916, now seen corresponding path program 1 times [2019-10-13 21:11:05,296 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:05,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401255741] [2019-10-13 21:11:05,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:05,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401255741] [2019-10-13 21:11:05,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:05,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:05,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170282079] [2019-10-13 21:11:05,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:05,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:05,417 INFO L87 Difference]: Start difference. First operand 601 states and 947 transitions. Second operand 6 states. [2019-10-13 21:11:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:05,634 INFO L93 Difference]: Finished difference Result 1123 states and 1791 transitions. [2019-10-13 21:11:05,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:05,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:11:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:05,697 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:11:05,697 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 21:11:05,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 21:11:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-13 21:11:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-13 21:11:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 943 transitions. [2019-10-13 21:11:05,733 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 943 transitions. Word has length 95 [2019-10-13 21:11:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:05,733 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 943 transitions. [2019-10-13 21:11:05,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 943 transitions. [2019-10-13 21:11:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:11:05,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:05,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:05,736 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 941933292, now seen corresponding path program 1 times [2019-10-13 21:11:05,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:05,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792825589] [2019-10-13 21:11:05,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:05,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792825589] [2019-10-13 21:11:05,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:05,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:05,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472628614] [2019-10-13 21:11:05,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:05,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:05,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:05,909 INFO L87 Difference]: Start difference. First operand 601 states and 943 transitions. Second operand 7 states. [2019-10-13 21:11:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:05,992 INFO L93 Difference]: Finished difference Result 1123 states and 1787 transitions. [2019-10-13 21:11:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:05,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:11:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:06,000 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:11:06,000 INFO L226 Difference]: Without dead ends: 580 [2019-10-13 21:11:06,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-13 21:11:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-13 21:11:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-13 21:11:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 909 transitions. [2019-10-13 21:11:06,032 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 909 transitions. Word has length 95 [2019-10-13 21:11:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:06,032 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 909 transitions. [2019-10-13 21:11:06,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 909 transitions. [2019-10-13 21:11:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:11:06,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:06,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:06,036 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:06,037 INFO L82 PathProgramCache]: Analyzing trace with hash 497335511, now seen corresponding path program 1 times [2019-10-13 21:11:06,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:06,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059902922] [2019-10-13 21:11:06,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:06,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059902922] [2019-10-13 21:11:06,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:06,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:06,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046967374] [2019-10-13 21:11:06,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:06,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:06,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:06,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:06,191 INFO L87 Difference]: Start difference. First operand 580 states and 909 transitions. Second operand 6 states. [2019-10-13 21:11:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:06,292 INFO L93 Difference]: Finished difference Result 1102 states and 1753 transitions. [2019-10-13 21:11:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:06,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:11:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:06,297 INFO L225 Difference]: With dead ends: 1102 [2019-10-13 21:11:06,297 INFO L226 Difference]: Without dead ends: 580 [2019-10-13 21:11:06,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-13 21:11:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-13 21:11:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-13 21:11:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 908 transitions. [2019-10-13 21:11:06,326 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 908 transitions. Word has length 96 [2019-10-13 21:11:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:06,327 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 908 transitions. [2019-10-13 21:11:06,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 908 transitions. [2019-10-13 21:11:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:11:06,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:06,329 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:06,330 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1979618769, now seen corresponding path program 1 times [2019-10-13 21:11:06,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:06,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389946882] [2019-10-13 21:11:06,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:06,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389946882] [2019-10-13 21:11:06,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:06,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:06,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14601182] [2019-10-13 21:11:06,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:06,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:06,460 INFO L87 Difference]: Start difference. First operand 580 states and 908 transitions. Second operand 6 states. [2019-10-13 21:11:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:06,556 INFO L93 Difference]: Finished difference Result 1102 states and 1752 transitions. [2019-10-13 21:11:06,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:06,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:11:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:06,561 INFO L225 Difference]: With dead ends: 1102 [2019-10-13 21:11:06,562 INFO L226 Difference]: Without dead ends: 580 [2019-10-13 21:11:06,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-13 21:11:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-13 21:11:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-13 21:11:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 907 transitions. [2019-10-13 21:11:06,623 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 907 transitions. Word has length 97 [2019-10-13 21:11:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:06,625 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 907 transitions. [2019-10-13 21:11:06,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 907 transitions. [2019-10-13 21:11:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:11:06,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:06,628 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:06,628 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash 646962716, now seen corresponding path program 1 times [2019-10-13 21:11:06,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:06,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6321667] [2019-10-13 21:11:06,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:06,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:06,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6321667] [2019-10-13 21:11:06,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:06,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:11:06,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281511970] [2019-10-13 21:11:06,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:11:06,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:11:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:06,839 INFO L87 Difference]: Start difference. First operand 580 states and 907 transitions. Second operand 12 states. [2019-10-13 21:11:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:07,013 INFO L93 Difference]: Finished difference Result 1103 states and 1751 transitions. [2019-10-13 21:11:07,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:11:07,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-13 21:11:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:07,018 INFO L225 Difference]: With dead ends: 1103 [2019-10-13 21:11:07,018 INFO L226 Difference]: Without dead ends: 580 [2019-10-13 21:11:07,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:11:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-13 21:11:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-13 21:11:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-13 21:11:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 906 transitions. [2019-10-13 21:11:07,045 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 906 transitions. Word has length 98 [2019-10-13 21:11:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:07,046 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 906 transitions. [2019-10-13 21:11:07,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:11:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 906 transitions. [2019-10-13 21:11:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:11:07,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:07,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:07,048 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:07,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1922891352, now seen corresponding path program 1 times [2019-10-13 21:11:07,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:07,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667246870] [2019-10-13 21:11:07,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:07,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:07,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667246870] [2019-10-13 21:11:07,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:07,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:07,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094102314] [2019-10-13 21:11:07,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:07,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:07,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:07,222 INFO L87 Difference]: Start difference. First operand 580 states and 906 transitions. Second operand 9 states. [2019-10-13 21:11:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:14,644 INFO L93 Difference]: Finished difference Result 1574 states and 2521 transitions. [2019-10-13 21:11:14,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:11:14,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-13 21:11:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:14,655 INFO L225 Difference]: With dead ends: 1574 [2019-10-13 21:11:14,655 INFO L226 Difference]: Without dead ends: 1060 [2019-10-13 21:11:14,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:11:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-13 21:11:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1028. [2019-10-13 21:11:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-10-13 21:11:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1603 transitions. [2019-10-13 21:11:14,720 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1603 transitions. Word has length 99 [2019-10-13 21:11:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:14,721 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1603 transitions. [2019-10-13 21:11:14,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1603 transitions. [2019-10-13 21:11:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:11:14,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:14,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:14,724 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1808185200, now seen corresponding path program 1 times [2019-10-13 21:11:14,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:14,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562616884] [2019-10-13 21:11:14,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:14,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562616884] [2019-10-13 21:11:14,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:14,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:14,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124101113] [2019-10-13 21:11:14,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:14,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:14,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:14,914 INFO L87 Difference]: Start difference. First operand 1028 states and 1603 transitions. Second operand 5 states. [2019-10-13 21:11:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,082 INFO L93 Difference]: Finished difference Result 3086 states and 4948 transitions. [2019-10-13 21:11:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:17,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 21:11:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,101 INFO L225 Difference]: With dead ends: 3086 [2019-10-13 21:11:17,101 INFO L226 Difference]: Without dead ends: 2125 [2019-10-13 21:11:17,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-10-13 21:11:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2097. [2019-10-13 21:11:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-10-13 21:11:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3364 transitions. [2019-10-13 21:11:17,213 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3364 transitions. Word has length 100 [2019-10-13 21:11:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,213 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 3364 transitions. [2019-10-13 21:11:17,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3364 transitions. [2019-10-13 21:11:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:17,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,216 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash -220478198, now seen corresponding path program 1 times [2019-10-13 21:11:17,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071255078] [2019-10-13 21:11:17,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:17,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071255078] [2019-10-13 21:11:17,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:17,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655422886] [2019-10-13 21:11:17,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:17,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:17,355 INFO L87 Difference]: Start difference. First operand 2097 states and 3364 transitions. Second operand 4 states. [2019-10-13 21:11:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,577 INFO L93 Difference]: Finished difference Result 6525 states and 10791 transitions. [2019-10-13 21:11:19,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:19,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-13 21:11:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,625 INFO L225 Difference]: With dead ends: 6525 [2019-10-13 21:11:19,625 INFO L226 Difference]: Without dead ends: 4496 [2019-10-13 21:11:19,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2019-10-13 21:11:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4439. [2019-10-13 21:11:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-10-13 21:11:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7371 transitions. [2019-10-13 21:11:19,911 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7371 transitions. Word has length 101 [2019-10-13 21:11:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,914 INFO L462 AbstractCegarLoop]: Abstraction has 4439 states and 7371 transitions. [2019-10-13 21:11:19,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7371 transitions. [2019-10-13 21:11:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:11:19,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:19,916 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1753802514, now seen corresponding path program 1 times [2019-10-13 21:11:19,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504030536] [2019-10-13 21:11:19,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:20,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504030536] [2019-10-13 21:11:20,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:20,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:20,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854205744] [2019-10-13 21:11:20,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:20,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:20,027 INFO L87 Difference]: Start difference. First operand 4439 states and 7371 transitions. Second operand 4 states. [2019-10-13 21:11:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:22,252 INFO L93 Difference]: Finished difference Result 14169 states and 24563 transitions. [2019-10-13 21:11:22,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:22,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 21:11:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:22,346 INFO L225 Difference]: With dead ends: 14169 [2019-10-13 21:11:22,346 INFO L226 Difference]: Without dead ends: 9800 [2019-10-13 21:11:22,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9800 states. [2019-10-13 21:11:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9800 to 9682. [2019-10-13 21:11:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-10-13 21:11:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 16883 transitions. [2019-10-13 21:11:23,002 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 16883 transitions. Word has length 102 [2019-10-13 21:11:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:23,003 INFO L462 AbstractCegarLoop]: Abstraction has 9682 states and 16883 transitions. [2019-10-13 21:11:23,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 16883 transitions. [2019-10-13 21:11:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:11:23,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:23,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:23,007 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1468000948, now seen corresponding path program 1 times [2019-10-13 21:11:23,007 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:23,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352986591] [2019-10-13 21:11:23,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:23,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:23,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:23,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352986591] [2019-10-13 21:11:23,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:23,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:23,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739051628] [2019-10-13 21:11:23,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:23,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:23,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:23,132 INFO L87 Difference]: Start difference. First operand 9682 states and 16883 transitions. Second operand 4 states. [2019-10-13 21:11:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:26,082 INFO L93 Difference]: Finished difference Result 31568 states and 58826 transitions. [2019-10-13 21:11:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:26,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-13 21:11:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:26,274 INFO L225 Difference]: With dead ends: 31568 [2019-10-13 21:11:26,275 INFO L226 Difference]: Without dead ends: 21960 [2019-10-13 21:11:26,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21960 states. [2019-10-13 21:11:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21960 to 21709. [2019-10-13 21:11:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21709 states. [2019-10-13 21:11:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21709 states to 21709 states and 40667 transitions. [2019-10-13 21:11:28,688 INFO L78 Accepts]: Start accepts. Automaton has 21709 states and 40667 transitions. Word has length 103 [2019-10-13 21:11:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:28,690 INFO L462 AbstractCegarLoop]: Abstraction has 21709 states and 40667 transitions. [2019-10-13 21:11:28,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21709 states and 40667 transitions. [2019-10-13 21:11:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:11:28,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:28,693 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:28,693 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1735310740, now seen corresponding path program 1 times [2019-10-13 21:11:28,694 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:28,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132230099] [2019-10-13 21:11:28,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:28,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:28,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:28,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132230099] [2019-10-13 21:11:28,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:28,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:28,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433748796] [2019-10-13 21:11:28,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:28,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:28,802 INFO L87 Difference]: Start difference. First operand 21709 states and 40667 transitions. Second operand 4 states.