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_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:34,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:34,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:34,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:34,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:34,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:34,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:34,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:34,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:34,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:34,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:34,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:34,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:34,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:34,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:34,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:34,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:34,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:34,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:34,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:34,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:34,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:34,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:34,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:34,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:34,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:34,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:34,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:34,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:34,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:34,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:34,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:34,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:34,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:34,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:34,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:34,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:34,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:34,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:34,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:34,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:34,767 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:34,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:34,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:34,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:34,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:34,788 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:34,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:34,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:34,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:34,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:34,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:34,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:34,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:34,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:34,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:34,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:34,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:34,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:34,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:34,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:34,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:34,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:34,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:34,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:34,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:34,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:34,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:34,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:34,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:34,797 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:35,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:35,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:35,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:35,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:35,079 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:35,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c [2019-10-15 01:10:35,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcd0af58/5a7e9911890b4ea398e7b6fa7ceb7568/FLAG6eb172d6f [2019-10-15 01:10:35,837 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:35,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c [2019-10-15 01:10:35,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcd0af58/5a7e9911890b4ea398e7b6fa7ceb7568/FLAG6eb172d6f [2019-10-15 01:10:36,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcd0af58/5a7e9911890b4ea398e7b6fa7ceb7568 [2019-10-15 01:10:36,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:36,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:36,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:36,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:36,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:36,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:36" (1/1) ... [2019-10-15 01:10:36,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9fe496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:36, skipping insertion in model container [2019-10-15 01:10:36,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:36" (1/1) ... [2019-10-15 01:10:36,064 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:36,148 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:36,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:36,884 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:37,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:37,145 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:37,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:37 WrapperNode [2019-10-15 01:10:37,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:37,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:37,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:37,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:37,162 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:37" (1/1) ... [2019-10-15 01:10:37,162 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:37" (1/1) ... [2019-10-15 01:10:37,192 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:37" (1/1) ... [2019-10-15 01:10:37,193 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:37" (1/1) ... [2019-10-15 01:10:37,249 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:37" (1/1) ... [2019-10-15 01:10:37,283 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:37" (1/1) ... [2019-10-15 01:10:37,304 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:37" (1/1) ... [2019-10-15 01:10:37,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:37,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:37,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:37,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:37,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:37" (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:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:37,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:37,414 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:37,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:37,415 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:37,415 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:37,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-10-15 01:10:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-10-15 01:10:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:37,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:37,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:37,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:37,425 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:37,425 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:37,426 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:37,440 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:37,440 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:37,440 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:37,440 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:37,442 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:37,446 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:37,446 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:37,446 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-10-15 01:10:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-10-15 01:10:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:39,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:39,565 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:39,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:39 BoogieIcfgContainer [2019-10-15 01:10:39,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:39,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:39,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:39,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:39,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:36" (1/3) ... [2019-10-15 01:10:39,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e5be7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:39, skipping insertion in model container [2019-10-15 01:10:39,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:37" (2/3) ... [2019-10-15 01:10:39,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e5be7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:39, skipping insertion in model container [2019-10-15 01:10:39,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:39" (3/3) ... [2019-10-15 01:10:39,580 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product18.cil.c [2019-10-15 01:10:39,590 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:39,603 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:39,616 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:39,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:39,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:39,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:39,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:39,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:39,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:39,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:39,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states. [2019-10-15 01:10:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:10:39,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:39,731 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:39,733 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1366421017, now seen corresponding path program 1 times [2019-10-15 01:10:39,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:39,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399589044] [2019-10-15 01:10:39,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:39,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:39,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:40,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399589044] [2019-10-15 01:10:40,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:40,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:40,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214403477] [2019-10-15 01:10:40,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:40,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:40,506 INFO L87 Difference]: Start difference. First operand 781 states. Second operand 7 states. [2019-10-15 01:10:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:40,783 INFO L93 Difference]: Finished difference Result 1227 states and 1992 transitions. [2019-10-15 01:10:40,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:40,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-15 01:10:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:40,809 INFO L225 Difference]: With dead ends: 1227 [2019-10-15 01:10:40,809 INFO L226 Difference]: Without dead ends: 622 [2019-10-15 01:10:40,819 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:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-15 01:10:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-15 01:10:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 01:10:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 991 transitions. [2019-10-15 01:10:40,959 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 991 transitions. Word has length 93 [2019-10-15 01:10:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:40,960 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 991 transitions. [2019-10-15 01:10:40,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 991 transitions. [2019-10-15 01:10:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:40,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:40,967 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:40,967 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1643390832, now seen corresponding path program 1 times [2019-10-15 01:10:40,968 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:40,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570740065] [2019-10-15 01:10:40,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:40,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:40,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:41,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570740065] [2019-10-15 01:10:41,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:41,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:41,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837016788] [2019-10-15 01:10:41,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:41,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:41,217 INFO L87 Difference]: Start difference. First operand 620 states and 991 transitions. Second operand 4 states. [2019-10-15 01:10:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:41,293 INFO L93 Difference]: Finished difference Result 1206 states and 1947 transitions. [2019-10-15 01:10:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:41,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-15 01:10:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:41,301 INFO L225 Difference]: With dead ends: 1206 [2019-10-15 01:10:41,301 INFO L226 Difference]: Without dead ends: 602 [2019-10-15 01:10:41,305 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:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-15 01:10:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-15 01:10:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-15 01:10:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 958 transitions. [2019-10-15 01:10:41,382 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 958 transitions. Word has length 94 [2019-10-15 01:10:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:41,383 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 958 transitions. [2019-10-15 01:10:41,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 958 transitions. [2019-10-15 01:10:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:41,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:41,387 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:41,387 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1305237044, now seen corresponding path program 1 times [2019-10-15 01:10:41,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:41,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519463859] [2019-10-15 01:10:41,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:41,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519463859] [2019-10-15 01:10:41,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:41,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:41,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27643651] [2019-10-15 01:10:41,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:41,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:41,555 INFO L87 Difference]: Start difference. First operand 602 states and 958 transitions. Second operand 7 states. [2019-10-15 01:10:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:41,657 INFO L93 Difference]: Finished difference Result 1175 states and 1889 transitions. [2019-10-15 01:10:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:41,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:10:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:41,665 INFO L225 Difference]: With dead ends: 1175 [2019-10-15 01:10:41,665 INFO L226 Difference]: Without dead ends: 596 [2019-10-15 01:10:41,668 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:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-15 01:10:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-15 01:10:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-15 01:10:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 945 transitions. [2019-10-15 01:10:41,703 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 945 transitions. Word has length 94 [2019-10-15 01:10:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:41,705 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 945 transitions. [2019-10-15 01:10:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 945 transitions. [2019-10-15 01:10:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:41,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:41,714 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:41,714 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1548689565, now seen corresponding path program 1 times [2019-10-15 01:10:41,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:41,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109147118] [2019-10-15 01:10:41,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:41,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109147118] [2019-10-15 01:10:41,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:41,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:41,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493316585] [2019-10-15 01:10:41,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:41,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:41,894 INFO L87 Difference]: Start difference. First operand 596 states and 945 transitions. Second operand 7 states. [2019-10-15 01:10:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:41,984 INFO L93 Difference]: Finished difference Result 1163 states and 1863 transitions. [2019-10-15 01:10:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:41,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:10:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:41,990 INFO L225 Difference]: With dead ends: 1163 [2019-10-15 01:10:41,990 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:10:41,992 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:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:10:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:10:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:10:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 932 transitions. [2019-10-15 01:10:42,015 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 932 transitions. Word has length 95 [2019-10-15 01:10:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,016 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 932 transitions. [2019-10-15 01:10:42,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 932 transitions. [2019-10-15 01:10:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:42,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,018 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,019 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1649028488, now seen corresponding path program 1 times [2019-10-15 01:10:42,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865581106] [2019-10-15 01:10:42,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865581106] [2019-10-15 01:10:42,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:42,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741543046] [2019-10-15 01:10:42,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:42,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:42,236 INFO L87 Difference]: Start difference. First operand 590 states and 932 transitions. Second operand 7 states. [2019-10-15 01:10:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:42,330 INFO L93 Difference]: Finished difference Result 1151 states and 1837 transitions. [2019-10-15 01:10:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:42,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:10:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:42,342 INFO L225 Difference]: With dead ends: 1151 [2019-10-15 01:10:42,343 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:42,345 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:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 919 transitions. [2019-10-15 01:10:42,368 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 919 transitions. Word has length 96 [2019-10-15 01:10:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,368 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 919 transitions. [2019-10-15 01:10:42,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 919 transitions. [2019-10-15 01:10:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:42,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,372 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -260086663, now seen corresponding path program 1 times [2019-10-15 01:10:42,373 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666241414] [2019-10-15 01:10:42,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666241414] [2019-10-15 01:10:42,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:42,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066706683] [2019-10-15 01:10:42,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:42,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:42,527 INFO L87 Difference]: Start difference. First operand 584 states and 919 transitions. Second operand 7 states. [2019-10-15 01:10:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:42,633 INFO L93 Difference]: Finished difference Result 1139 states and 1811 transitions. [2019-10-15 01:10:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:42,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:10:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:42,644 INFO L225 Difference]: With dead ends: 1139 [2019-10-15 01:10:42,644 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:42,654 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:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 918 transitions. [2019-10-15 01:10:42,691 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 918 transitions. Word has length 96 [2019-10-15 01:10:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,692 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 918 transitions. [2019-10-15 01:10:42,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 918 transitions. [2019-10-15 01:10:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:10:42,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,698 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,698 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 146115361, now seen corresponding path program 1 times [2019-10-15 01:10:42,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306684179] [2019-10-15 01:10:42,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306684179] [2019-10-15 01:10:42,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:42,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893662786] [2019-10-15 01:10:42,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:42,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:42,886 INFO L87 Difference]: Start difference. First operand 584 states and 918 transitions. Second operand 5 states. [2019-10-15 01:10:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:43,064 INFO L93 Difference]: Finished difference Result 1138 states and 1808 transitions. [2019-10-15 01:10:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:43,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-15 01:10:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:43,071 INFO L225 Difference]: With dead ends: 1138 [2019-10-15 01:10:43,071 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:43,074 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:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 917 transitions. [2019-10-15 01:10:43,105 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 917 transitions. Word has length 97 [2019-10-15 01:10:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:43,106 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 917 transitions. [2019-10-15 01:10:43,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 917 transitions. [2019-10-15 01:10:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:10:43,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:43,109 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:43,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1759564154, now seen corresponding path program 1 times [2019-10-15 01:10:43,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:43,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404569832] [2019-10-15 01:10:43,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:43,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404569832] [2019-10-15 01:10:43,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:43,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:43,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88477459] [2019-10-15 01:10:43,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:43,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:43,277 INFO L87 Difference]: Start difference. First operand 584 states and 917 transitions. Second operand 5 states. [2019-10-15 01:10:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:43,344 INFO L93 Difference]: Finished difference Result 1138 states and 1806 transitions. [2019-10-15 01:10:43,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:43,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-15 01:10:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:43,350 INFO L225 Difference]: With dead ends: 1138 [2019-10-15 01:10:43,351 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:43,355 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:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 916 transitions. [2019-10-15 01:10:43,383 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 916 transitions. Word has length 98 [2019-10-15 01:10:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:43,384 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 916 transitions. [2019-10-15 01:10:43,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 916 transitions. [2019-10-15 01:10:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:10:43,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:43,387 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:43,387 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash -153149156, now seen corresponding path program 1 times [2019-10-15 01:10:43,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:43,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431059502] [2019-10-15 01:10:43,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:43,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431059502] [2019-10-15 01:10:43,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:43,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:43,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020782881] [2019-10-15 01:10:43,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:43,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:43,516 INFO L87 Difference]: Start difference. First operand 584 states and 916 transitions. Second operand 5 states. [2019-10-15 01:10:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:43,587 INFO L93 Difference]: Finished difference Result 1138 states and 1804 transitions. [2019-10-15 01:10:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:43,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-15 01:10:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:43,594 INFO L225 Difference]: With dead ends: 1138 [2019-10-15 01:10:43,594 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:43,597 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:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 915 transitions. [2019-10-15 01:10:43,622 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 915 transitions. Word has length 99 [2019-10-15 01:10:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:43,622 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 915 transitions. [2019-10-15 01:10:43,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 915 transitions. [2019-10-15 01:10:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:10:43,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:43,625 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:43,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:43,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:43,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1340953951, now seen corresponding path program 1 times [2019-10-15 01:10:43,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:43,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904717812] [2019-10-15 01:10:43,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:43,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904717812] [2019-10-15 01:10:43,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:43,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:43,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846564715] [2019-10-15 01:10:43,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:43,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:43,748 INFO L87 Difference]: Start difference. First operand 584 states and 915 transitions. Second operand 5 states. [2019-10-15 01:10:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:43,826 INFO L93 Difference]: Finished difference Result 1138 states and 1802 transitions. [2019-10-15 01:10:43,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:43,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 01:10:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:43,833 INFO L225 Difference]: With dead ends: 1138 [2019-10-15 01:10:43,834 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:43,842 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:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 914 transitions. [2019-10-15 01:10:43,869 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 914 transitions. Word has length 100 [2019-10-15 01:10:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:43,869 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 914 transitions. [2019-10-15 01:10:43,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 914 transitions. [2019-10-15 01:10:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:43,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:43,873 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:43,873 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1311064363, now seen corresponding path program 1 times [2019-10-15 01:10:43,874 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:43,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315289073] [2019-10-15 01:10:43,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:43,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:44,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315289073] [2019-10-15 01:10:44,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:44,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:44,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202930174] [2019-10-15 01:10:44,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:44,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:44,128 INFO L87 Difference]: Start difference. First operand 584 states and 914 transitions. Second operand 9 states. [2019-10-15 01:10:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:44,253 INFO L93 Difference]: Finished difference Result 1140 states and 1801 transitions. [2019-10-15 01:10:44,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:10:44,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-15 01:10:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:44,258 INFO L225 Difference]: With dead ends: 1140 [2019-10-15 01:10:44,258 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 01:10:44,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 01:10:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 01:10:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:10:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 913 transitions. [2019-10-15 01:10:44,283 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 913 transitions. Word has length 101 [2019-10-15 01:10:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:44,284 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 913 transitions. [2019-10-15 01:10:44,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 913 transitions. [2019-10-15 01:10:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:44,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:44,286 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:44,286 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:44,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1044740887, now seen corresponding path program 1 times [2019-10-15 01:10:44,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:44,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721116159] [2019-10-15 01:10:44,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:44,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:44,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:44,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721116159] [2019-10-15 01:10:44,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:44,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:10:44,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782669608] [2019-10-15 01:10:44,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:10:44,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:44,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:10:44,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:44,468 INFO L87 Difference]: Start difference. First operand 584 states and 913 transitions. Second operand 8 states. [2019-10-15 01:10:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,161 INFO L93 Difference]: Finished difference Result 2123 states and 3381 transitions. [2019-10-15 01:10:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:10:47,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-15 01:10:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,190 INFO L225 Difference]: With dead ends: 2123 [2019-10-15 01:10:47,191 INFO L226 Difference]: Without dead ends: 1573 [2019-10-15 01:10:47,194 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:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-10-15 01:10:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1561. [2019-10-15 01:10:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-10-15 01:10:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2446 transitions. [2019-10-15 01:10:47,265 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2446 transitions. Word has length 101 [2019-10-15 01:10:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:47,266 INFO L462 AbstractCegarLoop]: Abstraction has 1561 states and 2446 transitions. [2019-10-15 01:10:47,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:10:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2446 transitions. [2019-10-15 01:10:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:47,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,268 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,268 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1821089815, now seen corresponding path program 1 times [2019-10-15 01:10:47,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688641725] [2019-10-15 01:10:47,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:47,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688641725] [2019-10-15 01:10:47,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499492530] [2019-10-15 01:10:47,439 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:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:47,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:48,018 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:48,135 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:48,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:48,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34307298] [2019-10-15 01:10:48,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:48,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:48,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:48,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:48,137 INFO L87 Difference]: Start difference. First operand 1561 states and 2446 transitions. Second operand 3 states. [2019-10-15 01:10:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,273 INFO L93 Difference]: Finished difference Result 4487 states and 7168 transitions. [2019-10-15 01:10:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:48,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:10:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,298 INFO L225 Difference]: With dead ends: 4487 [2019-10-15 01:10:48,299 INFO L226 Difference]: Without dead ends: 2960 [2019-10-15 01:10:48,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2019-10-15 01:10:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2854. [2019-10-15 01:10:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2019-10-15 01:10:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4538 transitions. [2019-10-15 01:10:48,522 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4538 transitions. Word has length 101 [2019-10-15 01:10:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,523 INFO L462 AbstractCegarLoop]: Abstraction has 2854 states and 4538 transitions. [2019-10-15 01:10:48,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4538 transitions. [2019-10-15 01:10:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:10:48,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,524 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:48,743 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1738268530, now seen corresponding path program 1 times [2019-10-15 01:10:48,743 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701730599] [2019-10-15 01:10:48,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:48,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701730599] [2019-10-15 01:10:48,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456634687] [2019-10-15 01:10:48,921 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:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:49,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:49,467 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:49,562 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:49,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:49,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029896851] [2019-10-15 01:10:49,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:49,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:49,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:49,564 INFO L87 Difference]: Start difference. First operand 2854 states and 4538 transitions. Second operand 3 states. [2019-10-15 01:10:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,717 INFO L93 Difference]: Finished difference Result 6271 states and 10041 transitions. [2019-10-15 01:10:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:49,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-15 01:10:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,744 INFO L225 Difference]: With dead ends: 6271 [2019-10-15 01:10:49,744 INFO L226 Difference]: Without dead ends: 3451 [2019-10-15 01:10:49,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2019-10-15 01:10:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3357. [2019-10-15 01:10:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2019-10-15 01:10:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 5345 transitions. [2019-10-15 01:10:50,045 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 5345 transitions. Word has length 102 [2019-10-15 01:10:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:50,045 INFO L462 AbstractCegarLoop]: Abstraction has 3357 states and 5345 transitions. [2019-10-15 01:10:50,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 5345 transitions. [2019-10-15 01:10:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:10:50,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:50,047 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:50,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:50,255 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1035094428, now seen corresponding path program 1 times [2019-10-15 01:10:50,257 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:50,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674510326] [2019-10-15 01:10:50,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:50,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674510326] [2019-10-15 01:10:50,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:50,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:50,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7420703] [2019-10-15 01:10:50,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:50,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:50,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:50,431 INFO L87 Difference]: Start difference. First operand 3357 states and 5345 transitions. Second operand 7 states. [2019-10-15 01:10:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:53,362 INFO L93 Difference]: Finished difference Result 9947 states and 16189 transitions. [2019-10-15 01:10:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:53,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-10-15 01:10:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:53,409 INFO L225 Difference]: With dead ends: 9947 [2019-10-15 01:10:53,409 INFO L226 Difference]: Without dead ends: 6624 [2019-10-15 01:10:53,429 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:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6624 states. [2019-10-15 01:10:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6624 to 6536. [2019-10-15 01:10:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-15 01:10:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 10542 transitions. [2019-10-15 01:10:53,698 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 10542 transitions. Word has length 104 [2019-10-15 01:10:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:53,699 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 10542 transitions. [2019-10-15 01:10:53,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 10542 transitions. [2019-10-15 01:10:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:10:53,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:53,701 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:53,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash 895998947, now seen corresponding path program 1 times [2019-10-15 01:10:53,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:53,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923431765] [2019-10-15 01:10:53,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:53,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:53,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:53,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923431765] [2019-10-15 01:10:53,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:53,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:53,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479366891] [2019-10-15 01:10:53,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:53,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:53,842 INFO L87 Difference]: Start difference. First operand 6536 states and 10542 transitions. Second operand 4 states. [2019-10-15 01:10:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:54,096 INFO L93 Difference]: Finished difference Result 13030 states and 21221 transitions. [2019-10-15 01:10:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:54,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:10:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:54,147 INFO L225 Difference]: With dead ends: 13030 [2019-10-15 01:10:54,148 INFO L226 Difference]: Without dead ends: 6528 [2019-10-15 01:10:54,181 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:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2019-10-15 01:10:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 6506. [2019-10-15 01:10:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-10-15 01:10:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10454 transitions. [2019-10-15 01:10:54,432 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10454 transitions. Word has length 105 [2019-10-15 01:10:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:54,433 INFO L462 AbstractCegarLoop]: Abstraction has 6506 states and 10454 transitions. [2019-10-15 01:10:54,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10454 transitions. [2019-10-15 01:10:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:10:54,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:54,435 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:54,436 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash 371384462, now seen corresponding path program 1 times [2019-10-15 01:10:54,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:54,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701744778] [2019-10-15 01:10:54,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:54,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:54,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:10:54,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701744778] [2019-10-15 01:10:54,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:54,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:54,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465190879] [2019-10-15 01:10:54,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:54,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:54,583 INFO L87 Difference]: Start difference. First operand 6506 states and 10454 transitions. Second operand 7 states. [2019-10-15 01:10:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:57,157 INFO L93 Difference]: Finished difference Result 19472 states and 32093 transitions. [2019-10-15 01:10:57,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:57,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-15 01:10:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:57,243 INFO L225 Difference]: With dead ends: 19472 [2019-10-15 01:10:57,243 INFO L226 Difference]: Without dead ends: 13000 [2019-10-15 01:10:57,269 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:10:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13000 states. [2019-10-15 01:10:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13000 to 12872. [2019-10-15 01:10:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-10-15 01:10:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 21078 transitions. [2019-10-15 01:10:57,829 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 21078 transitions. Word has length 113 [2019-10-15 01:10:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:57,831 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 21078 transitions. [2019-10-15 01:10:57,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 21078 transitions. [2019-10-15 01:10:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:10:57,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:57,833 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:57,833 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1426044095, now seen corresponding path program 1 times [2019-10-15 01:10:57,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:57,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693288862] [2019-10-15 01:10:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:57,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:10:57,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693288862] [2019-10-15 01:10:57,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:57,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:57,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192231800] [2019-10-15 01:10:57,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:57,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:57,935 INFO L87 Difference]: Start difference. First operand 12872 states and 21078 transitions. Second operand 4 states. [2019-10-15 01:10:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:58,344 INFO L93 Difference]: Finished difference Result 25772 states and 42663 transitions. [2019-10-15 01:10:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:58,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:10:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:58,432 INFO L225 Difference]: With dead ends: 25772 [2019-10-15 01:10:58,432 INFO L226 Difference]: Without dead ends: 12928 [2019-10-15 01:10:58,475 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:10:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12928 states. [2019-10-15 01:10:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12928 to 12880. [2019-10-15 01:10:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2019-10-15 01:10:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 21029 transitions. [2019-10-15 01:10:59,778 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 21029 transitions. Word has length 114 [2019-10-15 01:10:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:59,779 INFO L462 AbstractCegarLoop]: Abstraction has 12880 states and 21029 transitions. [2019-10-15 01:10:59,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 21029 transitions. [2019-10-15 01:10:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:10:59,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:59,782 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,782 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2143166150, now seen corresponding path program 1 times [2019-10-15 01:10:59,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:59,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146361384] [2019-10-15 01:10:59,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:59,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:59,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:10:59,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146361384] [2019-10-15 01:10:59,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386324148] [2019-10-15 01:10:59,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:00,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 3299 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:11:00,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:11:00,859 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:01,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:11:01,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:11:01,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 9] total 25 [2019-10-15 01:11:01,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208771575] [2019-10-15 01:11:01,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:01,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:11:01,301 INFO L87 Difference]: Start difference. First operand 12880 states and 21029 transitions. Second operand 9 states.