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_spec14_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:06,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:06,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:06,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:06,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:06,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:06,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:06,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:06,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:06,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:06,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:06,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:06,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:06,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:06,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:06,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:06,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:06,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:06,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:06,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:06,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:06,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:06,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:06,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:06,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:06,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:06,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:06,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:06,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:06,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:06,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:06,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:06,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:06,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:06,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:06,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:06,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:06,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:06,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:06,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:06,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:06,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:09:06,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:06,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:06,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:06,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:06,503 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:06,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:06,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:06,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:06,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:06,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:06,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:06,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:06,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:06,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:06,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:06,505 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:06,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:06,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:06,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:06,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:06,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:06,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:06,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:06,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:06,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:06,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:06,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:06,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:06,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:09:06,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:06,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:06,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:06,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:06,815 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:06,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-13 21:09:06,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36103c425/3de96ecb9a914eb1bc51332cc716f02b/FLAG50ba0c15b [2019-10-13 21:09:07,605 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:07,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-13 21:09:07,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36103c425/3de96ecb9a914eb1bc51332cc716f02b/FLAG50ba0c15b [2019-10-13 21:09:07,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36103c425/3de96ecb9a914eb1bc51332cc716f02b [2019-10-13 21:09:07,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:07,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:07,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:07,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:07,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:07,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:07" (1/1) ... [2019-10-13 21:09:07,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af97dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:07, skipping insertion in model container [2019-10-13 21:09:07,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:07" (1/1) ... [2019-10-13 21:09:07,799 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:07,873 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:08,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:08,603 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:08,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:08,876 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:08,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08 WrapperNode [2019-10-13 21:09:08,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:08,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:08,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:08,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:08,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:09,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:09,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:09,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:09,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:09,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:09,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:09,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:09,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:09,241 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:09,241 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:09,242 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:09,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:09,254 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-13 21:09:09,254 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:09,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,255 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:09,255 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-13 21:09:09,255 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-13 21:09:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:09,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:11,482 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:11,483 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:11,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:11 BoogieIcfgContainer [2019-10-13 21:09:11,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:11,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:11,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:11,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:11,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:07" (1/3) ... [2019-10-13 21:09:11,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f9e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:11, skipping insertion in model container [2019-10-13 21:09:11,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (2/3) ... [2019-10-13 21:09:11,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f9e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:11, skipping insertion in model container [2019-10-13 21:09:11,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:11" (3/3) ... [2019-10-13 21:09:11,493 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2019-10-13 21:09:11,504 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:11,517 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:11,529 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:11,571 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:11,571 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:11,571 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:11,571 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:11,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:11,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:11,572 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:11,572 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states. [2019-10-13 21:09:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:09:11,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:11,649 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:11,653 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2136153508, now seen corresponding path program 1 times [2019-10-13 21:09:11,669 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:11,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851460131] [2019-10-13 21:09:11,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:11,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:12,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851460131] [2019-10-13 21:09:12,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216617826] [2019-10-13 21:09:12,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,397 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 4 states. [2019-10-13 21:09:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:12,580 INFO L93 Difference]: Finished difference Result 1126 states and 1818 transitions. [2019-10-13 21:09:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:12,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-13 21:09:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:12,608 INFO L225 Difference]: With dead ends: 1126 [2019-10-13 21:09:12,608 INFO L226 Difference]: Without dead ends: 566 [2019-10-13 21:09:12,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-13 21:09:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-13 21:09:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:09:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 900 transitions. [2019-10-13 21:09:12,759 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 900 transitions. Word has length 135 [2019-10-13 21:09:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:12,759 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-10-13 21:09:12,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 900 transitions. [2019-10-13 21:09:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:09:12,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:12,773 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:12,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1459337121, now seen corresponding path program 1 times [2019-10-13 21:09:12,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:12,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746947661] [2019-10-13 21:09:12,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746947661] [2019-10-13 21:09:13,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934874610] [2019-10-13 21:09:13,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,063 INFO L87 Difference]: Start difference. First operand 566 states and 900 transitions. Second operand 4 states. [2019-10-13 21:09:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,156 INFO L93 Difference]: Finished difference Result 1099 states and 1761 transitions. [2019-10-13 21:09:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:09:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,162 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:09:13,163 INFO L226 Difference]: Without dead ends: 566 [2019-10-13 21:09:13,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-13 21:09:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-13 21:09:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:09:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 899 transitions. [2019-10-13 21:09:13,201 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 899 transitions. Word has length 136 [2019-10-13 21:09:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,202 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 899 transitions. [2019-10-13 21:09:13,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 899 transitions. [2019-10-13 21:09:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:09:13,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,207 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:13,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -901760384, now seen corresponding path program 1 times [2019-10-13 21:09:13,208 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626980773] [2019-10-13 21:09:13,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626980773] [2019-10-13 21:09:13,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964468901] [2019-10-13 21:09:13,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,375 INFO L87 Difference]: Start difference. First operand 566 states and 899 transitions. Second operand 4 states. [2019-10-13 21:09:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,464 INFO L93 Difference]: Finished difference Result 1099 states and 1760 transitions. [2019-10-13 21:09:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:09:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,471 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:09:13,471 INFO L226 Difference]: Without dead ends: 566 [2019-10-13 21:09:13,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-13 21:09:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-13 21:09:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:09:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 898 transitions. [2019-10-13 21:09:13,524 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 898 transitions. Word has length 137 [2019-10-13 21:09:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,524 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 898 transitions. [2019-10-13 21:09:13,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 898 transitions. [2019-10-13 21:09:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:09:13,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,529 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:13,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -448114181, now seen corresponding path program 1 times [2019-10-13 21:09:13,530 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725234821] [2019-10-13 21:09:13,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725234821] [2019-10-13 21:09:13,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655103408] [2019-10-13 21:09:13,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,654 INFO L87 Difference]: Start difference. First operand 566 states and 898 transitions. Second operand 4 states. [2019-10-13 21:09:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,715 INFO L93 Difference]: Finished difference Result 1099 states and 1759 transitions. [2019-10-13 21:09:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:09:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,723 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:09:13,723 INFO L226 Difference]: Without dead ends: 566 [2019-10-13 21:09:13,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-13 21:09:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-13 21:09:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:09:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 897 transitions. [2019-10-13 21:09:13,754 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 897 transitions. Word has length 138 [2019-10-13 21:09:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,754 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 897 transitions. [2019-10-13 21:09:13,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 897 transitions. [2019-10-13 21:09:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:09:13,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,760 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:13,761 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1078652764, now seen corresponding path program 1 times [2019-10-13 21:09:13,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039363883] [2019-10-13 21:09:13,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039363883] [2019-10-13 21:09:13,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576331246] [2019-10-13 21:09:13,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,995 INFO L87 Difference]: Start difference. First operand 566 states and 897 transitions. Second operand 4 states. [2019-10-13 21:09:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,063 INFO L93 Difference]: Finished difference Result 1099 states and 1758 transitions. [2019-10-13 21:09:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:09:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,072 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:09:14,072 INFO L226 Difference]: Without dead ends: 566 [2019-10-13 21:09:14,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-13 21:09:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-13 21:09:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:09:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-10-13 21:09:14,097 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 139 [2019-10-13 21:09:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,097 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-10-13 21:09:14,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-10-13 21:09:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,103 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:14,103 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1512424343, now seen corresponding path program 1 times [2019-10-13 21:09:14,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949713090] [2019-10-13 21:09:14,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949713090] [2019-10-13 21:09:14,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:14,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167743753] [2019-10-13 21:09:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:14,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:14,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:14,306 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 10 states. [2019-10-13 21:09:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,475 INFO L93 Difference]: Finished difference Result 1104 states and 1765 transitions. [2019-10-13 21:09:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:14,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:09:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,486 INFO L225 Difference]: With dead ends: 1104 [2019-10-13 21:09:14,487 INFO L226 Difference]: Without dead ends: 575 [2019-10-13 21:09:14,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-13 21:09:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2019-10-13 21:09:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-13 21:09:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 906 transitions. [2019-10-13 21:09:14,522 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 906 transitions. Word has length 140 [2019-10-13 21:09:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,522 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 906 transitions. [2019-10-13 21:09:14,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 906 transitions. [2019-10-13 21:09:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,526 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:14,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash 525841654, now seen corresponding path program 1 times [2019-10-13 21:09:14,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014136836] [2019-10-13 21:09:14,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014136836] [2019-10-13 21:09:14,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880513183] [2019-10-13 21:09:14,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,702 INFO L87 Difference]: Start difference. First operand 573 states and 906 transitions. Second operand 4 states. [2019-10-13 21:09:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,770 INFO L93 Difference]: Finished difference Result 1105 states and 1766 transitions. [2019-10-13 21:09:14,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:14,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:09:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,780 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:09:14,782 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:09:14,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:09:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:09:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:09:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 899 transitions. [2019-10-13 21:09:14,818 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 899 transitions. Word has length 140 [2019-10-13 21:09:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,818 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 899 transitions. [2019-10-13 21:09:14,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 899 transitions. [2019-10-13 21:09:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:09:14,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,824 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:14,824 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1915884638, now seen corresponding path program 1 times [2019-10-13 21:09:14,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865332807] [2019-10-13 21:09:14,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:15,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865332807] [2019-10-13 21:09:15,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840450912] [2019-10-13 21:09:15,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,007 INFO L87 Difference]: Start difference. First operand 569 states and 899 transitions. Second operand 6 states. [2019-10-13 21:09:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,399 INFO L93 Difference]: Finished difference Result 1118 states and 1790 transitions. [2019-10-13 21:09:15,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:15,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:09:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,407 INFO L225 Difference]: With dead ends: 1118 [2019-10-13 21:09:15,408 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:09:15,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:09:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-13 21:09:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 900 transitions. [2019-10-13 21:09:15,446 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 900 transitions. Word has length 141 [2019-10-13 21:09:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,446 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 900 transitions. [2019-10-13 21:09:15,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 900 transitions. [2019-10-13 21:09:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:09:15,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,451 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:15,452 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,452 INFO L82 PathProgramCache]: Analyzing trace with hash 625839962, now seen corresponding path program 1 times [2019-10-13 21:09:15,452 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205688700] [2019-10-13 21:09:15,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:15,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205688700] [2019-10-13 21:09:15,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888647570] [2019-10-13 21:09:15,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,647 INFO L87 Difference]: Start difference. First operand 574 states and 900 transitions. Second operand 6 states. [2019-10-13 21:09:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,901 INFO L93 Difference]: Finished difference Result 1081 states and 1705 transitions. [2019-10-13 21:09:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:15,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:09:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,905 INFO L225 Difference]: With dead ends: 1081 [2019-10-13 21:09:15,905 INFO L226 Difference]: Without dead ends: 574 [2019-10-13 21:09:15,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-13 21:09:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-13 21:09:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 896 transitions. [2019-10-13 21:09:15,927 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 896 transitions. Word has length 142 [2019-10-13 21:09:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,928 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 896 transitions. [2019-10-13 21:09:15,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 896 transitions. [2019-10-13 21:09:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:15,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,932 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:15,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1831211677, now seen corresponding path program 1 times [2019-10-13 21:09:15,933 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744839115] [2019-10-13 21:09:15,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744839115] [2019-10-13 21:09:16,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055973043] [2019-10-13 21:09:16,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,056 INFO L87 Difference]: Start difference. First operand 574 states and 896 transitions. Second operand 6 states. [2019-10-13 21:09:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,337 INFO L93 Difference]: Finished difference Result 1081 states and 1701 transitions. [2019-10-13 21:09:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:09:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,345 INFO L225 Difference]: With dead ends: 1081 [2019-10-13 21:09:16,346 INFO L226 Difference]: Without dead ends: 574 [2019-10-13 21:09:16,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-13 21:09:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-13 21:09:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 892 transitions. [2019-10-13 21:09:16,378 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 892 transitions. Word has length 143 [2019-10-13 21:09:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,378 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 892 transitions. [2019-10-13 21:09:16,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 892 transitions. [2019-10-13 21:09:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:16,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,386 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:16,386 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1553880605, now seen corresponding path program 1 times [2019-10-13 21:09:16,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131656164] [2019-10-13 21:09:16,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131656164] [2019-10-13 21:09:16,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:16,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692032309] [2019-10-13 21:09:16,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:16,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:16,568 INFO L87 Difference]: Start difference. First operand 574 states and 892 transitions. Second operand 7 states. [2019-10-13 21:09:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,691 INFO L93 Difference]: Finished difference Result 1084 states and 1701 transitions. [2019-10-13 21:09:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:16,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:09:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,700 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 21:09:16,700 INFO L226 Difference]: Without dead ends: 556 [2019-10-13 21:09:16,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-13 21:09:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 553. [2019-10-13 21:09:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-13 21:09:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 855 transitions. [2019-10-13 21:09:16,724 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 855 transitions. Word has length 143 [2019-10-13 21:09:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,724 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 855 transitions. [2019-10-13 21:09:16,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 855 transitions. [2019-10-13 21:09:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:09:16,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,729 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:16,730 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1810773505, now seen corresponding path program 1 times [2019-10-13 21:09:16,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279899277] [2019-10-13 21:09:16,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279899277] [2019-10-13 21:09:16,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914307399] [2019-10-13 21:09:16,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,926 INFO L87 Difference]: Start difference. First operand 553 states and 855 transitions. Second operand 6 states. [2019-10-13 21:09:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,075 INFO L93 Difference]: Finished difference Result 1060 states and 1660 transitions. [2019-10-13 21:09:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:09:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,080 INFO L225 Difference]: With dead ends: 1060 [2019-10-13 21:09:17,080 INFO L226 Difference]: Without dead ends: 553 [2019-10-13 21:09:17,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:17,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-13 21:09:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-13 21:09:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-13 21:09:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 854 transitions. [2019-10-13 21:09:17,104 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 854 transitions. Word has length 144 [2019-10-13 21:09:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,104 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 854 transitions. [2019-10-13 21:09:17,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 854 transitions. [2019-10-13 21:09:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:09:17,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,109 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:17,109 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1997404776, now seen corresponding path program 1 times [2019-10-13 21:09:17,110 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728542721] [2019-10-13 21:09:17,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728542721] [2019-10-13 21:09:17,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350974698] [2019-10-13 21:09:17,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,241 INFO L87 Difference]: Start difference. First operand 553 states and 854 transitions. Second operand 6 states. [2019-10-13 21:09:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,408 INFO L93 Difference]: Finished difference Result 1060 states and 1659 transitions. [2019-10-13 21:09:17,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:09:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,414 INFO L225 Difference]: With dead ends: 1060 [2019-10-13 21:09:17,415 INFO L226 Difference]: Without dead ends: 553 [2019-10-13 21:09:17,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-13 21:09:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-13 21:09:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-13 21:09:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 853 transitions. [2019-10-13 21:09:17,446 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 853 transitions. Word has length 145 [2019-10-13 21:09:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,448 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 853 transitions. [2019-10-13 21:09:17,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 853 transitions. [2019-10-13 21:09:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:09:17,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,454 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:17,454 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1659299750, now seen corresponding path program 1 times [2019-10-13 21:09:17,455 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889405424] [2019-10-13 21:09:17,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889405424] [2019-10-13 21:09:17,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:17,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292076782] [2019-10-13 21:09:17,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:17,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:17,635 INFO L87 Difference]: Start difference. First operand 553 states and 853 transitions. Second operand 4 states. [2019-10-13 21:09:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,707 INFO L93 Difference]: Finished difference Result 1060 states and 1658 transitions. [2019-10-13 21:09:17,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:17,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-13 21:09:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,713 INFO L225 Difference]: With dead ends: 1060 [2019-10-13 21:09:17,713 INFO L226 Difference]: Without dead ends: 553 [2019-10-13 21:09:17,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-13 21:09:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-13 21:09:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-13 21:09:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 852 transitions. [2019-10-13 21:09:17,743 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 852 transitions. Word has length 146 [2019-10-13 21:09:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,745 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 852 transitions. [2019-10-13 21:09:17,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 852 transitions. [2019-10-13 21:09:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:09:17,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,750 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:17,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1328525148, now seen corresponding path program 1 times [2019-10-13 21:09:17,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117510246] [2019-10-13 21:09:17,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:18,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117510246] [2019-10-13 21:09:18,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:18,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:18,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281652181] [2019-10-13 21:09:18,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:18,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:18,014 INFO L87 Difference]: Start difference. First operand 553 states and 852 transitions. Second operand 12 states. [2019-10-13 21:09:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:18,286 INFO L93 Difference]: Finished difference Result 1066 states and 1668 transitions. [2019-10-13 21:09:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:18,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:09:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:18,292 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:09:18,292 INFO L226 Difference]: Without dead ends: 560 [2019-10-13 21:09:18,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-13 21:09:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2019-10-13 21:09:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-13 21:09:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 858 transitions. [2019-10-13 21:09:18,318 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 858 transitions. Word has length 146 [2019-10-13 21:09:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:18,319 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 858 transitions. [2019-10-13 21:09:18,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 858 transitions. [2019-10-13 21:09:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:09:18,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,323 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:18,324 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash -685285033, now seen corresponding path program 1 times [2019-10-13 21:09:18,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959790170] [2019-10-13 21:09:18,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:18,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959790170] [2019-10-13 21:09:18,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287757457] [2019-10-13 21:09:18,499 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-13 21:09:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:19,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:19,169 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:19,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:19,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:19,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026713978] [2019-10-13 21:09:19,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:19,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:19,569 INFO L87 Difference]: Start difference. First operand 558 states and 858 transitions. Second operand 5 states. [2019-10-13 21:09:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,491 INFO L93 Difference]: Finished difference Result 1071 states and 1701 transitions. [2019-10-13 21:09:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:20,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:09:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,496 INFO L225 Difference]: With dead ends: 1071 [2019-10-13 21:09:20,496 INFO L226 Difference]: Without dead ends: 566 [2019-10-13 21:09:20,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-13 21:09:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-13 21:09:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:09:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 871 transitions. [2019-10-13 21:09:20,524 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 871 transitions. Word has length 147 [2019-10-13 21:09:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,525 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 871 transitions. [2019-10-13 21:09:20,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 871 transitions. [2019-10-13 21:09:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:09:20,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,529 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:20,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:20,744 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,745 INFO L82 PathProgramCache]: Analyzing trace with hash 901109553, now seen corresponding path program 1 times [2019-10-13 21:09:20,745 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082574975] [2019-10-13 21:09:20,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:20,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082574975] [2019-10-13 21:09:20,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042931304] [2019-10-13 21:09:20,990 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-13 21:09:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:21,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:21,651 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:21,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:21,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:21,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563377830] [2019-10-13 21:09:21,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:21,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:21,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:21,979 INFO L87 Difference]: Start difference. First operand 566 states and 871 transitions. Second operand 5 states. [2019-10-13 21:09:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,872 INFO L93 Difference]: Finished difference Result 1087 states and 1724 transitions. [2019-10-13 21:09:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:22,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:09:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,878 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:09:22,878 INFO L226 Difference]: Without dead ends: 574 [2019-10-13 21:09:22,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-13 21:09:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-13 21:09:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 884 transitions. [2019-10-13 21:09:22,906 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 884 transitions. Word has length 150 [2019-10-13 21:09:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,907 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 884 transitions. [2019-10-13 21:09:22,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 884 transitions. [2019-10-13 21:09:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:09:22,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,912 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:23,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:23,121 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -844488677, now seen corresponding path program 1 times [2019-10-13 21:09:23,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181855819] [2019-10-13 21:09:23,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-13 21:09:23,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181855819] [2019-10-13 21:09:23,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451325322] [2019-10-13 21:09:23,317 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-13 21:09:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:23,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:23,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:24,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:24,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:24,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905582340] [2019-10-13 21:09:24,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:24,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:24,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:24,219 INFO L87 Difference]: Start difference. First operand 574 states and 884 transitions. Second operand 5 states. [2019-10-13 21:09:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,123 INFO L93 Difference]: Finished difference Result 1103 states and 1747 transitions. [2019-10-13 21:09:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:25,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:09:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,128 INFO L225 Difference]: With dead ends: 1103 [2019-10-13 21:09:25,128 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:25,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 897 transitions. [2019-10-13 21:09:25,153 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 897 transitions. Word has length 153 [2019-10-13 21:09:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,154 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 897 transitions. [2019-10-13 21:09:25,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 897 transitions. [2019-10-13 21:09:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:09:25,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,158 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:25,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:25,365 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash 142602349, now seen corresponding path program 1 times [2019-10-13 21:09:25,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631789967] [2019-10-13 21:09:25,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:09:25,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631789967] [2019-10-13 21:09:25,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232794782] [2019-10-13 21:09:25,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:26,324 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:26,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:26,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-13 21:09:26,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908407301] [2019-10-13 21:09:26,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:26,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:09:26,633 INFO L87 Difference]: Start difference. First operand 582 states and 897 transitions. Second operand 5 states. [2019-10-13 21:09:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:27,544 INFO L93 Difference]: Finished difference Result 1119 states and 1770 transitions. [2019-10-13 21:09:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:27,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 21:09:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:27,550 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:09:27,550 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:27,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 910 transitions. [2019-10-13 21:09:27,576 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 910 transitions. Word has length 156 [2019-10-13 21:09:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:27,577 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 910 transitions. [2019-10-13 21:09:27,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 910 transitions. [2019-10-13 21:09:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:09:27,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:27,582 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:27,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:27,799 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1711898401, now seen corresponding path program 1 times [2019-10-13 21:09:27,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:27,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838515923] [2019-10-13 21:09:27,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:27,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838515923] [2019-10-13 21:09:27,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012308329] [2019-10-13 21:09:27,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:09:28,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:28,671 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:28,796 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:28,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-13 21:09:28,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279584688] [2019-10-13 21:09:28,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:28,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:28,798 INFO L87 Difference]: Start difference. First operand 590 states and 910 transitions. Second operand 6 states. [2019-10-13 21:09:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,411 INFO L93 Difference]: Finished difference Result 1670 states and 2664 transitions. [2019-10-13 21:09:29,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:29,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-13 21:09:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,420 INFO L225 Difference]: With dead ends: 1670 [2019-10-13 21:09:29,421 INFO L226 Difference]: Without dead ends: 1133 [2019-10-13 21:09:29,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-10-13 21:09:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1124. [2019-10-13 21:09:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-13 21:09:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1774 transitions. [2019-10-13 21:09:29,471 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1774 transitions. Word has length 159 [2019-10-13 21:09:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,474 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1774 transitions. [2019-10-13 21:09:29,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1774 transitions. [2019-10-13 21:09:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:29,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,478 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:29,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:29,686 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 372939816, now seen corresponding path program 1 times [2019-10-13 21:09:29,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:29,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869739308] [2019-10-13 21:09:29,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:29,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869739308] [2019-10-13 21:09:29,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248712153] [2019-10-13 21:09:29,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 2627 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:30,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:09:30,609 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:31,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:31,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:31,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34664027] [2019-10-13 21:09:31,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:31,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:31,069 INFO L87 Difference]: Start difference. First operand 1124 states and 1774 transitions. Second operand 9 states. [2019-10-13 21:09:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:36,607 INFO L93 Difference]: Finished difference Result 3435 states and 5537 transitions. [2019-10-13 21:09:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:36,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 21:09:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:36,626 INFO L225 Difference]: With dead ends: 3435 [2019-10-13 21:09:36,627 INFO L226 Difference]: Without dead ends: 2364 [2019-10-13 21:09:36,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:09:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-10-13 21:09:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2333. [2019-10-13 21:09:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-10-13 21:09:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3744 transitions. [2019-10-13 21:09:36,751 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3744 transitions. Word has length 164 [2019-10-13 21:09:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:36,752 INFO L462 AbstractCegarLoop]: Abstraction has 2333 states and 3744 transitions. [2019-10-13 21:09:36,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3744 transitions. [2019-10-13 21:09:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:09:36,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:36,760 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:36,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:36,977 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:36,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1587249477, now seen corresponding path program 1 times [2019-10-13 21:09:36,978 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:36,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538737556] [2019-10-13 21:09:36,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:36,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:36,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:37,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538737556] [2019-10-13 21:09:37,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:37,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:37,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185260542] [2019-10-13 21:09:37,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:37,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:37,140 INFO L87 Difference]: Start difference. First operand 2333 states and 3744 transitions. Second operand 9 states. [2019-10-13 21:09:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:37,440 INFO L93 Difference]: Finished difference Result 4538 states and 7325 transitions. [2019-10-13 21:09:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:37,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-13 21:09:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:37,463 INFO L225 Difference]: With dead ends: 4538 [2019-10-13 21:09:37,464 INFO L226 Difference]: Without dead ends: 2252 [2019-10-13 21:09:37,480 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-13 21:09:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-10-13 21:09:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2248. [2019-10-13 21:09:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-10-13 21:09:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3617 transitions. [2019-10-13 21:09:37,607 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3617 transitions. Word has length 167 [2019-10-13 21:09:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:37,608 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 3617 transitions. [2019-10-13 21:09:37,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3617 transitions. [2019-10-13 21:09:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:09:37,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:37,612 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:37,613 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash -994214802, now seen corresponding path program 1 times [2019-10-13 21:09:37,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:37,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922306752] [2019-10-13 21:09:37,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:37,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922306752] [2019-10-13 21:09:37,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72104168] [2019-10-13 21:09:37,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:38,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:09:38,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:09:38,545 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-13 21:09:38,776 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:38,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 13 [2019-10-13 21:09:38,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943745486] [2019-10-13 21:09:38,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:38,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:38,778 INFO L87 Difference]: Start difference. First operand 2248 states and 3617 transitions. Second operand 7 states. [2019-10-13 21:09:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:38,876 INFO L93 Difference]: Finished difference Result 4619 states and 7510 transitions. [2019-10-13 21:09:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:38,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-13 21:09:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:38,894 INFO L225 Difference]: With dead ends: 4619 [2019-10-13 21:09:38,894 INFO L226 Difference]: Without dead ends: 2424 [2019-10-13 21:09:38,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 341 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-10-13 21:09:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2416. [2019-10-13 21:09:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-10-13 21:09:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3906 transitions. [2019-10-13 21:09:39,012 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3906 transitions. Word has length 170 [2019-10-13 21:09:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:39,013 INFO L462 AbstractCegarLoop]: Abstraction has 2416 states and 3906 transitions. [2019-10-13 21:09:39,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3906 transitions. [2019-10-13 21:09:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-13 21:09:39,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:39,017 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:39,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:39,224 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -123748720, now seen corresponding path program 1 times [2019-10-13 21:09:39,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:39,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591796908] [2019-10-13 21:09:39,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat