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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 14:10:46,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 14:10:46,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 14:10:46,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 14:10:46,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 14:10:46,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 14:10:46,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 14:10:46,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 14:10:46,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 14:10:46,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 14:10:46,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 14:10:46,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 14:10:46,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 14:10:46,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 14:10:46,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 14:10:46,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 14:10:46,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 14:10:46,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 14:10:46,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 14:10:46,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 14:10:46,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 14:10:46,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 14:10:46,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 14:10:46,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 14:10:46,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 14:10:46,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 14:10:46,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 14:10:46,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 14:10:46,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 14:10:46,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 14:10:46,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 14:10:46,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 14:10:46,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 14:10:46,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 14:10:46,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 14:10:46,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 14:10:46,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 14:10:46,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 14:10:46,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 14:10:46,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 14:10:46,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 14:10:46,969 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-07 14:10:46,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 14:10:46,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 14:10:46,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 14:10:46,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 14:10:46,985 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 14:10:46,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 14:10:46,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 14:10:46,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 14:10:46,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 14:10:46,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 14:10:46,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 14:10:46,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 14:10:46,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 14:10:46,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 14:10:46,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 14:10:46,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 14:10:46,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 14:10:46,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 14:10:46,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 14:10:46,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 14:10:46,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 14:10:46,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:10:46,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 14:10:46,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 14:10:46,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 14:10:46,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 14:10:46,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 14:10:46,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 14:10:46,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 14:10:47,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 14:10:47,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 14:10:47,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 14:10:47,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 14:10:47,317 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 14:10:47,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product30.cil.c [2019-10-07 14:10:47,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1660df73d/4076bb6030d448f4a6257222d90c3b95/FLAG06d567d7a [2019-10-07 14:10:47,993 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 14:10:47,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product30.cil.c [2019-10-07 14:10:48,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1660df73d/4076bb6030d448f4a6257222d90c3b95/FLAG06d567d7a [2019-10-07 14:10:48,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1660df73d/4076bb6030d448f4a6257222d90c3b95 [2019-10-07 14:10:48,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 14:10:48,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 14:10:48,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 14:10:48,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 14:10:48,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 14:10:48,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:10:48" (1/1) ... [2019-10-07 14:10:48,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7ce1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:48, skipping insertion in model container [2019-10-07 14:10:48,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:10:48" (1/1) ... [2019-10-07 14:10:48,222 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 14:10:48,307 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 14:10:48,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:10:48,989 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 14:10:49,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:10:49,186 INFO L192 MainTranslator]: Completed translation [2019-10-07 14:10:49,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49 WrapperNode [2019-10-07 14:10:49,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 14:10:49,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 14:10:49,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 14:10:49,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 14:10:49,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (1/1) ... [2019-10-07 14:10:49,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 14:10:49,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 14:10:49,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 14:10:49,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 14:10:49,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (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-07 14:10:49,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 14:10:49,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 14:10:49,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 14:10:49,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 14:10:49,483 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-07 14:10:49,483 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-07 14:10:49,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 14:10:49,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 14:10:49,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 14:10:49,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 14:10:49,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 14:10:49,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 14:10:49,485 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 14:10:49,485 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 14:10:49,485 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 14:10:49,485 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 14:10:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 14:10:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-07 14:10:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-07 14:10:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-07 14:10:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-07 14:10:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-07 14:10:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-07 14:10:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-07 14:10:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-07 14:10:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-07 14:10:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-07 14:10:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-07 14:10:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-07 14:10:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-07 14:10:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-07 14:10:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 14:10:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-07 14:10:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 14:10:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-07 14:10:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-07 14:10:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-07 14:10:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-07 14:10:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-07 14:10:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-07 14:10:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-07 14:10:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-07 14:10:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-07 14:10:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-07 14:10:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-07 14:10:49,492 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-07 14:10:49,492 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-07 14:10:49,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-07 14:10:49,492 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-07 14:10:49,492 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-07 14:10:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-07 14:10:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-07 14:10:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-07 14:10:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-07 14:10:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-07 14:10:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-07 14:10:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-07 14:10:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-07 14:10:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-07 14:10:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-07 14:10:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-07 14:10:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-07 14:10:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-07 14:10:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-07 14:10:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-07 14:10:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-07 14:10:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-07 14:10:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-07 14:10:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-07 14:10:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-07 14:10:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-07 14:10:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-07 14:10:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-07 14:10:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-07 14:10:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-07 14:10:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-07 14:10:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-07 14:10:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-07 14:10:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-07 14:10:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 14:10:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 14:10:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 14:10:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-07 14:10:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-07 14:10:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-07 14:10:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-07 14:10:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-07 14:10:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-07 14:10:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-07 14:10:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-07 14:10:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-07 14:10:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 14:10:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 14:10:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 14:10:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 14:10:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 14:10:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 14:10:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 14:10:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 14:10:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 14:10:49,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 14:10:49,503 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 14:10:49,503 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 14:10:49,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 14:10:49,503 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 14:10:49,503 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 14:10:49,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 14:10:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 14:10:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-07 14:10:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-07 14:10:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-07 14:10:49,505 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 14:10:49,505 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 14:10:49,505 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 14:10:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 14:10:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 14:10:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 14:10:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-07 14:10:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-07 14:10:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-07 14:10:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-07 14:10:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-07 14:10:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-07 14:10:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-07 14:10:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-07 14:10:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-07 14:10:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-07 14:10:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-07 14:10:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-07 14:10:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 14:10:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-07 14:10:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-07 14:10:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-07 14:10:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 14:10:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-07 14:10:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-07 14:10:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-07 14:10:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-07 14:10:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-07 14:10:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-07 14:10:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-07 14:10:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-07 14:10:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-07 14:10:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-07 14:10:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 14:10:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-07 14:10:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-07 14:10:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-07 14:10:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-07 14:10:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-07 14:10:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-07 14:10:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-07 14:10:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-07 14:10:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-07 14:10:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-07 14:10:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-07 14:10:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-07 14:10:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-07 14:10:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-07 14:10:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-07 14:10:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-07 14:10:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-07 14:10:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-07 14:10:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-07 14:10:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-07 14:10:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-07 14:10:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-07 14:10:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-07 14:10:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-07 14:10:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-07 14:10:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 14:10:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 14:10:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 14:10:54,687 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 14:10:54,688 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-07 14:10:54,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:10:54 BoogieIcfgContainer [2019-10-07 14:10:54,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 14:10:54,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 14:10:54,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 14:10:54,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 14:10:54,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:10:48" (1/3) ... [2019-10-07 14:10:54,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321a5bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:10:54, skipping insertion in model container [2019-10-07 14:10:54,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:10:49" (2/3) ... [2019-10-07 14:10:54,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321a5bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:10:54, skipping insertion in model container [2019-10-07 14:10:54,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:10:54" (3/3) ... [2019-10-07 14:10:54,697 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product30.cil.c [2019-10-07 14:10:54,706 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 14:10:54,717 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 14:10:54,728 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 14:10:54,775 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 14:10:54,775 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 14:10:54,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 14:10:54,776 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 14:10:54,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 14:10:54,776 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 14:10:54,776 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 14:10:54,776 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 14:10:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-10-07 14:10:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 14:10:54,824 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:10:54,825 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:10:54,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:10:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:10:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1200228914, now seen corresponding path program 1 times [2019-10-07 14:10:54,842 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:10:54,842 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:10:54,842 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:10:54,842 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:10:54,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:10:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:10:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 14:10:55,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:10:55,454 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:10:55,454 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 14:10:55,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 14:10:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 14:10:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 14:10:55,481 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 2 states. [2019-10-07 14:10:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:10:55,605 INFO L93 Difference]: Finished difference Result 493 states and 729 transitions. [2019-10-07 14:10:55,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 14:10:55,608 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 97 [2019-10-07 14:10:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:10:55,648 INFO L225 Difference]: With dead ends: 493 [2019-10-07 14:10:55,649 INFO L226 Difference]: Without dead ends: 459 [2019-10-07 14:10:55,657 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 14:10:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-07 14:10:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2019-10-07 14:10:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-07 14:10:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 678 transitions. [2019-10-07 14:10:55,797 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 678 transitions. Word has length 97 [2019-10-07 14:10:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:10:55,800 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 678 transitions. [2019-10-07 14:10:55,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 14:10:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 678 transitions. [2019-10-07 14:10:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 14:10:55,814 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:10:55,814 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:10:55,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:10:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:10:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1372761545, now seen corresponding path program 1 times [2019-10-07 14:10:55,816 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:10:55,816 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:10:55,816 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:10:55,816 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:10:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:10:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:10:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 14:10:56,313 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:10:56,314 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:10:56,314 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:10:56,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:10:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:10:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:10:56,320 INFO L87 Difference]: Start difference. First operand 459 states and 678 transitions. Second operand 9 states. [2019-10-07 14:11:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:01,699 INFO L93 Difference]: Finished difference Result 1238 states and 1874 transitions. [2019-10-07 14:11:01,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 14:11:01,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-07 14:11:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:01,710 INFO L225 Difference]: With dead ends: 1238 [2019-10-07 14:11:01,711 INFO L226 Difference]: Without dead ends: 832 [2019-10-07 14:11:01,729 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-07 14:11:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-10-07 14:11:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 801. [2019-10-07 14:11:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-10-07 14:11:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1172 transitions. [2019-10-07 14:11:01,803 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1172 transitions. Word has length 98 [2019-10-07 14:11:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:01,804 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1172 transitions. [2019-10-07 14:11:01,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:11:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1172 transitions. [2019-10-07 14:11:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 14:11:01,806 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:01,806 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:01,806 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:01,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1341462773, now seen corresponding path program 1 times [2019-10-07 14:11:01,807 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:01,807 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:01,807 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:01,807 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:02,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:02,046 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:02,047 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:11:02,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:11:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:11:02,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:11:02,049 INFO L87 Difference]: Start difference. First operand 801 states and 1172 transitions. Second operand 3 states. [2019-10-07 14:11:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:02,172 INFO L93 Difference]: Finished difference Result 2289 states and 3399 transitions. [2019-10-07 14:11:02,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:11:02,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-07 14:11:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:02,190 INFO L225 Difference]: With dead ends: 2289 [2019-10-07 14:11:02,190 INFO L226 Difference]: Without dead ends: 1543 [2019-10-07 14:11:02,197 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:11:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2019-10-07 14:11:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1536. [2019-10-07 14:11:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2019-10-07 14:11:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2272 transitions. [2019-10-07 14:11:02,315 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2272 transitions. Word has length 100 [2019-10-07 14:11:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:02,317 INFO L462 AbstractCegarLoop]: Abstraction has 1536 states and 2272 transitions. [2019-10-07 14:11:02,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:11:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2272 transitions. [2019-10-07 14:11:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-07 14:11:02,326 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:02,327 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:02,327 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1364638279, now seen corresponding path program 1 times [2019-10-07 14:11:02,328 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:02,328 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:02,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:02,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:02,617 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:02,617 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:02,617 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:11:02,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:11:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:11:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:11:02,618 INFO L87 Difference]: Start difference. First operand 1536 states and 2272 transitions. Second operand 6 states. [2019-10-07 14:11:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:05,551 INFO L93 Difference]: Finished difference Result 4869 states and 7365 transitions. [2019-10-07 14:11:05,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:11:05,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-07 14:11:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:05,576 INFO L225 Difference]: With dead ends: 4869 [2019-10-07 14:11:05,576 INFO L226 Difference]: Without dead ends: 3389 [2019-10-07 14:11:05,584 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:11:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2019-10-07 14:11:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3070. [2019-10-07 14:11:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2019-10-07 14:11:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4643 transitions. [2019-10-07 14:11:05,757 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4643 transitions. Word has length 101 [2019-10-07 14:11:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:05,758 INFO L462 AbstractCegarLoop]: Abstraction has 3070 states and 4643 transitions. [2019-10-07 14:11:05,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:11:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4643 transitions. [2019-10-07 14:11:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-07 14:11:05,762 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:05,762 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:05,763 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -744602622, now seen corresponding path program 1 times [2019-10-07 14:11:05,763 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:05,764 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:05,764 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:05,764 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:06,016 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:06,016 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:06,016 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 14:11:06,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 14:11:06,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 14:11:06,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-07 14:11:06,017 INFO L87 Difference]: Start difference. First operand 3070 states and 4643 transitions. Second operand 12 states. [2019-10-07 14:11:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:13,195 INFO L93 Difference]: Finished difference Result 9200 states and 13920 transitions. [2019-10-07 14:11:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-07 14:11:13,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2019-10-07 14:11:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:13,237 INFO L225 Difference]: With dead ends: 9200 [2019-10-07 14:11:13,237 INFO L226 Difference]: Without dead ends: 6185 [2019-10-07 14:11:13,256 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-07 14:11:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6185 states. [2019-10-07 14:11:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6185 to 6083. [2019-10-07 14:11:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6083 states. [2019-10-07 14:11:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6083 states to 6083 states and 9110 transitions. [2019-10-07 14:11:13,604 INFO L78 Accepts]: Start accepts. Automaton has 6083 states and 9110 transitions. Word has length 139 [2019-10-07 14:11:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 6083 states and 9110 transitions. [2019-10-07 14:11:13,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 14:11:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6083 states and 9110 transitions. [2019-10-07 14:11:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 14:11:13,610 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:13,610 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:13,611 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1173946682, now seen corresponding path program 1 times [2019-10-07 14:11:13,613 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:13,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:13,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:13,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:13,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:13,882 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:13,882 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:11:13,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:11:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:11:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:11:13,887 INFO L87 Difference]: Start difference. First operand 6083 states and 9110 transitions. Second operand 9 states. [2019-10-07 14:11:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:18,696 INFO L93 Difference]: Finished difference Result 15437 states and 23114 transitions. [2019-10-07 14:11:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 14:11:18,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2019-10-07 14:11:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:18,756 INFO L225 Difference]: With dead ends: 15437 [2019-10-07 14:11:18,757 INFO L226 Difference]: Without dead ends: 9413 [2019-10-07 14:11:18,791 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-07 14:11:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9413 states. [2019-10-07 14:11:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9413 to 9062. [2019-10-07 14:11:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9062 states. [2019-10-07 14:11:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9062 states to 9062 states and 13563 transitions. [2019-10-07 14:11:19,285 INFO L78 Accepts]: Start accepts. Automaton has 9062 states and 13563 transitions. Word has length 140 [2019-10-07 14:11:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:19,286 INFO L462 AbstractCegarLoop]: Abstraction has 9062 states and 13563 transitions. [2019-10-07 14:11:19,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:11:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 9062 states and 13563 transitions. [2019-10-07 14:11:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-07 14:11:19,290 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:19,290 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:19,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash 398780685, now seen corresponding path program 1 times [2019-10-07 14:11:19,291 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:19,291 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:19,291 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:19,292 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:19,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:19,659 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:19,659 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:11:19,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:11:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:11:19,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:19,661 INFO L87 Difference]: Start difference. First operand 9062 states and 13563 transitions. Second operand 7 states. [2019-10-07 14:11:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:20,021 INFO L93 Difference]: Finished difference Result 17046 states and 25658 transitions. [2019-10-07 14:11:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:11:20,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-07 14:11:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:20,086 INFO L225 Difference]: With dead ends: 17046 [2019-10-07 14:11:20,087 INFO L226 Difference]: Without dead ends: 9362 [2019-10-07 14:11:20,117 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9362 states. [2019-10-07 14:11:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9362 to 9234. [2019-10-07 14:11:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-10-07 14:11:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 13803 transitions. [2019-10-07 14:11:20,562 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 13803 transitions. Word has length 144 [2019-10-07 14:11:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:20,564 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 13803 transitions. [2019-10-07 14:11:20,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:11:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 13803 transitions. [2019-10-07 14:11:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 14:11:20,570 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:20,570 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:20,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash -884627591, now seen corresponding path program 1 times [2019-10-07 14:11:20,571 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:20,571 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:20,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:20,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:20,767 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:20,767 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:20,767 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:11:20,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:11:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:11:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:20,769 INFO L87 Difference]: Start difference. First operand 9234 states and 13803 transitions. Second operand 7 states. [2019-10-07 14:11:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:21,168 INFO L93 Difference]: Finished difference Result 17322 states and 26018 transitions. [2019-10-07 14:11:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:11:21,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-07 14:11:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:21,214 INFO L225 Difference]: With dead ends: 17322 [2019-10-07 14:11:21,215 INFO L226 Difference]: Without dead ends: 9494 [2019-10-07 14:11:21,246 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9494 states. [2019-10-07 14:11:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9494 to 9254. [2019-10-07 14:11:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9254 states. [2019-10-07 14:11:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9254 states to 9254 states and 13823 transitions. [2019-10-07 14:11:21,667 INFO L78 Accepts]: Start accepts. Automaton has 9254 states and 13823 transitions. Word has length 145 [2019-10-07 14:11:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:21,669 INFO L462 AbstractCegarLoop]: Abstraction has 9254 states and 13823 transitions. [2019-10-07 14:11:21,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:11:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9254 states and 13823 transitions. [2019-10-07 14:11:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 14:11:21,673 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:21,673 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:21,673 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:21,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1558589095, now seen corresponding path program 1 times [2019-10-07 14:11:21,674 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:21,674 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:21,674 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:21,675 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:21,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:21,873 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:21,874 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:11:21,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:11:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:11:21,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:21,875 INFO L87 Difference]: Start difference. First operand 9254 states and 13823 transitions. Second operand 7 states. [2019-10-07 14:11:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:22,287 INFO L93 Difference]: Finished difference Result 17314 states and 25986 transitions. [2019-10-07 14:11:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:11:22,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-07 14:11:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:22,329 INFO L225 Difference]: With dead ends: 17314 [2019-10-07 14:11:22,330 INFO L226 Difference]: Without dead ends: 9470 [2019-10-07 14:11:22,350 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9470 states. [2019-10-07 14:11:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9470 to 9238. [2019-10-07 14:11:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2019-10-07 14:11:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 13787 transitions. [2019-10-07 14:11:22,812 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 13787 transitions. Word has length 145 [2019-10-07 14:11:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:22,814 INFO L462 AbstractCegarLoop]: Abstraction has 9238 states and 13787 transitions. [2019-10-07 14:11:22,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:11:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 13787 transitions. [2019-10-07 14:11:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-07 14:11:22,821 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:22,821 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:22,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash -302252497, now seen corresponding path program 1 times [2019-10-07 14:11:22,822 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:22,822 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:22,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:22,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:23,051 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:23,052 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:23,052 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:11:23,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:11:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:11:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:11:23,055 INFO L87 Difference]: Start difference. First operand 9238 states and 13787 transitions. Second operand 9 states. [2019-10-07 14:11:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:23,762 INFO L93 Difference]: Finished difference Result 19066 states and 28998 transitions. [2019-10-07 14:11:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 14:11:23,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-07 14:11:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:23,831 INFO L225 Difference]: With dead ends: 19066 [2019-10-07 14:11:23,831 INFO L226 Difference]: Without dead ends: 10742 [2019-10-07 14:11:23,858 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 14:11:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10742 states. [2019-10-07 14:11:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10742 to 10742. [2019-10-07 14:11:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10742 states. [2019-10-07 14:11:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10742 states to 10742 states and 15987 transitions. [2019-10-07 14:11:24,442 INFO L78 Accepts]: Start accepts. Automaton has 10742 states and 15987 transitions. Word has length 151 [2019-10-07 14:11:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:24,444 INFO L462 AbstractCegarLoop]: Abstraction has 10742 states and 15987 transitions. [2019-10-07 14:11:24,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:11:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10742 states and 15987 transitions. [2019-10-07 14:11:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-07 14:11:24,448 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:24,449 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:24,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1118132953, now seen corresponding path program 1 times [2019-10-07 14:11:24,449 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:24,450 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:24,450 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:24,450 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:24,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:24,627 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:24,628 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:11:24,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:11:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:11:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:11:24,629 INFO L87 Difference]: Start difference. First operand 10742 states and 15987 transitions. Second operand 6 states. [2019-10-07 14:11:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:30,133 INFO L93 Difference]: Finished difference Result 33361 states and 50973 transitions. [2019-10-07 14:11:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 14:11:30,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-07 14:11:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:30,250 INFO L225 Difference]: With dead ends: 33361 [2019-10-07 14:11:30,250 INFO L226 Difference]: Without dead ends: 22678 [2019-10-07 14:11:30,291 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:11:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22678 states. [2019-10-07 14:11:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22678 to 21896. [2019-10-07 14:11:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-10-07 14:11:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32851 transitions. [2019-10-07 14:11:32,331 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32851 transitions. Word has length 152 [2019-10-07 14:11:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:32,332 INFO L462 AbstractCegarLoop]: Abstraction has 21896 states and 32851 transitions. [2019-10-07 14:11:32,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:11:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32851 transitions. [2019-10-07 14:11:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-07 14:11:32,336 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:32,337 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:32,337 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1229890671, now seen corresponding path program 1 times [2019-10-07 14:11:32,338 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:32,338 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:32,338 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:32,338 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:11:32,499 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:32,499 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:32,499 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:11:32,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:11:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:11:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:11:32,500 INFO L87 Difference]: Start difference. First operand 21896 states and 32851 transitions. Second operand 7 states. [2019-10-07 14:11:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:36,264 INFO L93 Difference]: Finished difference Result 41362 states and 62359 transitions. [2019-10-07 14:11:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 14:11:36,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-07 14:11:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:36,359 INFO L225 Difference]: With dead ends: 41362 [2019-10-07 14:11:36,360 INFO L226 Difference]: Without dead ends: 22527 [2019-10-07 14:11:36,414 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-07 14:11:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2019-10-07 14:11:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 22168. [2019-10-07 14:11:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22168 states. [2019-10-07 14:11:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22168 states to 22168 states and 33211 transitions. [2019-10-07 14:11:37,744 INFO L78 Accepts]: Start accepts. Automaton has 22168 states and 33211 transitions. Word has length 153 [2019-10-07 14:11:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:37,745 INFO L462 AbstractCegarLoop]: Abstraction has 22168 states and 33211 transitions. [2019-10-07 14:11:37,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:11:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22168 states and 33211 transitions. [2019-10-07 14:11:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 14:11:37,750 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:37,750 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:37,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1135772743, now seen corresponding path program 1 times [2019-10-07 14:11:37,751 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:37,751 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:37,751 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:37,751 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:11:37,939 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:37,939 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:37,939 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:11:37,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:11:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:11:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:11:37,941 INFO L87 Difference]: Start difference. First operand 22168 states and 33211 transitions. Second operand 6 states. [2019-10-07 14:11:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:39,141 INFO L93 Difference]: Finished difference Result 22285 states and 33425 transitions. [2019-10-07 14:11:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:11:39,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-10-07 14:11:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:39,237 INFO L225 Difference]: With dead ends: 22285 [2019-10-07 14:11:39,237 INFO L226 Difference]: Without dead ends: 22262 [2019-10-07 14:11:39,254 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:11:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22262 states. [2019-10-07 14:11:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22262 to 22182. [2019-10-07 14:11:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22182 states. [2019-10-07 14:11:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22182 states to 22182 states and 33225 transitions. [2019-10-07 14:11:41,046 INFO L78 Accepts]: Start accepts. Automaton has 22182 states and 33225 transitions. Word has length 157 [2019-10-07 14:11:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:41,047 INFO L462 AbstractCegarLoop]: Abstraction has 22182 states and 33225 transitions. [2019-10-07 14:11:41,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:11:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22182 states and 33225 transitions. [2019-10-07 14:11:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-07 14:11:41,052 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:41,053 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:11:41,053 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash -722189888, now seen corresponding path program 1 times [2019-10-07 14:11:41,053 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:41,054 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:41,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:41,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:11:41,228 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:41,228 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:11:41,228 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:11:41,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:11:41,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:11:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:11:41,229 INFO L87 Difference]: Start difference. First operand 22182 states and 33225 transitions. Second operand 9 states. [2019-10-07 14:11:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:42,443 INFO L93 Difference]: Finished difference Result 23160 states and 34613 transitions. [2019-10-07 14:11:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 14:11:42,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-07 14:11:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:42,522 INFO L225 Difference]: With dead ends: 23160 [2019-10-07 14:11:42,522 INFO L226 Difference]: Without dead ends: 23137 [2019-10-07 14:11:42,535 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-07 14:11:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23137 states. [2019-10-07 14:11:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23137 to 22694. [2019-10-07 14:11:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22694 states. [2019-10-07 14:11:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22694 states to 22694 states and 33903 transitions. [2019-10-07 14:11:43,320 INFO L78 Accepts]: Start accepts. Automaton has 22694 states and 33903 transitions. Word has length 162 [2019-10-07 14:11:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:43,321 INFO L462 AbstractCegarLoop]: Abstraction has 22694 states and 33903 transitions. [2019-10-07 14:11:43,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:11:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 22694 states and 33903 transitions. [2019-10-07 14:11:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-07 14:11:43,326 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:43,326 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 14:11:43,327 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1781603140, now seen corresponding path program 1 times [2019-10-07 14:11:43,327 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:43,327 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:43,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:43,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:43,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 14:11:44,059 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:44,059 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:11:44,059 INFO L95 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-07 14:11:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:44,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 3581 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 14:11:44,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:11:44,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 14:11:45,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:11:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 14:11:45,807 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 14:11:45,808 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [26] total 31 [2019-10-07 14:11:45,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:11:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:11:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2019-10-07 14:11:45,811 INFO L87 Difference]: Start difference. First operand 22694 states and 33903 transitions. Second operand 7 states. [2019-10-07 14:11:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:11:46,696 INFO L93 Difference]: Finished difference Result 22939 states and 34244 transitions. [2019-10-07 14:11:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:11:46,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2019-10-07 14:11:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:11:46,796 INFO L225 Difference]: With dead ends: 22939 [2019-10-07 14:11:46,797 INFO L226 Difference]: Without dead ends: 22916 [2019-10-07 14:11:46,817 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2019-10-07 14:11:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-10-07 14:11:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 22870. [2019-10-07 14:11:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22870 states. [2019-10-07 14:11:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22870 states to 22870 states and 34087 transitions. [2019-10-07 14:11:48,419 INFO L78 Accepts]: Start accepts. Automaton has 22870 states and 34087 transitions. Word has length 177 [2019-10-07 14:11:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:11:48,419 INFO L462 AbstractCegarLoop]: Abstraction has 22870 states and 34087 transitions. [2019-10-07 14:11:48,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:11:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22870 states and 34087 transitions. [2019-10-07 14:11:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 14:11:48,426 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:11:48,426 INFO L385 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 14:11:48,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:11:48,636 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:11:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:11:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1289463224, now seen corresponding path program 1 times [2019-10-07 14:11:48,637 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:11:48,637 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:48,637 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:48,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:11:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:11:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 14:11:48,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:11:48,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:11:48,941 INFO L95 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-07 14:11:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:11:49,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 3646 conjuncts, 135 conjunts are in the unsatisfiable core [2019-10-07 14:11:49,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:11:49,990 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-07 14:11:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-07 14:11:50,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:11:50,913 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:11:51,194 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:12:38,781 WARN L191 SmtUtils]: Spent 47.10 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:12:39,719 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:12:39,983 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:13:26,053 WARN L191 SmtUtils]: Spent 45.64 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:13:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:27,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:27,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:27,859 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:13:28,122 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:14:14,229 WARN L191 SmtUtils]: Spent 45.65 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:15:00,955 WARN L191 SmtUtils]: Spent 45.61 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:15:01,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:01,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:01,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:01,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,510 WARN L191 SmtUtils]: Spent 45.45 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:15:47,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:47,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,627 WARN L191 SmtUtils]: Spent 45.29 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:16:33,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:34,094 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:16:34,355 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:16:34,649 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:16:34,912 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:17:20,740 WARN L191 SmtUtils]: Spent 45.42 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:18:07,889 WARN L191 SmtUtils]: Spent 45.98 s on a formula simplification. DAG size of input: 1456 DAG size of output: 55 [2019-10-07 14:18:08,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,150 WARN L191 SmtUtils]: Spent 45.24 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:18:54,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:54,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,841 WARN L191 SmtUtils]: Spent 44.96 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:19:39,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:39,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:19:40,216 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:19:40,478 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:19:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-07 14:19:40,601 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 14:19:40,602 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [12, 15] total 47 [2019-10-07 14:19:40,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 14:19:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 14:19:40,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1968, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 14:19:40,603 INFO L87 Difference]: Start difference. First operand 22870 states and 34087 transitions. Second operand 25 states. [2019-10-07 14:19:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:19:53,050 INFO L93 Difference]: Finished difference Result 40873 states and 61567 transitions. [2019-10-07 14:19:53,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 14:19:53,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 201 [2019-10-07 14:19:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:19:53,148 INFO L225 Difference]: With dead ends: 40873 [2019-10-07 14:19:53,149 INFO L226 Difference]: Without dead ends: 18061 [2019-10-07 14:19:53,214 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 360 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=466, Invalid=3694, Unknown=0, NotChecked=0, Total=4160 [2019-10-07 14:19:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18061 states. [2019-10-07 14:19:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18061 to 17812. [2019-10-07 14:19:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17812 states. [2019-10-07 14:19:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17812 states to 17812 states and 26968 transitions. [2019-10-07 14:19:54,237 INFO L78 Accepts]: Start accepts. Automaton has 17812 states and 26968 transitions. Word has length 201 [2019-10-07 14:19:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:19:54,237 INFO L462 AbstractCegarLoop]: Abstraction has 17812 states and 26968 transitions. [2019-10-07 14:19:54,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 14:19:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17812 states and 26968 transitions. [2019-10-07 14:19:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-07 14:19:54,242 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:19:54,242 INFO L385 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 14:19:54,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:19:54,451 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:19:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:19:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1318342998, now seen corresponding path program 1 times [2019-10-07 14:19:54,451 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:19:54,451 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:19:54,452 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:19:54,452 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:19:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:19:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:19:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 14:19:54,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:19:54,818 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:19:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:19:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:19:55,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 3648 conjuncts, 107 conjunts are in the unsatisfiable core [2019-10-07 14:19:55,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:19:55,901 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-07 14:19:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:19:56,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:19:56,987 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:19:57,241 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:19:57,353 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-07 14:20:43,530 WARN L191 SmtUtils]: Spent 45.85 s on a formula simplification. DAG size of input: 1448 DAG size of output: 51 [2019-10-07 14:20:44,144 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:20:44,400 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:21:30,237 WARN L191 SmtUtils]: Spent 45.44 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:21:31,131 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:21:31,724 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:21:31,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:32,204 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:21:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:32,603 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:21:33,024 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:21:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:21:33,540 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:21:33,794 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:22:18,904 WARN L191 SmtUtils]: Spent 44.70 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55