java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:38,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:38,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:38,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:38,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:38,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:38,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:38,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:38,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:38,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:38,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:38,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:38,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:38,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:38,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:38,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:38,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:38,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:38,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:38,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:38,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:38,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:38,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:38,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:38,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:38,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:38,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:38,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:38,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:38,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:38,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:38,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:38,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:38,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:38,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:38,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:38,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:38,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:38,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:38,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:38,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:38,811 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:38,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:38,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:38,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:38,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:38,832 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:38,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:38,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:38,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:38,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:38,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:38,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:38,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:38,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:38,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:38,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:38,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:38,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:38,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:38,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:38,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:38,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:38,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:38,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:38,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:38,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:38,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:38,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:38,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:38,836 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:39,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:39,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:39,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:39,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:39,128 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:39,128 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c [2019-10-15 01:10:39,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617db9565/bf032aaa12544846b4ffafe166caf56a/FLAG4dd34c6e9 [2019-10-15 01:10:39,785 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:39,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c [2019-10-15 01:10:39,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617db9565/bf032aaa12544846b4ffafe166caf56a/FLAG4dd34c6e9 [2019-10-15 01:10:40,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/617db9565/bf032aaa12544846b4ffafe166caf56a [2019-10-15 01:10:40,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:40,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:40,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:40,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:40,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:40,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:40" (1/1) ... [2019-10-15 01:10:40,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5cac2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:40, skipping insertion in model container [2019-10-15 01:10:40,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:40" (1/1) ... [2019-10-15 01:10:40,040 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:40,128 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:40,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:40,833 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:40,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:41,036 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:41,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41 WrapperNode [2019-10-15 01:10:41,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:41,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:41,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:41,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:41,051 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:41" (1/1) ... [2019-10-15 01:10:41,051 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:41" (1/1) ... [2019-10-15 01:10:41,084 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:41" (1/1) ... [2019-10-15 01:10:41,084 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:41" (1/1) ... [2019-10-15 01:10:41,162 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:41" (1/1) ... [2019-10-15 01:10:41,215 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:41" (1/1) ... [2019-10-15 01:10:41,237 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:41" (1/1) ... [2019-10-15 01:10:41,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:41,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:41,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:41,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:41,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (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:41,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:41,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:41,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:41,340 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:41,343 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:41,343 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:41,344 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:41,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:10:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:10:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:10:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:10:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:41,347 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:41,348 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:41,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:10:41,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:10:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:41,349 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:41,350 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:41,350 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:41,350 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:41,350 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:41,350 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:41,352 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:41,353 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:41,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:41,353 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:41,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:41,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:41,355 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:41,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:41,355 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:41,356 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:41,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:41,356 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:41,356 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:41,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:10:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:10:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:10:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:10:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:10:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:10:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:43,639 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:43,639 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:43,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:43 BoogieIcfgContainer [2019-10-15 01:10:43,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:43,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:43,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:43,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:43,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:40" (1/3) ... [2019-10-15 01:10:43,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579b0193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:43, skipping insertion in model container [2019-10-15 01:10:43,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (2/3) ... [2019-10-15 01:10:43,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579b0193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:43, skipping insertion in model container [2019-10-15 01:10:43,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:43" (3/3) ... [2019-10-15 01:10:43,650 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2019-10-15 01:10:43,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:43,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:43,681 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:43,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:43,726 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:43,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:43,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:43,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:43,727 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:43,727 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:43,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states. [2019-10-15 01:10:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:10:43,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:43,808 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:43,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1013618199, now seen corresponding path program 1 times [2019-10-15 01:10:43,823 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:43,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030363086] [2019-10-15 01:10:43,824 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,824 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:44,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030363086] [2019-10-15 01:10:44,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:44,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:44,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806463217] [2019-10-15 01:10:44,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:44,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:44,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:44,626 INFO L87 Difference]: Start difference. First operand 821 states. Second operand 7 states. [2019-10-15 01:10:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:44,902 INFO L93 Difference]: Finished difference Result 1321 states and 2120 transitions. [2019-10-15 01:10:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:44,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-15 01:10:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:44,935 INFO L225 Difference]: With dead ends: 1321 [2019-10-15 01:10:44,935 INFO L226 Difference]: Without dead ends: 669 [2019-10-15 01:10:44,950 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:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-15 01:10:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2019-10-15 01:10:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-15 01:10:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1055 transitions. [2019-10-15 01:10:45,125 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1055 transitions. Word has length 141 [2019-10-15 01:10:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:45,125 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 1055 transitions. [2019-10-15 01:10:45,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1055 transitions. [2019-10-15 01:10:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:10:45,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:45,145 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:45,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1339739785, now seen corresponding path program 1 times [2019-10-15 01:10:45,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:45,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361766671] [2019-10-15 01:10:45,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:45,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:45,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:45,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361766671] [2019-10-15 01:10:45,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:45,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:45,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284323325] [2019-10-15 01:10:45,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:45,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:45,508 INFO L87 Difference]: Start difference. First operand 667 states and 1055 transitions. Second operand 4 states. [2019-10-15 01:10:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:45,632 INFO L93 Difference]: Finished difference Result 1300 states and 2075 transitions. [2019-10-15 01:10:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:45,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-15 01:10:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:45,639 INFO L225 Difference]: With dead ends: 1300 [2019-10-15 01:10:45,640 INFO L226 Difference]: Without dead ends: 649 [2019-10-15 01:10:45,644 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:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-15 01:10:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2019-10-15 01:10:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-15 01:10:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1022 transitions. [2019-10-15 01:10:45,682 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1022 transitions. Word has length 142 [2019-10-15 01:10:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:45,684 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 1022 transitions. [2019-10-15 01:10:45,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1022 transitions. [2019-10-15 01:10:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:10:45,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:45,699 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:45,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash -415526825, now seen corresponding path program 1 times [2019-10-15 01:10:45,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:45,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617604538] [2019-10-15 01:10:45,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:45,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:45,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:45,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617604538] [2019-10-15 01:10:45,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:45,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:45,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720456349] [2019-10-15 01:10:45,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:45,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:45,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:45,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:45,924 INFO L87 Difference]: Start difference. First operand 649 states and 1022 transitions. Second operand 7 states. [2019-10-15 01:10:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:46,065 INFO L93 Difference]: Finished difference Result 1269 states and 2017 transitions. [2019-10-15 01:10:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:46,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-15 01:10:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:46,072 INFO L225 Difference]: With dead ends: 1269 [2019-10-15 01:10:46,072 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:10:46,076 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:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:10:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:10:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:10:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1009 transitions. [2019-10-15 01:10:46,111 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1009 transitions. Word has length 142 [2019-10-15 01:10:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:46,112 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1009 transitions. [2019-10-15 01:10:46,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1009 transitions. [2019-10-15 01:10:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:10:46,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:46,118 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,118 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -390482629, now seen corresponding path program 1 times [2019-10-15 01:10:46,119 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698235698] [2019-10-15 01:10:46,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:46,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698235698] [2019-10-15 01:10:46,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:46,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:46,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389163167] [2019-10-15 01:10:46,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:46,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:46,299 INFO L87 Difference]: Start difference. First operand 643 states and 1009 transitions. Second operand 7 states. [2019-10-15 01:10:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:46,411 INFO L93 Difference]: Finished difference Result 1257 states and 1991 transitions. [2019-10-15 01:10:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:46,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:10:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:46,420 INFO L225 Difference]: With dead ends: 1257 [2019-10-15 01:10:46,420 INFO L226 Difference]: Without dead ends: 637 [2019-10-15 01:10:46,426 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:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-15 01:10:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-15 01:10:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-15 01:10:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 996 transitions. [2019-10-15 01:10:46,455 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 996 transitions. Word has length 143 [2019-10-15 01:10:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:46,455 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 996 transitions. [2019-10-15 01:10:46,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 996 transitions. [2019-10-15 01:10:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:10:46,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:46,461 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1764754427, now seen corresponding path program 1 times [2019-10-15 01:10:46,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43651291] [2019-10-15 01:10:46,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:46,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43651291] [2019-10-15 01:10:46,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:46,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:46,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797926123] [2019-10-15 01:10:46,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:46,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:46,679 INFO L87 Difference]: Start difference. First operand 637 states and 996 transitions. Second operand 7 states. [2019-10-15 01:10:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:46,768 INFO L93 Difference]: Finished difference Result 1245 states and 1965 transitions. [2019-10-15 01:10:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:46,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-15 01:10:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:46,773 INFO L225 Difference]: With dead ends: 1245 [2019-10-15 01:10:46,774 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:46,777 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:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 983 transitions. [2019-10-15 01:10:46,800 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 983 transitions. Word has length 144 [2019-10-15 01:10:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:46,801 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 983 transitions. [2019-10-15 01:10:46,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 983 transitions. [2019-10-15 01:10:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:10:46,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:46,805 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,806 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 525807612, now seen corresponding path program 1 times [2019-10-15 01:10:46,806 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083164276] [2019-10-15 01:10:46,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:46,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083164276] [2019-10-15 01:10:46,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:46,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:46,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700766973] [2019-10-15 01:10:46,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:46,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:46,968 INFO L87 Difference]: Start difference. First operand 631 states and 983 transitions. Second operand 7 states. [2019-10-15 01:10:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,077 INFO L93 Difference]: Finished difference Result 1233 states and 1939 transitions. [2019-10-15 01:10:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:47,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-15 01:10:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,083 INFO L225 Difference]: With dead ends: 1233 [2019-10-15 01:10:47,084 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:47,087 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:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 982 transitions. [2019-10-15 01:10:47,115 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 982 transitions. Word has length 144 [2019-10-15 01:10:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:47,116 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 982 transitions. [2019-10-15 01:10:47,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 982 transitions. [2019-10-15 01:10:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:10:47,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,122 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1236493407, now seen corresponding path program 1 times [2019-10-15 01:10:47,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871409526] [2019-10-15 01:10:47,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:47,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871409526] [2019-10-15 01:10:47,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:47,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899618463] [2019-10-15 01:10:47,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:47,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:47,342 INFO L87 Difference]: Start difference. First operand 631 states and 982 transitions. Second operand 5 states. [2019-10-15 01:10:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,413 INFO L93 Difference]: Finished difference Result 1232 states and 1936 transitions. [2019-10-15 01:10:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:47,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-15 01:10:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,419 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:10:47,419 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:47,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 981 transitions. [2019-10-15 01:10:47,448 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 981 transitions. Word has length 145 [2019-10-15 01:10:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:47,448 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 981 transitions. [2019-10-15 01:10:47,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 981 transitions. [2019-10-15 01:10:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:10:47,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,453 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1973263729, now seen corresponding path program 1 times [2019-10-15 01:10:47,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624482485] [2019-10-15 01:10:47,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:47,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624482485] [2019-10-15 01:10:47,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:47,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690202294] [2019-10-15 01:10:47,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:47,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:47,592 INFO L87 Difference]: Start difference. First operand 631 states and 981 transitions. Second operand 5 states. [2019-10-15 01:10:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,660 INFO L93 Difference]: Finished difference Result 1232 states and 1934 transitions. [2019-10-15 01:10:47,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:47,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-15 01:10:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,668 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:10:47,668 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:47,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 980 transitions. [2019-10-15 01:10:47,706 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 980 transitions. Word has length 146 [2019-10-15 01:10:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:47,706 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 980 transitions. [2019-10-15 01:10:47,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 980 transitions. [2019-10-15 01:10:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:10:47,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,714 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,714 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 696479226, now seen corresponding path program 1 times [2019-10-15 01:10:47,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106972258] [2019-10-15 01:10:47,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:47,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106972258] [2019-10-15 01:10:47,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:47,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656490948] [2019-10-15 01:10:47,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:47,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:47,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:47,859 INFO L87 Difference]: Start difference. First operand 631 states and 980 transitions. Second operand 5 states. [2019-10-15 01:10:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,954 INFO L93 Difference]: Finished difference Result 1232 states and 1932 transitions. [2019-10-15 01:10:47,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:47,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:10:47,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,961 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:10:47,962 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:47,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 979 transitions. [2019-10-15 01:10:48,000 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 979 transitions. Word has length 147 [2019-10-15 01:10:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,000 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 979 transitions. [2019-10-15 01:10:48,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 979 transitions. [2019-10-15 01:10:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:10:48,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,007 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,007 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1424004588, now seen corresponding path program 1 times [2019-10-15 01:10:48,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559888639] [2019-10-15 01:10:48,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:48,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559888639] [2019-10-15 01:10:48,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:48,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:48,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713682450] [2019-10-15 01:10:48,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:48,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:48,284 INFO L87 Difference]: Start difference. First operand 631 states and 979 transitions. Second operand 5 states. [2019-10-15 01:10:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,369 INFO L93 Difference]: Finished difference Result 1232 states and 1930 transitions. [2019-10-15 01:10:48,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:48,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-15 01:10:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,377 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:10:48,377 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:48,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 978 transitions. [2019-10-15 01:10:48,404 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 978 transitions. Word has length 148 [2019-10-15 01:10:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,404 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 978 transitions. [2019-10-15 01:10:48,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 978 transitions. [2019-10-15 01:10:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:10:48,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,411 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,412 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash -139373675, now seen corresponding path program 1 times [2019-10-15 01:10:48,413 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735717661] [2019-10-15 01:10:48,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:48,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735717661] [2019-10-15 01:10:48,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254645532] [2019-10-15 01:10:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:49,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:49,432 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:49,579 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:49,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-15 01:10:49,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410972394] [2019-10-15 01:10:49,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:49,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:49,581 INFO L87 Difference]: Start difference. First operand 631 states and 978 transitions. Second operand 3 states. [2019-10-15 01:10:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,669 INFO L93 Difference]: Finished difference Result 1772 states and 2794 transitions. [2019-10-15 01:10:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:49,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:10:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,681 INFO L225 Difference]: With dead ends: 1772 [2019-10-15 01:10:49,682 INFO L226 Difference]: Without dead ends: 1175 [2019-10-15 01:10:49,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-15 01:10:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1162. [2019-10-15 01:10:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-10-15 01:10:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1819 transitions. [2019-10-15 01:10:49,762 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1819 transitions. Word has length 149 [2019-10-15 01:10:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,765 INFO L462 AbstractCegarLoop]: Abstraction has 1162 states and 1819 transitions. [2019-10-15 01:10:49,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1819 transitions. [2019-10-15 01:10:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:10:49,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,772 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:49,981 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1718123778, now seen corresponding path program 1 times [2019-10-15 01:10:49,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313521524] [2019-10-15 01:10:49,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:50,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313521524] [2019-10-15 01:10:50,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:50,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:50,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917044879] [2019-10-15 01:10:50,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:50,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:50,162 INFO L87 Difference]: Start difference. First operand 1162 states and 1819 transitions. Second operand 7 states. [2019-10-15 01:10:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:52,929 INFO L93 Difference]: Finished difference Result 3412 states and 5478 transitions. [2019-10-15 01:10:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:52,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-15 01:10:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:52,947 INFO L225 Difference]: With dead ends: 3412 [2019-10-15 01:10:52,947 INFO L226 Difference]: Without dead ends: 2284 [2019-10-15 01:10:52,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-10-15 01:10:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2218. [2019-10-15 01:10:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-10-15 01:10:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3531 transitions. [2019-10-15 01:10:53,058 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3531 transitions. Word has length 153 [2019-10-15 01:10:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:53,059 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 3531 transitions. [2019-10-15 01:10:53,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3531 transitions. [2019-10-15 01:10:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:10:53,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:53,065 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,065 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 933622094, now seen corresponding path program 1 times [2019-10-15 01:10:53,066 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:53,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814238043] [2019-10-15 01:10:53,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:53,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:53,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:53,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814238043] [2019-10-15 01:10:53,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731465416] [2019-10-15 01:10:53,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:53,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 3089 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:53,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:53,980 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:54,108 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:54,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-15 01:10:54,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937381808] [2019-10-15 01:10:54,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:54,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:54,110 INFO L87 Difference]: Start difference. First operand 2218 states and 3531 transitions. Second operand 4 states. [2019-10-15 01:10:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:54,236 INFO L93 Difference]: Finished difference Result 4466 states and 7183 transitions. [2019-10-15 01:10:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:54,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:10:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:54,254 INFO L225 Difference]: With dead ends: 4466 [2019-10-15 01:10:54,254 INFO L226 Difference]: Without dead ends: 2282 [2019-10-15 01:10:54,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-10-15 01:10:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2240. [2019-10-15 01:10:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2019-10-15 01:10:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3559 transitions. [2019-10-15 01:10:54,360 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3559 transitions. Word has length 154 [2019-10-15 01:10:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:54,361 INFO L462 AbstractCegarLoop]: Abstraction has 2240 states and 3559 transitions. [2019-10-15 01:10:54,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3559 transitions. [2019-10-15 01:10:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:10:54,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:54,366 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:54,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:54,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1569287416, now seen corresponding path program 1 times [2019-10-15 01:10:54,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:54,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9297122] [2019-10-15 01:10:54,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:54,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:54,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:54,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9297122] [2019-10-15 01:10:54,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136588424] [2019-10-15 01:10:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:55,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 3070 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:55,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:55,475 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:55,578 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:55,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-15 01:10:55,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93250820] [2019-10-15 01:10:55,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:55,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:55,580 INFO L87 Difference]: Start difference. First operand 2240 states and 3559 transitions. Second operand 3 states. [2019-10-15 01:10:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:55,716 INFO L93 Difference]: Finished difference Result 5516 states and 8850 transitions. [2019-10-15 01:10:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:55,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:10:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:55,741 INFO L225 Difference]: With dead ends: 5516 [2019-10-15 01:10:55,742 INFO L226 Difference]: Without dead ends: 3310 [2019-10-15 01:10:55,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-10-15 01:10:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3210. [2019-10-15 01:10:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3210 states. [2019-10-15 01:10:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 5119 transitions. [2019-10-15 01:10:55,905 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 5119 transitions. Word has length 150 [2019-10-15 01:10:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:55,905 INFO L462 AbstractCegarLoop]: Abstraction has 3210 states and 5119 transitions. [2019-10-15 01:10:55,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 5119 transitions. [2019-10-15 01:10:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:10:55,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:55,914 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:56,124 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1132378497, now seen corresponding path program 1 times [2019-10-15 01:10:56,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:56,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012153322] [2019-10-15 01:10:56,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:10:56,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012153322] [2019-10-15 01:10:56,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:56,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:56,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568039480] [2019-10-15 01:10:56,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:56,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:56,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:56,267 INFO L87 Difference]: Start difference. First operand 3210 states and 5119 transitions. Second operand 4 states. [2019-10-15 01:10:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:56,475 INFO L93 Difference]: Finished difference Result 6380 states and 10251 transitions. [2019-10-15 01:10:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:56,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-15 01:10:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:56,544 INFO L225 Difference]: With dead ends: 6380 [2019-10-15 01:10:56,545 INFO L226 Difference]: Without dead ends: 3204 [2019-10-15 01:10:56,567 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:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2019-10-15 01:10:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3194. [2019-10-15 01:10:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-10-15 01:10:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 5067 transitions. [2019-10-15 01:10:56,698 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 5067 transitions. Word has length 153 [2019-10-15 01:10:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:56,698 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 5067 transitions. [2019-10-15 01:10:56,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 5067 transitions. [2019-10-15 01:10:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:10:56,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:56,705 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,706 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -940798830, now seen corresponding path program 1 times [2019-10-15 01:10:56,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:56,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488455033] [2019-10-15 01:10:56,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:10:56,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488455033] [2019-10-15 01:10:56,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348901564] [2019-10-15 01:10:56,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:57,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 3089 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:10:57,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:57,562 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:57,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:10:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:57,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:57,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-15 01:10:57,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551376840] [2019-10-15 01:10:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:57,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:57,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:57,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:10:57,840 INFO L87 Difference]: Start difference. First operand 3194 states and 5067 transitions. Second operand 6 states. [2019-10-15 01:10:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:59,126 INFO L93 Difference]: Finished difference Result 8645 states and 13879 transitions. [2019-10-15 01:10:59,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:59,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-15 01:10:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:59,176 INFO L225 Difference]: With dead ends: 8645 [2019-10-15 01:10:59,177 INFO L226 Difference]: Without dead ends: 5485 [2019-10-15 01:10:59,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:10:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2019-10-15 01:10:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5445. [2019-10-15 01:10:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5445 states. [2019-10-15 01:10:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 8508 transitions. [2019-10-15 01:10:59,468 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 8508 transitions. Word has length 153 [2019-10-15 01:10:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:59,470 INFO L462 AbstractCegarLoop]: Abstraction has 5445 states and 8508 transitions. [2019-10-15 01:10:59,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 8508 transitions. [2019-10-15 01:10:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:10:59,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:59,479 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:59,697 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash -888969153, now seen corresponding path program 1 times [2019-10-15 01:10:59,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:59,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064192848] [2019-10-15 01:10:59,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:59,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:59,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:10:59,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064192848] [2019-10-15 01:10:59,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:59,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:59,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43898984] [2019-10-15 01:10:59,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:59,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:59,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:59,836 INFO L87 Difference]: Start difference. First operand 5445 states and 8508 transitions. Second operand 7 states. [2019-10-15 01:11:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:02,659 INFO L93 Difference]: Finished difference Result 16236 states and 26000 transitions. [2019-10-15 01:11:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:02,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-15 01:11:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:02,719 INFO L225 Difference]: With dead ends: 16236 [2019-10-15 01:11:02,719 INFO L226 Difference]: Without dead ends: 10825 [2019-10-15 01:11:02,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10825 states. [2019-10-15 01:11:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10825 to 10741. [2019-10-15 01:11:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10741 states. [2019-10-15 01:11:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 16957 transitions. [2019-10-15 01:11:03,173 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 16957 transitions. Word has length 161 [2019-10-15 01:11:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:03,174 INFO L462 AbstractCegarLoop]: Abstraction has 10741 states and 16957 transitions. [2019-10-15 01:11:03,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 16957 transitions. [2019-10-15 01:11:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:11:03,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:03,180 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:03,180 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:03,180 INFO L82 PathProgramCache]: Analyzing trace with hash 855105821, now seen corresponding path program 1 times [2019-10-15 01:11:03,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:03,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382725572] [2019-10-15 01:11:03,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:11:03,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382725572] [2019-10-15 01:11:03,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:03,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:03,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105576966] [2019-10-15 01:11:03,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:03,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:03,295 INFO L87 Difference]: Start difference. First operand 10741 states and 16957 transitions. Second operand 4 states. [2019-10-15 01:11:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:03,617 INFO L93 Difference]: Finished difference Result 21486 states and 34201 transitions. [2019-10-15 01:11:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:03,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-15 01:11:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:03,686 INFO L225 Difference]: With dead ends: 21486 [2019-10-15 01:11:03,687 INFO L226 Difference]: Without dead ends: 10776 [2019-10-15 01:11:03,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2019-10-15 01:11:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 10744. [2019-10-15 01:11:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-10-15 01:11:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 16921 transitions. [2019-10-15 01:11:04,864 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 16921 transitions. Word has length 162 [2019-10-15 01:11:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:04,865 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 16921 transitions. [2019-10-15 01:11:04,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 16921 transitions. [2019-10-15 01:11:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-15 01:11:04,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:04,872 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:04,872 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -534209603, now seen corresponding path program 1 times [2019-10-15 01:11:04,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:04,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62093085] [2019-10-15 01:11:04,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:04,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:04,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-15 01:11:05,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62093085] [2019-10-15 01:11:05,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540414356] [2019-10-15 01:11:05,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:05,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 3561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:05,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-15 01:11:05,715 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-15 01:11:06,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:11:06,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 3] total 13 [2019-10-15 01:11:06,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754534284] [2019-10-15 01:11:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:06,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:06,009 INFO L87 Difference]: Start difference. First operand 10744 states and 16921 transitions. Second operand 3 states. [2019-10-15 01:11:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:06,407 INFO L93 Difference]: Finished difference Result 31834 states and 50584 transitions. [2019-10-15 01:11:06,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:06,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-10-15 01:11:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:06,569 INFO L225 Difference]: With dead ends: 31834 [2019-10-15 01:11:06,570 INFO L226 Difference]: Without dead ends: 21131 [2019-10-15 01:11:06,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21131 states. [2019-10-15 01:11:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21131 to 20959. [2019-10-15 01:11:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20959 states. [2019-10-15 01:11:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20959 states to 20959 states and 33118 transitions. [2019-10-15 01:11:07,464 INFO L78 Accepts]: Start accepts. Automaton has 20959 states and 33118 transitions. Word has length 256 [2019-10-15 01:11:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:07,465 INFO L462 AbstractCegarLoop]: Abstraction has 20959 states and 33118 transitions. [2019-10-15 01:11:07,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 20959 states and 33118 transitions. [2019-10-15 01:11:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-15 01:11:07,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:07,473 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:07,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:07,681 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash -124170817, now seen corresponding path program 1 times [2019-10-15 01:11:07,682 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:07,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553353937] [2019-10-15 01:11:07,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:07,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:07,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:11:07,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553353937] [2019-10-15 01:11:07,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:07,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:07,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342542262] [2019-10-15 01:11:07,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:07,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:07,872 INFO L87 Difference]: Start difference. First operand 20959 states and 33118 transitions. Second operand 7 states.