java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:44,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:44,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:44,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:44,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:44,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:44,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:44,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:44,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:44,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:44,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:44,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:44,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:44,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:44,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:44,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:44,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:44,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:44,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:44,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:44,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:44,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:44,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:44,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:44,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:44,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:44,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:44,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:44,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:44,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:44,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:44,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:44,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:44,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:44,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:44,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:44,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:44,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:44,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:44,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:44,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:44,438 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:11:44,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:44,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:44,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:44,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:44,455 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:44,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:44,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:44,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:44,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:44,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:44,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:44,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:44,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:44,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:44,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:44,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:44,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:44,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:44,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:44,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:44,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:44,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:44,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:44,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:44,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:44,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:44,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:44,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:44,460 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:11:44,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:44,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:44,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:44,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:44,766 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:44,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c [2019-10-13 21:11:44,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb14843/9c1c3fb94bfb4d8d95e2c9ceb2e28c3e/FLAGd45a51c12 [2019-10-13 21:11:45,494 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:45,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c [2019-10-13 21:11:45,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb14843/9c1c3fb94bfb4d8d95e2c9ceb2e28c3e/FLAGd45a51c12 [2019-10-13 21:11:45,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb14843/9c1c3fb94bfb4d8d95e2c9ceb2e28c3e [2019-10-13 21:11:45,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:45,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:45,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:45,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:45,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:45,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:45" (1/1) ... [2019-10-13 21:11:45,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32777701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:45, skipping insertion in model container [2019-10-13 21:11:45,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:45" (1/1) ... [2019-10-13 21:11:45,712 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:45,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:46,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:46,541 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:46,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:46,717 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:46,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46 WrapperNode [2019-10-13 21:11:46,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:46,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:46,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:46,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:46,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:46,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:46,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:46,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:46,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (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:11:46,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:46,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:46,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:46,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:11:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:11:46,977 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:46,978 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:46,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:46,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:46,979 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:46,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:46,979 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:46,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:46,980 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:46,980 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:46,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:46,980 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:46,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:46,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:46,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:46,986 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:46,986 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:46,986 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:46,986 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:46,986 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:46,986 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:46,987 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:46,987 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:46,987 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:46,987 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:46,987 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:46,990 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:46,991 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:11:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:11:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:49,379 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:49,379 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:49,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:49 BoogieIcfgContainer [2019-10-13 21:11:49,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:49,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:49,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:49,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:49,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:45" (1/3) ... [2019-10-13 21:11:49,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47274c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:49, skipping insertion in model container [2019-10-13 21:11:49,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46" (2/3) ... [2019-10-13 21:11:49,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47274c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:49, skipping insertion in model container [2019-10-13 21:11:49,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:49" (3/3) ... [2019-10-13 21:11:49,390 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product25.cil.c [2019-10-13 21:11:49,401 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:49,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:49,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:49,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:49,467 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:49,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:49,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:49,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:49,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:49,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:49,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2019-10-13 21:11:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:11:49,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:49,536 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:49,538 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash 9789385, now seen corresponding path program 1 times [2019-10-13 21:11:49,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:49,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548328563] [2019-10-13 21:11:49,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:49,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:49,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:50,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548328563] [2019-10-13 21:11:50,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:50,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:50,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505615096] [2019-10-13 21:11:50,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:50,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:50,321 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 7 states. [2019-10-13 21:11:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:50,659 INFO L93 Difference]: Finished difference Result 1235 states and 2008 transitions. [2019-10-13 21:11:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:50,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-10-13 21:11:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:50,689 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:11:50,690 INFO L226 Difference]: Without dead ends: 626 [2019-10-13 21:11:50,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-13 21:11:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-13 21:11:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-13 21:11:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 999 transitions. [2019-10-13 21:11:50,847 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 999 transitions. Word has length 115 [2019-10-13 21:11:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:50,848 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 999 transitions. [2019-10-13 21:11:50,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 999 transitions. [2019-10-13 21:11:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:11:50,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:50,857 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:50,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash -803565182, now seen corresponding path program 1 times [2019-10-13 21:11:50,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:50,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789307307] [2019-10-13 21:11:50,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:51,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789307307] [2019-10-13 21:11:51,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:51,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:51,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402954624] [2019-10-13 21:11:51,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:51,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:51,103 INFO L87 Difference]: Start difference. First operand 624 states and 999 transitions. Second operand 4 states. [2019-10-13 21:11:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,180 INFO L93 Difference]: Finished difference Result 1214 states and 1963 transitions. [2019-10-13 21:11:51,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:51,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-13 21:11:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,237 INFO L225 Difference]: With dead ends: 1214 [2019-10-13 21:11:51,237 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 21:11:51,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 21:11:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-13 21:11:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-13 21:11:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 966 transitions. [2019-10-13 21:11:51,293 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 966 transitions. Word has length 116 [2019-10-13 21:11:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,294 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 966 transitions. [2019-10-13 21:11:51,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 966 transitions. [2019-10-13 21:11:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:11:51,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,304 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:51,304 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash -433705100, now seen corresponding path program 1 times [2019-10-13 21:11:51,305 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:51,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559790742] [2019-10-13 21:11:51,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:51,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559790742] [2019-10-13 21:11:51,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:51,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:51,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357929399] [2019-10-13 21:11:51,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:51,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:51,542 INFO L87 Difference]: Start difference. First operand 606 states and 966 transitions. Second operand 7 states. [2019-10-13 21:11:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,642 INFO L93 Difference]: Finished difference Result 1183 states and 1905 transitions. [2019-10-13 21:11:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:51,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-10-13 21:11:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,649 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:11:51,649 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:51,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 953 transitions. [2019-10-13 21:11:51,686 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 953 transitions. Word has length 116 [2019-10-13 21:11:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,687 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 953 transitions. [2019-10-13 21:11:51,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 953 transitions. [2019-10-13 21:11:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:11:51,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,693 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:51,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1336159923, now seen corresponding path program 1 times [2019-10-13 21:11:51,694 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:51,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29748403] [2019-10-13 21:11:51,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:51,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29748403] [2019-10-13 21:11:51,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:51,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:51,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919971150] [2019-10-13 21:11:51,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:51,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:51,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:51,897 INFO L87 Difference]: Start difference. First operand 600 states and 953 transitions. Second operand 7 states. [2019-10-13 21:11:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,992 INFO L93 Difference]: Finished difference Result 1171 states and 1879 transitions. [2019-10-13 21:11:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:51,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-13 21:11:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,998 INFO L225 Difference]: With dead ends: 1171 [2019-10-13 21:11:51,999 INFO L226 Difference]: Without dead ends: 594 [2019-10-13 21:11:52,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-13 21:11:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-13 21:11:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-13 21:11:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 940 transitions. [2019-10-13 21:11:52,032 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 940 transitions. Word has length 117 [2019-10-13 21:11:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,033 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 940 transitions. [2019-10-13 21:11:52,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 940 transitions. [2019-10-13 21:11:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:11:52,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,037 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:52,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash 713483960, now seen corresponding path program 1 times [2019-10-13 21:11:52,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059068928] [2019-10-13 21:11:52,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:52,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059068928] [2019-10-13 21:11:52,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:52,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694676411] [2019-10-13 21:11:52,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:52,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:52,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:52,286 INFO L87 Difference]: Start difference. First operand 594 states and 940 transitions. Second operand 7 states. [2019-10-13 21:11:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:52,376 INFO L93 Difference]: Finished difference Result 1159 states and 1853 transitions. [2019-10-13 21:11:52,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:52,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-13 21:11:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:52,382 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:11:52,382 INFO L226 Difference]: Without dead ends: 588 [2019-10-13 21:11:52,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-13 21:11:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-13 21:11:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:11:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 927 transitions. [2019-10-13 21:11:52,411 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 927 transitions. Word has length 118 [2019-10-13 21:11:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,412 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 927 transitions. [2019-10-13 21:11:52,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 927 transitions. [2019-10-13 21:11:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:11:52,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,416 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:52,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -467103239, now seen corresponding path program 1 times [2019-10-13 21:11:52,417 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232387852] [2019-10-13 21:11:52,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:52,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232387852] [2019-10-13 21:11:52,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:52,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610201456] [2019-10-13 21:11:52,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:52,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:52,578 INFO L87 Difference]: Start difference. First operand 588 states and 927 transitions. Second operand 7 states. [2019-10-13 21:11:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:52,697 INFO L93 Difference]: Finished difference Result 1147 states and 1827 transitions. [2019-10-13 21:11:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:52,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-13 21:11:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:52,710 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:11:52,710 INFO L226 Difference]: Without dead ends: 588 [2019-10-13 21:11:52,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-13 21:11:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-13 21:11:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:11:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 926 transitions. [2019-10-13 21:11:52,752 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 926 transitions. Word has length 118 [2019-10-13 21:11:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,753 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 926 transitions. [2019-10-13 21:11:52,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 926 transitions. [2019-10-13 21:11:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:11:52,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,759 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:52,759 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash -211092783, now seen corresponding path program 1 times [2019-10-13 21:11:52,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353782281] [2019-10-13 21:11:52,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:53,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353782281] [2019-10-13 21:11:53,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:53,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683681176] [2019-10-13 21:11:53,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:53,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:53,148 INFO L87 Difference]: Start difference. First operand 588 states and 926 transitions. Second operand 5 states. [2019-10-13 21:11:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,246 INFO L93 Difference]: Finished difference Result 1146 states and 1824 transitions. [2019-10-13 21:11:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:53,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-13 21:11:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,252 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:11:53,253 INFO L226 Difference]: Without dead ends: 588 [2019-10-13 21:11:53,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-13 21:11:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-13 21:11:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:11:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 925 transitions. [2019-10-13 21:11:53,282 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 925 transitions. Word has length 119 [2019-10-13 21:11:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,282 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 925 transitions. [2019-10-13 21:11:53,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 925 transitions. [2019-10-13 21:11:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:11:53,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,286 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:53,286 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash 644803690, now seen corresponding path program 1 times [2019-10-13 21:11:53,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843840800] [2019-10-13 21:11:53,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:53,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843840800] [2019-10-13 21:11:53,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:53,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233533029] [2019-10-13 21:11:53,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:53,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:53,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:53,451 INFO L87 Difference]: Start difference. First operand 588 states and 925 transitions. Second operand 5 states. [2019-10-13 21:11:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,524 INFO L93 Difference]: Finished difference Result 1146 states and 1822 transitions. [2019-10-13 21:11:53,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:53,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-13 21:11:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,531 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:11:53,531 INFO L226 Difference]: Without dead ends: 588 [2019-10-13 21:11:53,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-13 21:11:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-13 21:11:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:11:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 924 transitions. [2019-10-13 21:11:53,563 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 924 transitions. Word has length 120 [2019-10-13 21:11:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,563 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 924 transitions. [2019-10-13 21:11:53,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 924 transitions. [2019-10-13 21:11:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:11:53,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,567 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:53,567 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1883967756, now seen corresponding path program 1 times [2019-10-13 21:11:53,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951039240] [2019-10-13 21:11:53,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:53,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951039240] [2019-10-13 21:11:53,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:53,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673347788] [2019-10-13 21:11:53,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:53,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:53,709 INFO L87 Difference]: Start difference. First operand 588 states and 924 transitions. Second operand 5 states. [2019-10-13 21:11:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,803 INFO L93 Difference]: Finished difference Result 1146 states and 1820 transitions. [2019-10-13 21:11:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-13 21:11:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,811 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:11:53,811 INFO L226 Difference]: Without dead ends: 588 [2019-10-13 21:11:53,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-13 21:11:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-13 21:11:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:11:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 923 transitions. [2019-10-13 21:11:53,854 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 923 transitions. Word has length 121 [2019-10-13 21:11:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,855 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 923 transitions. [2019-10-13 21:11:53,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 923 transitions. [2019-10-13 21:11:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:11:53,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,860 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:53,861 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2119525317, now seen corresponding path program 1 times [2019-10-13 21:11:53,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986470197] [2019-10-13 21:11:53,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:54,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986470197] [2019-10-13 21:11:54,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:54,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:54,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675270328] [2019-10-13 21:11:54,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:54,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:54,070 INFO L87 Difference]: Start difference. First operand 588 states and 923 transitions. Second operand 5 states. [2019-10-13 21:11:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:54,147 INFO L93 Difference]: Finished difference Result 1146 states and 1818 transitions. [2019-10-13 21:11:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:54,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-13 21:11:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:54,154 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:11:54,154 INFO L226 Difference]: Without dead ends: 588 [2019-10-13 21:11:54,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-13 21:11:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-13 21:11:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:11:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 922 transitions. [2019-10-13 21:11:54,179 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 922 transitions. Word has length 122 [2019-10-13 21:11:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:54,179 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 922 transitions. [2019-10-13 21:11:54,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 922 transitions. [2019-10-13 21:11:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:11:54,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:54,183 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:54,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1308052295, now seen corresponding path program 1 times [2019-10-13 21:11:54,184 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:54,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880190708] [2019-10-13 21:11:54,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:54,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880190708] [2019-10-13 21:11:54,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:54,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:54,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539826554] [2019-10-13 21:11:54,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:54,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:54,452 INFO L87 Difference]: Start difference. First operand 588 states and 922 transitions. Second operand 8 states. [2019-10-13 21:11:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:57,251 INFO L93 Difference]: Finished difference Result 2139 states and 3411 transitions. [2019-10-13 21:11:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:11:57,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-13 21:11:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:57,265 INFO L225 Difference]: With dead ends: 2139 [2019-10-13 21:11:57,266 INFO L226 Difference]: Without dead ends: 1585 [2019-10-13 21:11:57,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-13 21:11:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-10-13 21:11:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-13 21:11:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2469 transitions. [2019-10-13 21:11:57,341 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2469 transitions. Word has length 123 [2019-10-13 21:11:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:57,342 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2469 transitions. [2019-10-13 21:11:57,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:11:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2469 transitions. [2019-10-13 21:11:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:11:57,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:57,346 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:57,347 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1202656165, now seen corresponding path program 1 times [2019-10-13 21:11:57,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:57,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825169430] [2019-10-13 21:11:57,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:11:57,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825169430] [2019-10-13 21:11:57,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840217941] [2019-10-13 21:11:57,570 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:11:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:58,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:58,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:58,221 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:58,347 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:58,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:58,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227673746] [2019-10-13 21:11:58,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:58,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:58,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:58,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:58,349 INFO L87 Difference]: Start difference. First operand 1573 states and 2469 transitions. Second operand 3 states. [2019-10-13 21:11:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:58,496 INFO L93 Difference]: Finished difference Result 4523 states and 7237 transitions. [2019-10-13 21:11:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:58,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-13 21:11:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:58,520 INFO L225 Difference]: With dead ends: 4523 [2019-10-13 21:11:58,521 INFO L226 Difference]: Without dead ends: 2984 [2019-10-13 21:11:58,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2019-10-13 21:11:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2878. [2019-10-13 21:11:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2019-10-13 21:11:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 4582 transitions. [2019-10-13 21:11:58,669 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 4582 transitions. Word has length 128 [2019-10-13 21:11:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:58,669 INFO L462 AbstractCegarLoop]: Abstraction has 2878 states and 4582 transitions. [2019-10-13 21:11:58,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 4582 transitions. [2019-10-13 21:11:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:11:58,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:58,674 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:58,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:58,882 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash -506812357, now seen corresponding path program 1 times [2019-10-13 21:11:58,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:58,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208781611] [2019-10-13 21:11:58,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:58,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:58,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:59,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208781611] [2019-10-13 21:11:59,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:59,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:59,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235482550] [2019-10-13 21:11:59,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:59,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:59,201 INFO L87 Difference]: Start difference. First operand 2878 states and 4582 transitions. Second operand 7 states. [2019-10-13 21:12:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:01,822 INFO L93 Difference]: Finished difference Result 8538 states and 13901 transitions. [2019-10-13 21:12:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:01,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-13 21:12:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:01,877 INFO L225 Difference]: With dead ends: 8538 [2019-10-13 21:12:01,877 INFO L226 Difference]: Without dead ends: 5694 [2019-10-13 21:12:01,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2019-10-13 21:12:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5610. [2019-10-13 21:12:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2019-10-13 21:12:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 9071 transitions. [2019-10-13 21:12:02,254 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 9071 transitions. Word has length 132 [2019-10-13 21:12:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:02,255 INFO L462 AbstractCegarLoop]: Abstraction has 5610 states and 9071 transitions. [2019-10-13 21:12:02,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 9071 transitions. [2019-10-13 21:12:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:12:02,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:02,261 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:02,262 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1018134929, now seen corresponding path program 1 times [2019-10-13 21:12:02,263 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:02,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764600912] [2019-10-13 21:12:02,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:02,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764600912] [2019-10-13 21:12:02,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:02,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:02,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472669019] [2019-10-13 21:12:02,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:02,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:02,439 INFO L87 Difference]: Start difference. First operand 5610 states and 9071 transitions. Second operand 4 states. [2019-10-13 21:12:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:02,701 INFO L93 Difference]: Finished difference Result 11174 states and 18235 transitions. [2019-10-13 21:12:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:02,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-13 21:12:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:02,765 INFO L225 Difference]: With dead ends: 11174 [2019-10-13 21:12:02,765 INFO L226 Difference]: Without dead ends: 5598 [2019-10-13 21:12:02,820 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:12:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2019-10-13 21:12:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5580. [2019-10-13 21:12:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-10-13 21:12:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 8983 transitions. [2019-10-13 21:12:03,178 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 8983 transitions. Word has length 133 [2019-10-13 21:12:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:03,181 INFO L462 AbstractCegarLoop]: Abstraction has 5580 states and 8983 transitions. [2019-10-13 21:12:03,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 8983 transitions. [2019-10-13 21:12:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:12:03,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:03,188 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,188 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash -108983869, now seen corresponding path program 1 times [2019-10-13 21:12:03,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:03,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812959209] [2019-10-13 21:12:03,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:03,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:03,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:12:03,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812959209] [2019-10-13 21:12:03,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308384937] [2019-10-13 21:12:03,421 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:12:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:04,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 3003 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:12:04,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:04,581 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:04,740 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:04,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:12:04,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410773670] [2019-10-13 21:12:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:04,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:04,752 INFO L87 Difference]: Start difference. First operand 5580 states and 8983 transitions. Second operand 3 states. [2019-10-13 21:12:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:05,100 INFO L93 Difference]: Finished difference Result 12293 states and 19979 transitions. [2019-10-13 21:12:05,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:05,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-13 21:12:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:05,219 INFO L225 Difference]: With dead ends: 12293 [2019-10-13 21:12:05,219 INFO L226 Difference]: Without dead ends: 6747 [2019-10-13 21:12:05,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2019-10-13 21:12:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 6558. [2019-10-13 21:12:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6558 states. [2019-10-13 21:12:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 10565 transitions. [2019-10-13 21:12:05,548 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 10565 transitions. Word has length 129 [2019-10-13 21:12:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:05,549 INFO L462 AbstractCegarLoop]: Abstraction has 6558 states and 10565 transitions. [2019-10-13 21:12:05,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 10565 transitions. [2019-10-13 21:12:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:12:05,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:05,554 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:05,770 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1579181484, now seen corresponding path program 1 times [2019-10-13 21:12:05,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:05,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562749315] [2019-10-13 21:12:05,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:05,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:12:06,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562749315] [2019-10-13 21:12:06,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:06,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:06,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032847972] [2019-10-13 21:12:06,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:06,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:06,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:06,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:06,009 INFO L87 Difference]: Start difference. First operand 6558 states and 10565 transitions. Second operand 7 states. [2019-10-13 21:12:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:08,869 INFO L93 Difference]: Finished difference Result 19628 states and 32341 transitions. [2019-10-13 21:12:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:08,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-13 21:12:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:08,978 INFO L225 Difference]: With dead ends: 19628 [2019-10-13 21:12:08,979 INFO L226 Difference]: Without dead ends: 13104 [2019-10-13 21:12:09,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13104 states. [2019-10-13 21:12:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13104 to 12976. [2019-10-13 21:12:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12976 states. [2019-10-13 21:12:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12976 states to 12976 states and 21270 transitions. [2019-10-13 21:12:09,612 INFO L78 Accepts]: Start accepts. Automaton has 12976 states and 21270 transitions. Word has length 140 [2019-10-13 21:12:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:09,614 INFO L462 AbstractCegarLoop]: Abstraction has 12976 states and 21270 transitions. [2019-10-13 21:12:09,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 12976 states and 21270 transitions. [2019-10-13 21:12:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:12:09,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:09,619 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:09,619 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1257079614, now seen corresponding path program 1 times [2019-10-13 21:12:09,620 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:09,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864581354] [2019-10-13 21:12:09,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:09,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:09,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:12:09,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864581354] [2019-10-13 21:12:09,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:09,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:09,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689931358] [2019-10-13 21:12:09,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:09,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:09,764 INFO L87 Difference]: Start difference. First operand 12976 states and 21270 transitions. Second operand 4 states. [2019-10-13 21:12:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:10,252 INFO L93 Difference]: Finished difference Result 25980 states and 43062 transitions. [2019-10-13 21:12:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:10,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-13 21:12:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:10,372 INFO L225 Difference]: With dead ends: 25980 [2019-10-13 21:12:10,373 INFO L226 Difference]: Without dead ends: 13032 [2019-10-13 21:12:10,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13032 states. [2019-10-13 21:12:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13032 to 12984. [2019-10-13 21:12:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12984 states. [2019-10-13 21:12:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12984 states to 12984 states and 21221 transitions. [2019-10-13 21:12:11,865 INFO L78 Accepts]: Start accepts. Automaton has 12984 states and 21221 transitions. Word has length 141 [2019-10-13 21:12:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:11,865 INFO L462 AbstractCegarLoop]: Abstraction has 12984 states and 21221 transitions. [2019-10-13 21:12:11,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 12984 states and 21221 transitions. [2019-10-13 21:12:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:12:11,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:11,871 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:11,871 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1429526801, now seen corresponding path program 1 times [2019-10-13 21:12:11,872 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:11,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224597654] [2019-10-13 21:12:11,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:11,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:11,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:12:12,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224597654] [2019-10-13 21:12:12,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:12,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:12,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123070608] [2019-10-13 21:12:12,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:12,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:12,031 INFO L87 Difference]: Start difference. First operand 12984 states and 21221 transitions. Second operand 7 states. [2019-10-13 21:12:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:15,222 INFO L93 Difference]: Finished difference Result 39022 states and 65663 transitions. [2019-10-13 21:12:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:15,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-10-13 21:12:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:15,433 INFO L225 Difference]: With dead ends: 39022 [2019-10-13 21:12:15,434 INFO L226 Difference]: Without dead ends: 26072 [2019-10-13 21:12:15,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26072 states.