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_spec9_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 14:33:22,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 14:33:22,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 14:33:22,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 14:33:22,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 14:33:22,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 14:33:22,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 14:33:22,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 14:33:22,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 14:33:22,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 14:33:22,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 14:33:22,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 14:33:22,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 14:33:22,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 14:33:22,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 14:33:22,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 14:33:22,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 14:33:22,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 14:33:22,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 14:33:22,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 14:33:22,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 14:33:22,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 14:33:22,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 14:33:22,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 14:33:22,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 14:33:22,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 14:33:22,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 14:33:22,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 14:33:22,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 14:33:22,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 14:33:22,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 14:33:22,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 14:33:22,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 14:33:22,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 14:33:22,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 14:33:22,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 14:33:22,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 14:33:22,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 14:33:22,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 14:33:22,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 14:33:22,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 14:33:22,612 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:33:22,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 14:33:22,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 14:33:22,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 14:33:22,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 14:33:22,629 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 14:33:22,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 14:33:22,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 14:33:22,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 14:33:22,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 14:33:22,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 14:33:22,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 14:33:22,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 14:33:22,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 14:33:22,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 14:33:22,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 14:33:22,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:33:22,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 14:33:22,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 14:33:22,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 14:33:22,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 14:33:22,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 14:33:22,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 14:33:22,635 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:33:22,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 14:33:22,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 14:33:22,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 14:33:22,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 14:33:22,973 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 14:33:22,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-07 14:33:23,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c8a71913/df0f6133144b49ae804665817faf7455/FLAGdca4622f5 [2019-10-07 14:33:23,758 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 14:33:23,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-07 14:33:23,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c8a71913/df0f6133144b49ae804665817faf7455/FLAGdca4622f5 [2019-10-07 14:33:23,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c8a71913/df0f6133144b49ae804665817faf7455 [2019-10-07 14:33:23,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 14:33:23,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 14:33:23,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 14:33:23,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 14:33:23,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 14:33:23,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:33:23" (1/1) ... [2019-10-07 14:33:23,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1763af5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:23, skipping insertion in model container [2019-10-07 14:33:23,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:33:23" (1/1) ... [2019-10-07 14:33:23,977 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 14:33:24,047 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 14:33:24,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:33:24,775 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 14:33:24,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:33:25,040 INFO L192 MainTranslator]: Completed translation [2019-10-07 14:33:25,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25 WrapperNode [2019-10-07 14:33:25,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 14:33:25,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 14:33:25,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 14:33:25,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 14:33:25,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (1/1) ... [2019-10-07 14:33:25,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 14:33:25,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 14:33:25,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 14:33:25,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 14:33:25,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (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:33:25,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 14:33:25,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 14:33:25,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 14:33:25,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 14:33:25,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 14:33:25,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 14:33:25,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 14:33:25,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 14:33:25,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 14:33:25,345 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 14:33:25,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-07 14:33:25,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-07 14:33:25,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-07 14:33:25,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-07 14:33:25,347 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-07 14:33:25,348 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-07 14:33:25,350 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-07 14:33:25,350 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-07 14:33:25,351 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-07 14:33:25,351 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-07 14:33:25,351 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-07 14:33:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-07 14:33:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-07 14:33:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-07 14:33:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-07 14:33:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-07 14:33:25,352 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-07 14:33:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-07 14:33:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-07 14:33:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-07 14:33:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-07 14:33:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-07 14:33:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-07 14:33:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-07 14:33:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-07 14:33:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-07 14:33:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-07 14:33:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-07 14:33:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-07 14:33:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-07 14:33:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-07 14:33:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-07 14:33:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 14:33:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-07 14:33:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-07 14:33:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-07 14:33:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-07 14:33:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-07 14:33:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-07 14:33:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-07 14:33:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-07 14:33:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-07 14:33:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-07 14:33:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-07 14:33:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-07 14:33:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-07 14:33:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-07 14:33:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-07 14:33:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-07 14:33:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-07 14:33:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-07 14:33:25,361 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-07 14:33:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-07 14:33:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-07 14:33:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-07 14:33:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 14:33:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-07 14:33:25,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 14:33:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-07 14:33:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-07 14:33:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 14:33:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 14:33:25,363 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 14:33:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 14:33:25,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-07 14:33:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-07 14:33:25,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-07 14:33:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 14:33:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 14:33:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 14:33:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 14:33:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 14:33:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 14:33:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 14:33:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 14:33:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 14:33:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 14:33:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 14:33:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 14:33:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 14:33:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 14:33:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 14:33:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 14:33:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 14:33:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 14:33:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 14:33:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-07 14:33:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-07 14:33:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 14:33:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 14:33:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-07 14:33:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-07 14:33:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-07 14:33:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-07 14:33:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-07 14:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-07 14:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-07 14:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 14:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-07 14:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-07 14:33:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-07 14:33:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-07 14:33:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-07 14:33:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-07 14:33:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-07 14:33:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-07 14:33:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-07 14:33:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-07 14:33:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-07 14:33:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-07 14:33:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-07 14:33:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-07 14:33:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-07 14:33:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-07 14:33:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-07 14:33:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-07 14:33:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-07 14:33:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-07 14:33:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-07 14:33:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-07 14:33:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-07 14:33:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-07 14:33:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-07 14:33:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-07 14:33:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-07 14:33:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-07 14:33:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-07 14:33:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-07 14:33:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-07 14:33:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-07 14:33:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-07 14:33:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-07 14:33:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-07 14:33:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 14:33:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-07 14:33:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-07 14:33:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-07 14:33:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-07 14:33:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-07 14:33:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-07 14:33:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-07 14:33:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-07 14:33:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-07 14:33:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 14:33:25,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 14:33:25,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 14:33:25,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 14:33:30,289 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 14:33:30,289 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-07 14:33:30,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:33:30 BoogieIcfgContainer [2019-10-07 14:33:30,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 14:33:30,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 14:33:30,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 14:33:30,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 14:33:30,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:33:23" (1/3) ... [2019-10-07 14:33:30,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5c4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:33:30, skipping insertion in model container [2019-10-07 14:33:30,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:33:25" (2/3) ... [2019-10-07 14:33:30,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5c4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:33:30, skipping insertion in model container [2019-10-07 14:33:30,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:33:30" (3/3) ... [2019-10-07 14:33:30,299 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2019-10-07 14:33:30,308 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 14:33:30,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 14:33:30,329 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 14:33:30,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 14:33:30,360 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 14:33:30,360 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 14:33:30,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 14:33:30,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 14:33:30,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 14:33:30,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 14:33:30,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 14:33:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states. [2019-10-07 14:33:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-07 14:33:30,407 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:30,408 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:30,411 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash 656701151, now seen corresponding path program 1 times [2019-10-07 14:33:30,426 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:30,426 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:30,427 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:30,427 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:33:31,093 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:31,093 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:31,093 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 14:33:31,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 14:33:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 14:33:31,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 14:33:31,118 INFO L87 Difference]: Start difference. First operand 555 states. Second operand 2 states. [2019-10-07 14:33:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:31,195 INFO L93 Difference]: Finished difference Result 452 states and 672 transitions. [2019-10-07 14:33:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 14:33:31,196 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 74 [2019-10-07 14:33:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:31,219 INFO L225 Difference]: With dead ends: 452 [2019-10-07 14:33:31,220 INFO L226 Difference]: Without dead ends: 418 [2019-10-07 14:33:31,224 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:33:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-07 14:33:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-10-07 14:33:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-07 14:33:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2019-10-07 14:33:31,346 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 74 [2019-10-07 14:33:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:31,349 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2019-10-07 14:33:31,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 14:33:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2019-10-07 14:33:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-07 14:33:31,355 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:31,356 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:31,356 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:31,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:31,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1065118318, now seen corresponding path program 1 times [2019-10-07 14:33:31,357 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:31,357 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:31,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:31,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:33:31,757 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:31,758 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:31,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:33:31,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:33:31,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:33:31,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:33:31,765 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 6 states. [2019-10-07 14:33:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:34,979 INFO L93 Difference]: Finished difference Result 1269 states and 1951 transitions. [2019-10-07 14:33:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:33:34,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-10-07 14:33:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:34,989 INFO L225 Difference]: With dead ends: 1269 [2019-10-07 14:33:34,990 INFO L226 Difference]: Without dead ends: 893 [2019-10-07 14:33:34,997 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:33:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-10-07 14:33:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 798. [2019-10-07 14:33:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-10-07 14:33:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1228 transitions. [2019-10-07 14:33:35,107 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1228 transitions. Word has length 75 [2019-10-07 14:33:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:35,108 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 1228 transitions. [2019-10-07 14:33:35,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:33:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1228 transitions. [2019-10-07 14:33:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-07 14:33:35,117 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:35,118 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:35,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:35,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1830198667, now seen corresponding path program 1 times [2019-10-07 14:33:35,119 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:35,119 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:35,119 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:35,119 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:33:35,356 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:35,356 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:35,356 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 14:33:35,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 14:33:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 14:33:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:33:35,358 INFO L87 Difference]: Start difference. First operand 798 states and 1228 transitions. Second operand 8 states. [2019-10-07 14:33:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:35,448 INFO L93 Difference]: Finished difference Result 1647 states and 2585 transitions. [2019-10-07 14:33:35,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:33:35,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-10-07 14:33:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:35,457 INFO L225 Difference]: With dead ends: 1647 [2019-10-07 14:33:35,457 INFO L226 Difference]: Without dead ends: 892 [2019-10-07 14:33:35,462 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:33:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-10-07 14:33:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 806. [2019-10-07 14:33:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-10-07 14:33:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1236 transitions. [2019-10-07 14:33:35,535 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1236 transitions. Word has length 103 [2019-10-07 14:33:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:35,537 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1236 transitions. [2019-10-07 14:33:35,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 14:33:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1236 transitions. [2019-10-07 14:33:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-07 14:33:35,547 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:35,547 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:35,548 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -856895825, now seen corresponding path program 1 times [2019-10-07 14:33:35,549 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:35,549 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:35,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:35,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:33:35,804 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:35,805 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:35,805 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:33:35,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:33:35,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:33:35,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:33:35,809 INFO L87 Difference]: Start difference. First operand 806 states and 1236 transitions. Second operand 5 states. [2019-10-07 14:33:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:35,919 INFO L93 Difference]: Finished difference Result 1581 states and 2452 transitions. [2019-10-07 14:33:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:33:35,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-07 14:33:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:35,928 INFO L225 Difference]: With dead ends: 1581 [2019-10-07 14:33:35,928 INFO L226 Difference]: Without dead ends: 818 [2019-10-07 14:33:35,933 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:33:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-07 14:33:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 814. [2019-10-07 14:33:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-10-07 14:33:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1246 transitions. [2019-10-07 14:33:36,000 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1246 transitions. Word has length 107 [2019-10-07 14:33:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:36,001 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1246 transitions. [2019-10-07 14:33:36,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:33:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1246 transitions. [2019-10-07 14:33:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 14:33:36,011 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:36,012 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1146873374, now seen corresponding path program 1 times [2019-10-07 14:33:36,012 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:36,013 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:36,013 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:36,013 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:33:36,368 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:36,368 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:36,369 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 14:33:36,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 14:33:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 14:33:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-07 14:33:36,371 INFO L87 Difference]: Start difference. First operand 814 states and 1246 transitions. Second operand 12 states. [2019-10-07 14:33:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:43,681 INFO L93 Difference]: Finished difference Result 2421 states and 3726 transitions. [2019-10-07 14:33:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-07 14:33:43,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-10-07 14:33:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:43,700 INFO L225 Difference]: With dead ends: 2421 [2019-10-07 14:33:43,700 INFO L226 Difference]: Without dead ends: 1649 [2019-10-07 14:33:43,708 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-07 14:33:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-10-07 14:33:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1590. [2019-10-07 14:33:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2019-10-07 14:33:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2427 transitions. [2019-10-07 14:33:43,848 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2427 transitions. Word has length 110 [2019-10-07 14:33:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:43,849 INFO L462 AbstractCegarLoop]: Abstraction has 1590 states and 2427 transitions. [2019-10-07 14:33:43,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 14:33:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2427 transitions. [2019-10-07 14:33:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-07 14:33:43,857 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:43,857 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:43,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1346215111, now seen corresponding path program 1 times [2019-10-07 14:33:43,860 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:43,861 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:43,861 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:43,861 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:33:44,102 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:44,103 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:44,103 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:33:44,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:33:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:33:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:33:44,107 INFO L87 Difference]: Start difference. First operand 1590 states and 2427 transitions. Second operand 6 states. [2019-10-07 14:33:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:47,673 INFO L93 Difference]: Finished difference Result 5339 states and 8199 transitions. [2019-10-07 14:33:47,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:33:47,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-10-07 14:33:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:47,702 INFO L225 Difference]: With dead ends: 5339 [2019-10-07 14:33:47,702 INFO L226 Difference]: Without dead ends: 3793 [2019-10-07 14:33:47,711 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:33:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2019-10-07 14:33:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3759. [2019-10-07 14:33:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3759 states. [2019-10-07 14:33:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5690 transitions. [2019-10-07 14:33:47,935 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5690 transitions. Word has length 111 [2019-10-07 14:33:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:47,936 INFO L462 AbstractCegarLoop]: Abstraction has 3759 states and 5690 transitions. [2019-10-07 14:33:47,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:33:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5690 transitions. [2019-10-07 14:33:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-07 14:33:47,939 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:47,940 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:33:47,940 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:47,940 INFO L82 PathProgramCache]: Analyzing trace with hash -642163230, now seen corresponding path program 1 times [2019-10-07 14:33:47,941 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:47,941 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:47,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:47,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 14:33:48,117 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:48,117 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:48,117 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:33:48,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:33:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:33:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:33:48,120 INFO L87 Difference]: Start difference. First operand 3759 states and 5690 transitions. Second operand 3 states. [2019-10-07 14:33:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:48,344 INFO L93 Difference]: Finished difference Result 9557 states and 14696 transitions. [2019-10-07 14:33:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:33:48,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-07 14:33:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:48,395 INFO L225 Difference]: With dead ends: 9557 [2019-10-07 14:33:48,395 INFO L226 Difference]: Without dead ends: 5840 [2019-10-07 14:33:48,417 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:33:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2019-10-07 14:33:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5793. [2019-10-07 14:33:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5793 states. [2019-10-07 14:33:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 8861 transitions. [2019-10-07 14:33:48,846 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 8861 transitions. Word has length 119 [2019-10-07 14:33:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:48,849 INFO L462 AbstractCegarLoop]: Abstraction has 5793 states and 8861 transitions. [2019-10-07 14:33:48,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:33:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 8861 transitions. [2019-10-07 14:33:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-07 14:33:48,853 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:48,853 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:33:48,854 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1566480303, now seen corresponding path program 1 times [2019-10-07 14:33:48,854 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:48,854 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:48,855 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:48,855 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 14:33:49,030 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:49,031 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:49,031 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:33:49,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:33:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:33:49,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:33:49,033 INFO L87 Difference]: Start difference. First operand 5793 states and 8861 transitions. Second operand 3 states. [2019-10-07 14:33:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:49,380 INFO L93 Difference]: Finished difference Result 15660 states and 24495 transitions. [2019-10-07 14:33:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:33:49,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-07 14:33:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:49,450 INFO L225 Difference]: With dead ends: 15660 [2019-10-07 14:33:49,450 INFO L226 Difference]: Without dead ends: 9910 [2019-10-07 14:33:49,481 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:33:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9910 states. [2019-10-07 14:33:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9910 to 9862. [2019-10-07 14:33:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9862 states. [2019-10-07 14:33:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9862 states to 9862 states and 15350 transitions. [2019-10-07 14:33:50,049 INFO L78 Accepts]: Start accepts. Automaton has 9862 states and 15350 transitions. Word has length 120 [2019-10-07 14:33:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:50,051 INFO L462 AbstractCegarLoop]: Abstraction has 9862 states and 15350 transitions. [2019-10-07 14:33:50,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:33:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9862 states and 15350 transitions. [2019-10-07 14:33:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 14:33:50,057 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:50,057 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:33:50,058 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1314956996, now seen corresponding path program 1 times [2019-10-07 14:33:50,058 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:50,059 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:50,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:50,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:50,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 14:33:50,949 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:50,949 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:50,949 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:33:50,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:33:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:33:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:33:50,954 INFO L87 Difference]: Start difference. First operand 9862 states and 15350 transitions. Second operand 3 states. [2019-10-07 14:33:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:51,478 INFO L93 Difference]: Finished difference Result 27867 states and 44898 transitions. [2019-10-07 14:33:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:33:51,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-07 14:33:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:51,595 INFO L225 Difference]: With dead ends: 27867 [2019-10-07 14:33:51,595 INFO L226 Difference]: Without dead ends: 18050 [2019-10-07 14:33:51,646 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:33:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-10-07 14:33:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18001. [2019-10-07 14:33:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18001 states. [2019-10-07 14:33:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18001 states to 18001 states and 28859 transitions. [2019-10-07 14:33:52,703 INFO L78 Accepts]: Start accepts. Automaton has 18001 states and 28859 transitions. Word has length 121 [2019-10-07 14:33:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:52,705 INFO L462 AbstractCegarLoop]: Abstraction has 18001 states and 28859 transitions. [2019-10-07 14:33:52,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:33:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18001 states and 28859 transitions. [2019-10-07 14:33:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-07 14:33:52,711 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:52,711 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:33:52,712 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2107672977, now seen corresponding path program 1 times [2019-10-07 14:33:52,713 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:52,713 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:52,713 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:52,714 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:52,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 14:33:52,912 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:52,912 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:52,912 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:33:52,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:33:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:33:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:33:52,913 INFO L87 Difference]: Start difference. First operand 18001 states and 28859 transitions. Second operand 3 states. [2019-10-07 14:33:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:54,171 INFO L93 Difference]: Finished difference Result 52282 states and 88433 transitions. [2019-10-07 14:33:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:33:54,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-07 14:33:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:54,374 INFO L225 Difference]: With dead ends: 52282 [2019-10-07 14:33:54,374 INFO L226 Difference]: Without dead ends: 34330 [2019-10-07 14:33:54,441 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:33:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34330 states. [2019-10-07 14:33:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34330 to 34280. [2019-10-07 14:33:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34280 states. [2019-10-07 14:33:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34280 states to 34280 states and 57692 transitions. [2019-10-07 14:33:56,042 INFO L78 Accepts]: Start accepts. Automaton has 34280 states and 57692 transitions. Word has length 122 [2019-10-07 14:33:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:56,043 INFO L462 AbstractCegarLoop]: Abstraction has 34280 states and 57692 transitions. [2019-10-07 14:33:56,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:33:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34280 states and 57692 transitions. [2019-10-07 14:33:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-07 14:33:56,047 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:56,047 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:33:56,047 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 912068518, now seen corresponding path program 1 times [2019-10-07 14:33:56,048 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:56,048 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:56,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:56,049 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 14:33:56,184 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:56,185 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:56,185 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:33:56,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:33:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:33:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:33:56,186 INFO L87 Difference]: Start difference. First operand 34280 states and 57692 transitions. Second operand 3 states. [2019-10-07 14:33:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:33:57,953 INFO L93 Difference]: Finished difference Result 36366 states and 61994 transitions. [2019-10-07 14:33:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:33:57,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-07 14:33:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:33:58,136 INFO L225 Difference]: With dead ends: 36366 [2019-10-07 14:33:58,137 INFO L226 Difference]: Without dead ends: 36353 [2019-10-07 14:33:58,166 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:33:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36353 states. [2019-10-07 14:33:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36353 to 36308. [2019-10-07 14:33:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36308 states. [2019-10-07 14:33:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36308 states to 36308 states and 61880 transitions. [2019-10-07 14:33:59,616 INFO L78 Accepts]: Start accepts. Automaton has 36308 states and 61880 transitions. Word has length 123 [2019-10-07 14:33:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:33:59,616 INFO L462 AbstractCegarLoop]: Abstraction has 36308 states and 61880 transitions. [2019-10-07 14:33:59,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:33:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 36308 states and 61880 transitions. [2019-10-07 14:33:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-07 14:33:59,626 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:33:59,626 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1] [2019-10-07 14:33:59,627 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:33:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:33:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 681172953, now seen corresponding path program 1 times [2019-10-07 14:33:59,627 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:33:59,627 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:59,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:59,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:33:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:33:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:33:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-07 14:33:59,849 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:33:59,849 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:33:59,849 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:33:59,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:33:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:33:59,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:33:59,852 INFO L87 Difference]: Start difference. First operand 36308 states and 61880 transitions. Second operand 5 states. [2019-10-07 14:34:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:34:05,106 INFO L93 Difference]: Finished difference Result 115279 states and 206377 transitions. [2019-10-07 14:34:05,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:34:05,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-07 14:34:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:34:05,477 INFO L225 Difference]: With dead ends: 115279 [2019-10-07 14:34:05,478 INFO L226 Difference]: Without dead ends: 79014 [2019-10-07 14:34:05,576 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:34:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79014 states. [2019-10-07 14:34:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79014 to 77673. [2019-10-07 14:34:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77673 states. [2019-10-07 14:34:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77673 states to 77673 states and 137434 transitions. [2019-10-07 14:34:10,691 INFO L78 Accepts]: Start accepts. Automaton has 77673 states and 137434 transitions. Word has length 209 [2019-10-07 14:34:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:34:10,691 INFO L462 AbstractCegarLoop]: Abstraction has 77673 states and 137434 transitions. [2019-10-07 14:34:10,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:34:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 77673 states and 137434 transitions. [2019-10-07 14:34:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-07 14:34:10,701 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:34:10,701 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1] [2019-10-07 14:34:10,701 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:34:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:34:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1270058819, now seen corresponding path program 1 times [2019-10-07 14:34:10,702 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:34:10,702 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:34:10,702 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:34:10,702 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:34:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:34:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:34:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-07 14:34:10,886 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:34:10,886 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:34:10,886 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:34:10,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:34:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:34:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:34:10,888 INFO L87 Difference]: Start difference. First operand 77673 states and 137434 transitions. Second operand 5 states. [2019-10-07 14:34:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:34:21,007 INFO L93 Difference]: Finished difference Result 245232 states and 466042 transitions. [2019-10-07 14:34:21,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:34:21,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-07 14:34:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:34:21,830 INFO L225 Difference]: With dead ends: 245232 [2019-10-07 14:34:21,830 INFO L226 Difference]: Without dead ends: 167602 [2019-10-07 14:34:22,047 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:34:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167602 states. [2019-10-07 14:34:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167602 to 164161. [2019-10-07 14:34:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164161 states. [2019-10-07 14:34:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164161 states to 164161 states and 304795 transitions. [2019-10-07 14:34:33,407 INFO L78 Accepts]: Start accepts. Automaton has 164161 states and 304795 transitions. Word has length 209 [2019-10-07 14:34:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:34:33,408 INFO L462 AbstractCegarLoop]: Abstraction has 164161 states and 304795 transitions. [2019-10-07 14:34:33,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:34:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 164161 states and 304795 transitions. [2019-10-07 14:34:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-07 14:34:33,415 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:34:33,416 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-10-07 14:34:33,416 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:34:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:34:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash 944476295, now seen corresponding path program 1 times [2019-10-07 14:34:33,417 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:34:33,417 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:34:33,417 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:34:33,417 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:34:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:34:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:34:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-07 14:34:33,574 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:34:33,575 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:34:33,575 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:34:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:34:34,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 3678 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 14:34:34,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:34:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 14:34:34,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:34:38,402 WARN L191 SmtUtils]: Spent 3.98 s on a formula simplification that was a NOOP. DAG size: 1 [2019-10-07 14:34:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-07 14:34:38,891 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 14:34:38,891 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 10 [2019-10-07 14:34:38,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:34:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:34:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 14:34:38,893 INFO L87 Difference]: Start difference. First operand 164161 states and 304795 transitions. Second operand 4 states. [2019-10-07 14:34:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:34:48,885 INFO L93 Difference]: Finished difference Result 342319 states and 684054 transitions. [2019-10-07 14:34:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:34:48,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-10-07 14:34:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:34:50,303 INFO L225 Difference]: With dead ends: 342319 [2019-10-07 14:34:50,304 INFO L226 Difference]: Without dead ends: 178201 [2019-10-07 14:34:50,908 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 373 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-07 14:34:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178201 states. [2019-10-07 14:35:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178201 to 178201. [2019-10-07 14:35:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178201 states. [2019-10-07 14:35:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178201 states to 178201 states and 331075 transitions. [2019-10-07 14:35:08,521 INFO L78 Accepts]: Start accepts. Automaton has 178201 states and 331075 transitions. Word has length 187 [2019-10-07 14:35:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:35:08,521 INFO L462 AbstractCegarLoop]: Abstraction has 178201 states and 331075 transitions. [2019-10-07 14:35:08,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:35:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 178201 states and 331075 transitions. [2019-10-07 14:35:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 14:35:08,537 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:35:08,538 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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] [2019-10-07 14:35:08,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:35:08,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:35:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:35:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash -460992063, now seen corresponding path program 1 times [2019-10-07 14:35:08,748 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:35:08,748 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:35:08,749 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:35:08,749 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:35:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:35:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:35:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 14:35:08,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:35:08,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:35:08,972 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:35:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:35:09,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 3683 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 14:35:09,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:35:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-07 14:35:09,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:35:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 14:35:10,397 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 14:35:10,397 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2019-10-07 14:35:10,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:35:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:35:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:35:10,399 INFO L87 Difference]: Start difference. First operand 178201 states and 331075 transitions. Second operand 4 states. [2019-10-07 14:35:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:35:23,998 INFO L93 Difference]: Finished difference Result 370399 states and 736242 transitions. [2019-10-07 14:35:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:35:23,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-07 14:35:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:35:25,465 INFO L225 Difference]: With dead ends: 370399 [2019-10-07 14:35:25,466 INFO L226 Difference]: Without dead ends: 192241 [2019-10-07 14:35:25,944 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:35:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192241 states. [2019-10-07 14:35:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192241 to 192241. [2019-10-07 14:35:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192241 states. [2019-10-07 14:35:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192241 states to 192241 states and 357355 transitions. [2019-10-07 14:35:38,678 INFO L78 Accepts]: Start accepts. Automaton has 192241 states and 357355 transitions. Word has length 192 [2019-10-07 14:35:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:35:38,679 INFO L462 AbstractCegarLoop]: Abstraction has 192241 states and 357355 transitions. [2019-10-07 14:35:38,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:35:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 192241 states and 357355 transitions. [2019-10-07 14:35:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-07 14:35:38,689 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:35:38,690 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 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] [2019-10-07 14:35:38,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:35:38,902 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:35:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:35:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash 848816113, now seen corresponding path program 1 times [2019-10-07 14:35:38,902 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:35:38,902 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:35:38,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:35:38,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:35:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:35:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:35:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-07 14:35:39,071 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:35:39,072 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:35:39,072 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:35:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:35:39,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 3687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 14:35:39,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:35:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-07 14:35:39,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:35:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-07 14:35:40,271 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 14:35:40,272 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2019-10-07 14:35:40,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:35:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:35:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:35:40,273 INFO L87 Difference]: Start difference. First operand 192241 states and 357355 transitions. Second operand 4 states. [2019-10-07 14:35:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:35:55,227 INFO L93 Difference]: Finished difference Result 398479 states and 788430 transitions. [2019-10-07 14:35:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:35:55,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-10-07 14:35:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:35:56,147 INFO L225 Difference]: With dead ends: 398479 [2019-10-07 14:35:56,147 INFO L226 Difference]: Without dead ends: 206281 [2019-10-07 14:35:56,667 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:35:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206281 states. [2019-10-07 14:36:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206281 to 206281. [2019-10-07 14:36:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206281 states. [2019-10-07 14:36:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206281 states to 206281 states and 383635 transitions. [2019-10-07 14:36:05,169 INFO L78 Accepts]: Start accepts. Automaton has 206281 states and 383635 transitions. Word has length 196 [2019-10-07 14:36:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:36:05,170 INFO L462 AbstractCegarLoop]: Abstraction has 206281 states and 383635 transitions. [2019-10-07 14:36:05,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:36:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 206281 states and 383635 transitions. [2019-10-07 14:36:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-07 14:36:05,178 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:36:05,179 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:05,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:36:05,388 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:36:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:36:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash -210371907, now seen corresponding path program 1 times [2019-10-07 14:36:05,389 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:36:05,390 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:36:05,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:36:05,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:36:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:36:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:36:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 14:36:05,556 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:36:05,556 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:36:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:36:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:36:07,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 3690 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 14:36:07,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:36:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 14:36:07,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:36:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 14:36:07,971 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 14:36:07,972 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2019-10-07 14:36:07,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:36:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:36:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:36:07,982 INFO L87 Difference]: Start difference. First operand 206281 states and 383635 transitions. Second operand 4 states. [2019-10-07 14:36:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:36:19,647 INFO L93 Difference]: Finished difference Result 426559 states and 840618 transitions. [2019-10-07 14:36:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:36:19,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-07 14:36:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:36:21,469 INFO L225 Difference]: With dead ends: 426559 [2019-10-07 14:36:21,469 INFO L226 Difference]: Without dead ends: 220321 [2019-10-07 14:36:21,920 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:36:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220321 states. [2019-10-07 14:36:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220321 to 220321. [2019-10-07 14:36:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220321 states. [2019-10-07 14:36:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220321 states to 220321 states and 409915 transitions. [2019-10-07 14:36:37,482 INFO L78 Accepts]: Start accepts. Automaton has 220321 states and 409915 transitions. Word has length 199 [2019-10-07 14:36:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:36:37,483 INFO L462 AbstractCegarLoop]: Abstraction has 220321 states and 409915 transitions. [2019-10-07 14:36:37,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:36:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 220321 states and 409915 transitions. [2019-10-07 14:36:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 14:36:37,489 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:36:37,489 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 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] [2019-10-07 14:36:37,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:36:37,698 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:36:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:36:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1540250995, now seen corresponding path program 1 times [2019-10-07 14:36:37,699 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:36:37,699 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:36:37,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:36:37,700 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:36:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:36:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:36:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 14:36:37,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:36:37,882 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:36:37,882 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:36:37,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:36:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:36:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:36:37,884 INFO L87 Difference]: Start difference. First operand 220321 states and 409915 transitions. Second operand 4 states. [2019-10-07 14:36:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:36:52,600 INFO L93 Difference]: Finished difference Result 455719 states and 892494 transitions. [2019-10-07 14:36:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:36:52,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-07 14:36:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:36:53,619 INFO L225 Difference]: With dead ends: 455719 [2019-10-07 14:36:53,619 INFO L226 Difference]: Without dead ends: 232561 [2019-10-07 14:36:54,199 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:36:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232561 states. [2019-10-07 14:37:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232561 to 232561. [2019-10-07 14:37:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232561 states. [2019-10-07 14:37:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232561 states to 232561 states and 416395 transitions. [2019-10-07 14:37:09,351 INFO L78 Accepts]: Start accepts. Automaton has 232561 states and 416395 transitions. Word has length 201 [2019-10-07 14:37:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:37:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 232561 states and 416395 transitions. [2019-10-07 14:37:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:37:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 232561 states and 416395 transitions. [2019-10-07 14:37:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-07 14:37:09,357 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:37:09,357 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:37:09,357 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:37:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:37:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash -468373064, now seen corresponding path program 1 times [2019-10-07 14:37:09,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:37:09,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:37:09,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:37:09,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:37:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:37:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:37:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-07 14:37:09,540 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:37:09,540 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:37:09,540 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:37:09,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:37:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:37:09,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:37:09,546 INFO L87 Difference]: Start difference. First operand 232561 states and 416395 transitions. Second operand 5 states. [2019-10-07 14:37:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:37:36,323 INFO L93 Difference]: Finished difference Result 736150 states and 1417210 transitions. [2019-10-07 14:37:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:37:36,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-07 14:37:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:37:38,862 INFO L225 Difference]: With dead ends: 736150 [2019-10-07 14:37:38,862 INFO L226 Difference]: Without dead ends: 503632 [2019-10-07 14:37:48,188 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:37:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503632 states. [2019-10-07 14:38:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503632 to 494513. [2019-10-07 14:38:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494513 states. [2019-10-07 14:38:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494513 states to 494513 states and 927820 transitions. [2019-10-07 14:38:29,219 INFO L78 Accepts]: Start accepts. Automaton has 494513 states and 927820 transitions. Word has length 223 [2019-10-07 14:38:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:38:29,219 INFO L462 AbstractCegarLoop]: Abstraction has 494513 states and 927820 transitions. [2019-10-07 14:38:29,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:38:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 494513 states and 927820 transitions. [2019-10-07 14:38:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 14:38:29,224 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:38:29,224 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:29,224 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:38:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:38:29,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1335275460, now seen corresponding path program 1 times [2019-10-07 14:38:29,225 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:38:29,225 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:38:29,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:38:29,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:38:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:38:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:38:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 14:38:29,438 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:38:29,439 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:38:29,439 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:38:29,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:38:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:38:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:38:29,440 INFO L87 Difference]: Start difference. First operand 494513 states and 927820 transitions. Second operand 9 states. [2019-10-07 14:39:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:39:18,331 INFO L93 Difference]: Finished difference Result 1095038 states and 2296899 transitions. [2019-10-07 14:39:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 14:39:18,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2019-10-07 14:39:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:39:23,991 INFO L225 Difference]: With dead ends: 1095038 [2019-10-07 14:39:23,991 INFO L226 Difference]: Without dead ends: 542749 [2019-10-07 14:39:26,899 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-10-07 14:39:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542749 states. [2019-10-07 14:40:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542749 to 523559. [2019-10-07 14:40:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523559 states. [2019-10-07 14:40:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523559 states to 523559 states and 989742 transitions. [2019-10-07 14:40:27,656 INFO L78 Accepts]: Start accepts. Automaton has 523559 states and 989742 transitions. Word has length 201 [2019-10-07 14:40:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:40:27,657 INFO L462 AbstractCegarLoop]: Abstraction has 523559 states and 989742 transitions. [2019-10-07 14:40:27,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:40:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 523559 states and 989742 transitions. [2019-10-07 14:40:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-07 14:40:27,662 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:40:27,662 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:27,663 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:40:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:40:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2081097473, now seen corresponding path program 1 times [2019-10-07 14:40:27,663 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:40:27,663 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:40:27,663 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:40:27,663 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:40:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:40:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:40:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 14:40:29,885 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:40:29,886 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:40:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:40:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:40:30,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 3693 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 14:40:30,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:40:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-07 14:40:30,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:40:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-07 14:40:31,827 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 14:40:31,827 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [33] total 41 [2019-10-07 14:40:31,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 14:40:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 14:40:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1507, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 14:40:31,830 INFO L87 Difference]: Start difference. First operand 523559 states and 989742 transitions. Second operand 10 states.