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_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:04,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:04,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:04,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:04,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:04,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:04,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:04,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:04,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:04,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:04,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:04,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:04,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:04,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:04,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:04,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:04,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:04,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:04,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:04,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:04,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:04,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:04,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:04,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:04,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:04,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:04,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:04,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:04,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:04,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:04,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:04,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:04,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:04,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:04,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:04,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:04,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:04,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:04,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:04,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:04,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:04,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:10:04,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:04,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:04,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:04,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:04,921 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:04,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:04,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:04,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:04,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:04,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:04,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:04,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:04,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:04,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:04,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:04,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:04,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:04,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:04,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:04,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:04,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:04,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:04,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:04,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:04,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:04,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:04,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:04,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:04,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:10:05,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:05,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:05,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:05,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:05,239 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:05,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-15 01:10:05,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5eff8fc/eb13cf711b5c4b97a4fb5c8409479754/FLAG3b9ff5cd7 [2019-10-15 01:10:06,003 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:06,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-15 01:10:06,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5eff8fc/eb13cf711b5c4b97a4fb5c8409479754/FLAG3b9ff5cd7 [2019-10-15 01:10:06,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5eff8fc/eb13cf711b5c4b97a4fb5c8409479754 [2019-10-15 01:10:06,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:06,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:06,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:06,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:06,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:06,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:06" (1/1) ... [2019-10-15 01:10:06,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbc4866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:06, skipping insertion in model container [2019-10-15 01:10:06,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:06" (1/1) ... [2019-10-15 01:10:06,234 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:06,310 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:07,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:07,109 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:07,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:07,370 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:07,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07 WrapperNode [2019-10-15 01:10:07,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:07,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:07,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:07,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:07,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... [2019-10-15 01:10:07,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:07,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:07,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:07,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:07,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:07,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:07,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:07,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:07,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:07,675 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:07,675 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:07,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:07,677 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:07,677 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:07,677 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:07,677 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:07,677 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:07,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:07,679 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-15 01:10:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-15 01:10:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-15 01:10:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-15 01:10:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-15 01:10:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-15 01:10:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-15 01:10:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:07,682 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:07,683 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:07,683 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:07,683 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:07,683 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-15 01:10:07,683 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-15 01:10:07,683 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-15 01:10:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-15 01:10:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-15 01:10:07,684 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-15 01:10:07,685 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-15 01:10:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-15 01:10:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-15 01:10:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:07,686 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:10:07,687 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:10:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:10:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:10:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-15 01:10:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-15 01:10:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-15 01:10:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-15 01:10:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-15 01:10:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-15 01:10:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-15 01:10:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-15 01:10:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-15 01:10:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-15 01:10:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-15 01:10:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-15 01:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-15 01:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-15 01:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-15 01:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-15 01:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-15 01:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-15 01:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-15 01:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-15 01:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:10,296 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:10,297 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:10,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:10 BoogieIcfgContainer [2019-10-15 01:10:10,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:10,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:10,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:10,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:10,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:06" (1/3) ... [2019-10-15 01:10:10,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2922a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:10, skipping insertion in model container [2019-10-15 01:10:10,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:07" (2/3) ... [2019-10-15 01:10:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2922a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:10, skipping insertion in model container [2019-10-15 01:10:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:10" (3/3) ... [2019-10-15 01:10:10,313 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_productSimulator.cil.c [2019-10-15 01:10:10,324 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:10,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:10,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:10,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:10,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:10,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:10,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:10,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:10,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:10,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:10,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states. [2019-10-15 01:10:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:10:10,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,553 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:10,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1390055657, now seen corresponding path program 1 times [2019-10-15 01:10:10,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340582135] [2019-10-15 01:10:10,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:11,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340582135] [2019-10-15 01:10:11,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:11,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530498214] [2019-10-15 01:10:11,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:11,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:11,366 INFO L87 Difference]: Start difference. First operand 926 states. Second operand 6 states. [2019-10-15 01:10:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,685 INFO L93 Difference]: Finished difference Result 1497 states and 2337 transitions. [2019-10-15 01:10:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:11,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:10:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,743 INFO L225 Difference]: With dead ends: 1497 [2019-10-15 01:10:11,743 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:11,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1165 transitions. [2019-10-15 01:10:11,967 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1165 transitions. Word has length 119 [2019-10-15 01:10:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,976 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1165 transitions. [2019-10-15 01:10:11,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1165 transitions. [2019-10-15 01:10:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:10:11,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,996 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:11,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash -232939241, now seen corresponding path program 1 times [2019-10-15 01:10:12,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161008283] [2019-10-15 01:10:12,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:12,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161008283] [2019-10-15 01:10:12,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:12,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823105288] [2019-10-15 01:10:12,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:12,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:12,411 INFO L87 Difference]: Start difference. First operand 754 states and 1165 transitions. Second operand 4 states. [2019-10-15 01:10:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,489 INFO L93 Difference]: Finished difference Result 1450 states and 2260 transitions. [2019-10-15 01:10:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:12,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-15 01:10:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,496 INFO L225 Difference]: With dead ends: 1450 [2019-10-15 01:10:12,496 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:12,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1164 transitions. [2019-10-15 01:10:12,535 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1164 transitions. Word has length 122 [2019-10-15 01:10:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,535 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1164 transitions. [2019-10-15 01:10:12,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1164 transitions. [2019-10-15 01:10:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:10:12,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,538 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:12,539 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1715522467, now seen corresponding path program 1 times [2019-10-15 01:10:12,539 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559795278] [2019-10-15 01:10:12,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:12,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559795278] [2019-10-15 01:10:12,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:12,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910209948] [2019-10-15 01:10:12,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:12,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:12,787 INFO L87 Difference]: Start difference. First operand 754 states and 1164 transitions. Second operand 4 states. [2019-10-15 01:10:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,876 INFO L93 Difference]: Finished difference Result 1450 states and 2259 transitions. [2019-10-15 01:10:12,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:12,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-15 01:10:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,888 INFO L225 Difference]: With dead ends: 1450 [2019-10-15 01:10:12,889 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:12,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1163 transitions. [2019-10-15 01:10:12,939 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1163 transitions. Word has length 123 [2019-10-15 01:10:12,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,939 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1163 transitions. [2019-10-15 01:10:12,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1163 transitions. [2019-10-15 01:10:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:10:12,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,944 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:12,944 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1903026157, now seen corresponding path program 1 times [2019-10-15 01:10:12,945 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964124071] [2019-10-15 01:10:12,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:13,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964124071] [2019-10-15 01:10:13,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:13,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66646983] [2019-10-15 01:10:13,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:13,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:13,204 INFO L87 Difference]: Start difference. First operand 754 states and 1163 transitions. Second operand 4 states. [2019-10-15 01:10:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,398 INFO L93 Difference]: Finished difference Result 1450 states and 2258 transitions. [2019-10-15 01:10:13,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:13,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-15 01:10:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,416 INFO L225 Difference]: With dead ends: 1450 [2019-10-15 01:10:13,416 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:13,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1162 transitions. [2019-10-15 01:10:13,450 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1162 transitions. Word has length 124 [2019-10-15 01:10:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,453 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1162 transitions. [2019-10-15 01:10:13,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1162 transitions. [2019-10-15 01:10:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 01:10:13,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,461 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:13,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2005235937, now seen corresponding path program 1 times [2019-10-15 01:10:13,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338388087] [2019-10-15 01:10:13,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:13,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338388087] [2019-10-15 01:10:13,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:13,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93835154] [2019-10-15 01:10:13,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:13,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:13,624 INFO L87 Difference]: Start difference. First operand 754 states and 1162 transitions. Second operand 4 states. [2019-10-15 01:10:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,686 INFO L93 Difference]: Finished difference Result 1450 states and 2257 transitions. [2019-10-15 01:10:13,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:13,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-15 01:10:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,694 INFO L225 Difference]: With dead ends: 1450 [2019-10-15 01:10:13,694 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:13,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1161 transitions. [2019-10-15 01:10:13,724 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1161 transitions. Word has length 125 [2019-10-15 01:10:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,725 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1161 transitions. [2019-10-15 01:10:13,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1161 transitions. [2019-10-15 01:10:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:10:13,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,728 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:13,728 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash -475123953, now seen corresponding path program 1 times [2019-10-15 01:10:13,729 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336628770] [2019-10-15 01:10:13,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:13,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336628770] [2019-10-15 01:10:13,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:13,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25014115] [2019-10-15 01:10:13,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:13,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:13,884 INFO L87 Difference]: Start difference. First operand 754 states and 1161 transitions. Second operand 4 states. [2019-10-15 01:10:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,942 INFO L93 Difference]: Finished difference Result 1450 states and 2256 transitions. [2019-10-15 01:10:13,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:13,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-15 01:10:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,949 INFO L225 Difference]: With dead ends: 1450 [2019-10-15 01:10:13,949 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:13,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1160 transitions. [2019-10-15 01:10:13,986 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1160 transitions. Word has length 126 [2019-10-15 01:10:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,986 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1160 transitions. [2019-10-15 01:10:13,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1160 transitions. [2019-10-15 01:10:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:10:13,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,989 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:13,989 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash 218267130, now seen corresponding path program 1 times [2019-10-15 01:10:13,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411254232] [2019-10-15 01:10:13,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:14,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411254232] [2019-10-15 01:10:14,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:14,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707781363] [2019-10-15 01:10:14,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:14,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:14,214 INFO L87 Difference]: Start difference. First operand 754 states and 1160 transitions. Second operand 4 states. [2019-10-15 01:10:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,280 INFO L93 Difference]: Finished difference Result 1450 states and 2255 transitions. [2019-10-15 01:10:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:14,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-15 01:10:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,288 INFO L225 Difference]: With dead ends: 1450 [2019-10-15 01:10:14,289 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:10:14,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:10:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:10:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:10:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1159 transitions. [2019-10-15 01:10:14,324 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1159 transitions. Word has length 127 [2019-10-15 01:10:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,325 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1159 transitions. [2019-10-15 01:10:14,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1159 transitions. [2019-10-15 01:10:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:10:14,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,328 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:14,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash 117355163, now seen corresponding path program 1 times [2019-10-15 01:10:14,329 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:14,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081361016] [2019-10-15 01:10:14,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:14,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081361016] [2019-10-15 01:10:14,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:14,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344523279] [2019-10-15 01:10:14,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:14,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:14,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:14,523 INFO L87 Difference]: Start difference. First operand 754 states and 1159 transitions. Second operand 9 states. [2019-10-15 01:10:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,932 INFO L93 Difference]: Finished difference Result 1402 states and 2167 transitions. [2019-10-15 01:10:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:10:14,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-10-15 01:10:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,941 INFO L225 Difference]: With dead ends: 1402 [2019-10-15 01:10:14,941 INFO L226 Difference]: Without dead ends: 748 [2019-10-15 01:10:14,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-15 01:10:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-15 01:10:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 01:10:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1146 transitions. [2019-10-15 01:10:14,985 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1146 transitions. Word has length 127 [2019-10-15 01:10:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,986 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1146 transitions. [2019-10-15 01:10:14,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1146 transitions. [2019-10-15 01:10:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:10:14,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,989 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:14,989 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1586108187, now seen corresponding path program 1 times [2019-10-15 01:10:14,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:14,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950945680] [2019-10-15 01:10:14,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:15,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950945680] [2019-10-15 01:10:15,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:15,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:15,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248685810] [2019-10-15 01:10:15,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:15,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:15,146 INFO L87 Difference]: Start difference. First operand 748 states and 1146 transitions. Second operand 6 states. [2019-10-15 01:10:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:15,460 INFO L93 Difference]: Finished difference Result 1396 states and 2154 transitions. [2019-10-15 01:10:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:15,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-15 01:10:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:15,466 INFO L225 Difference]: With dead ends: 1396 [2019-10-15 01:10:15,466 INFO L226 Difference]: Without dead ends: 748 [2019-10-15 01:10:15,470 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-15 01:10:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-15 01:10:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-15 01:10:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 01:10:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1142 transitions. [2019-10-15 01:10:15,502 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1142 transitions. Word has length 128 [2019-10-15 01:10:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:15,503 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1142 transitions. [2019-10-15 01:10:15,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1142 transitions. [2019-10-15 01:10:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:10:15,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:15,506 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:15,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1697144642, now seen corresponding path program 1 times [2019-10-15 01:10:15,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371795146] [2019-10-15 01:10:15,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:15,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371795146] [2019-10-15 01:10:15,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:15,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:15,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586701083] [2019-10-15 01:10:15,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:15,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:15,644 INFO L87 Difference]: Start difference. First operand 748 states and 1142 transitions. Second operand 6 states. [2019-10-15 01:10:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:15,848 INFO L93 Difference]: Finished difference Result 1396 states and 2150 transitions. [2019-10-15 01:10:15,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:15,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-15 01:10:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:15,854 INFO L225 Difference]: With dead ends: 1396 [2019-10-15 01:10:15,855 INFO L226 Difference]: Without dead ends: 748 [2019-10-15 01:10:15,859 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-15 01:10:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-15 01:10:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-15 01:10:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 01:10:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1138 transitions. [2019-10-15 01:10:15,887 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1138 transitions. Word has length 129 [2019-10-15 01:10:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:15,888 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1138 transitions. [2019-10-15 01:10:15,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1138 transitions. [2019-10-15 01:10:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:10:15,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:15,892 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:15,892 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1882039414, now seen corresponding path program 1 times [2019-10-15 01:10:15,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151114201] [2019-10-15 01:10:15,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:16,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151114201] [2019-10-15 01:10:16,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:16,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273709478] [2019-10-15 01:10:16,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:16,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:16,022 INFO L87 Difference]: Start difference. First operand 748 states and 1138 transitions. Second operand 6 states. [2019-10-15 01:10:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:16,250 INFO L93 Difference]: Finished difference Result 1396 states and 2146 transitions. [2019-10-15 01:10:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:16,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-15 01:10:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:16,257 INFO L225 Difference]: With dead ends: 1396 [2019-10-15 01:10:16,257 INFO L226 Difference]: Without dead ends: 748 [2019-10-15 01:10:16,261 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-15 01:10:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-15 01:10:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-15 01:10:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 01:10:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1134 transitions. [2019-10-15 01:10:16,297 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1134 transitions. Word has length 130 [2019-10-15 01:10:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:16,298 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1134 transitions. [2019-10-15 01:10:16,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1134 transitions. [2019-10-15 01:10:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:10:16,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:16,302 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:16,302 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1517623306, now seen corresponding path program 1 times [2019-10-15 01:10:16,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:16,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28682217] [2019-10-15 01:10:16,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:16,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28682217] [2019-10-15 01:10:16,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:16,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287730002] [2019-10-15 01:10:16,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:16,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:16,597 INFO L87 Difference]: Start difference. First operand 748 states and 1134 transitions. Second operand 7 states. [2019-10-15 01:10:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:16,739 INFO L93 Difference]: Finished difference Result 1396 states and 2142 transitions. [2019-10-15 01:10:16,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:16,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-15 01:10:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:16,748 INFO L225 Difference]: With dead ends: 1396 [2019-10-15 01:10:16,749 INFO L226 Difference]: Without dead ends: 727 [2019-10-15 01:10:16,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-15 01:10:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-15 01:10:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-15 01:10:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1100 transitions. [2019-10-15 01:10:16,794 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1100 transitions. Word has length 130 [2019-10-15 01:10:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:16,795 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1100 transitions. [2019-10-15 01:10:16,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1100 transitions. [2019-10-15 01:10:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:10:16,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:16,800 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:16,800 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash -61574717, now seen corresponding path program 1 times [2019-10-15 01:10:16,801 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:16,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892679632] [2019-10-15 01:10:16,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:17,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892679632] [2019-10-15 01:10:17,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:17,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:17,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165162523] [2019-10-15 01:10:17,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:17,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:17,026 INFO L87 Difference]: Start difference. First operand 727 states and 1100 transitions. Second operand 6 states. [2019-10-15 01:10:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,179 INFO L93 Difference]: Finished difference Result 1375 states and 2108 transitions. [2019-10-15 01:10:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:17,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-15 01:10:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,187 INFO L225 Difference]: With dead ends: 1375 [2019-10-15 01:10:17,187 INFO L226 Difference]: Without dead ends: 727 [2019-10-15 01:10:17,191 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-15 01:10:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-15 01:10:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-15 01:10:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-15 01:10:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1099 transitions. [2019-10-15 01:10:17,221 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1099 transitions. Word has length 131 [2019-10-15 01:10:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:17,221 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1099 transitions. [2019-10-15 01:10:17,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1099 transitions. [2019-10-15 01:10:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:10:17,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:17,224 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:17,225 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -499475921, now seen corresponding path program 1 times [2019-10-15 01:10:17,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:17,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344361542] [2019-10-15 01:10:17,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:17,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344361542] [2019-10-15 01:10:17,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:17,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:17,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39032189] [2019-10-15 01:10:17,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:17,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:17,369 INFO L87 Difference]: Start difference. First operand 727 states and 1099 transitions. Second operand 6 states. [2019-10-15 01:10:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,481 INFO L93 Difference]: Finished difference Result 1375 states and 2107 transitions. [2019-10-15 01:10:17,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:17,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-15 01:10:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,487 INFO L225 Difference]: With dead ends: 1375 [2019-10-15 01:10:17,487 INFO L226 Difference]: Without dead ends: 727 [2019-10-15 01:10:17,491 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-15 01:10:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-15 01:10:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-15 01:10:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-15 01:10:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1098 transitions. [2019-10-15 01:10:17,516 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1098 transitions. Word has length 132 [2019-10-15 01:10:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:17,517 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1098 transitions. [2019-10-15 01:10:17,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1098 transitions. [2019-10-15 01:10:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:10:17,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:17,520 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:17,520 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2067723976, now seen corresponding path program 1 times [2019-10-15 01:10:17,521 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:17,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277000218] [2019-10-15 01:10:17,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:17,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277000218] [2019-10-15 01:10:17,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:17,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:10:17,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486718693] [2019-10-15 01:10:17,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:10:17,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:10:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:17,729 INFO L87 Difference]: Start difference. First operand 727 states and 1098 transitions. Second operand 11 states. [2019-10-15 01:10:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:18,447 INFO L93 Difference]: Finished difference Result 1376 states and 2106 transitions. [2019-10-15 01:10:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:18,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2019-10-15 01:10:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:18,456 INFO L225 Difference]: With dead ends: 1376 [2019-10-15 01:10:18,457 INFO L226 Difference]: Without dead ends: 727 [2019-10-15 01:10:18,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-15 01:10:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-15 01:10:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-15 01:10:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1097 transitions. [2019-10-15 01:10:18,500 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1097 transitions. Word has length 133 [2019-10-15 01:10:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:18,501 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1097 transitions. [2019-10-15 01:10:18,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:10:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1097 transitions. [2019-10-15 01:10:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:10:18,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:18,506 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:18,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1980443808, now seen corresponding path program 1 times [2019-10-15 01:10:18,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:18,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056936699] [2019-10-15 01:10:18,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:18,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:18,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:18,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056936699] [2019-10-15 01:10:18,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:18,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:18,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564973697] [2019-10-15 01:10:18,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:18,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:18,693 INFO L87 Difference]: Start difference. First operand 727 states and 1097 transitions. Second operand 4 states. [2019-10-15 01:10:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:19,884 INFO L93 Difference]: Finished difference Result 2040 states and 3133 transitions. [2019-10-15 01:10:19,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:19,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-15 01:10:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:19,895 INFO L225 Difference]: With dead ends: 2040 [2019-10-15 01:10:19,895 INFO L226 Difference]: Without dead ends: 1400 [2019-10-15 01:10:19,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-10-15 01:10:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1387. [2019-10-15 01:10:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-10-15 01:10:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2107 transitions. [2019-10-15 01:10:19,977 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2107 transitions. Word has length 134 [2019-10-15 01:10:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:19,979 INFO L462 AbstractCegarLoop]: Abstraction has 1387 states and 2107 transitions. [2019-10-15 01:10:19,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2107 transitions. [2019-10-15 01:10:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:10:19,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:19,982 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:19,983 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:19,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1183400857, now seen corresponding path program 1 times [2019-10-15 01:10:19,983 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:19,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224637609] [2019-10-15 01:10:19,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:19,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:20,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224637609] [2019-10-15 01:10:20,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:20,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:20,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836637877] [2019-10-15 01:10:20,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:20,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:20,279 INFO L87 Difference]: Start difference. First operand 1387 states and 2107 transitions. Second operand 6 states. [2019-10-15 01:10:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:25,120 INFO L93 Difference]: Finished difference Result 3471 states and 5469 transitions. [2019-10-15 01:10:25,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:25,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-15 01:10:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:25,161 INFO L225 Difference]: With dead ends: 3471 [2019-10-15 01:10:25,162 INFO L226 Difference]: Without dead ends: 2838 [2019-10-15 01:10:25,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-10-15 01:10:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2789. [2019-10-15 01:10:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-10-15 01:10:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4412 transitions. [2019-10-15 01:10:25,365 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4412 transitions. Word has length 135 [2019-10-15 01:10:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:25,366 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 4412 transitions. [2019-10-15 01:10:25,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4412 transitions. [2019-10-15 01:10:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-15 01:10:25,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:25,381 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:25,381 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -185210926, now seen corresponding path program 1 times [2019-10-15 01:10:25,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:25,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131447915] [2019-10-15 01:10:25,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:25,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:25,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:25,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131447915] [2019-10-15 01:10:25,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:25,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:25,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852343701] [2019-10-15 01:10:25,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:25,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:25,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:25,642 INFO L87 Difference]: Start difference. First operand 2789 states and 4412 transitions. Second operand 9 states. [2019-10-15 01:10:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:30,662 INFO L93 Difference]: Finished difference Result 5459 states and 8816 transitions. [2019-10-15 01:10:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:10:30,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-10-15 01:10:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:30,682 INFO L225 Difference]: With dead ends: 5459 [2019-10-15 01:10:30,682 INFO L226 Difference]: Without dead ends: 2813 [2019-10-15 01:10:30,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-10-15 01:10:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2805. [2019-10-15 01:10:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-10-15 01:10:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4492 transitions. [2019-10-15 01:10:30,843 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4492 transitions. Word has length 180 [2019-10-15 01:10:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:30,844 INFO L462 AbstractCegarLoop]: Abstraction has 2805 states and 4492 transitions. [2019-10-15 01:10:30,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4492 transitions. [2019-10-15 01:10:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-15 01:10:30,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:30,855 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:30,855 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 748218603, now seen corresponding path program 1 times [2019-10-15 01:10:30,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:30,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072471282] [2019-10-15 01:10:30,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:30,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:30,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:31,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072471282] [2019-10-15 01:10:31,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:31,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:10:31,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646048131] [2019-10-15 01:10:31,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:10:31,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:10:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:31,131 INFO L87 Difference]: Start difference. First operand 2805 states and 4492 transitions. Second operand 8 states.