./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c6676c90977e408adf03f66d7ae0804453cb34e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:53:06,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:53:06,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:53:06,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:53:06,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:53:06,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:53:06,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:53:06,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:53:06,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:53:06,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:53:06,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:53:06,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:53:06,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:53:06,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:53:06,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:53:06,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:53:06,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:53:06,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:53:06,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:53:06,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:53:06,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:53:06,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:53:06,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:53:06,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:53:06,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:53:06,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:53:06,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:53:06,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:53:06,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:53:06,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:53:06,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:53:06,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:53:06,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:53:06,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:53:06,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:53:06,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:53:06,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:53:06,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:53:06,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:53:06,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:53:06,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:53:06,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:53:06,291 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:53:06,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:53:06,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:53:06,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:53:06,295 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:53:06,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:53:06,296 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:53:06,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:53:06,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:53:06,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:53:06,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:53:06,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:53:06,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:53:06,299 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:53:06,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:53:06,299 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:53:06,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:53:06,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:53:06,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:53:06,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:53:06,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:53:06,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:06,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:53:06,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:53:06,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:53:06,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:53:06,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:53:06,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:53:06,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:53:06,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c6676c90977e408adf03f66d7ae0804453cb34e [2020-10-20 01:53:06,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:53:06,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:53:06,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:53:06,548 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:53:06,549 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:53:06,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-10-20 01:53:06,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eec513ae/a003adcfbaea484181f8c956e1453017/FLAG2ef4eb953 [2020-10-20 01:53:07,148 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:53:07,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-10-20 01:53:07,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eec513ae/a003adcfbaea484181f8c956e1453017/FLAG2ef4eb953 [2020-10-20 01:53:07,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eec513ae/a003adcfbaea484181f8c956e1453017 [2020-10-20 01:53:07,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:53:07,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:53:07,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:07,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:53:07,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:53:07,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:07" (1/1) ... [2020-10-20 01:53:07,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af78815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:07, skipping insertion in model container [2020-10-20 01:53:07,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:07" (1/1) ... [2020-10-20 01:53:07,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:53:07,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:53:07,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:07,951 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:53:07,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:08,023 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:53:08,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08 WrapperNode [2020-10-20 01:53:08,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:08,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:08,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:53:08,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:53:08,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:08,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:53:08,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:53:08,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:53:08,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... [2020-10-20 01:53:08,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:53:08,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:53:08,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:53:08,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:53:08,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:53:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:53:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:53:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:53:09,080 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:53:09,081 INFO L298 CfgBuilder]: Removed 96 assume(true) statements. [2020-10-20 01:53:09,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:09 BoogieIcfgContainer [2020-10-20 01:53:09,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:53:09,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:53:09,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:53:09,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:53:09,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:53:07" (1/3) ... [2020-10-20 01:53:09,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6ec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:09, skipping insertion in model container [2020-10-20 01:53:09,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:08" (2/3) ... [2020-10-20 01:53:09,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6ec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:09, skipping insertion in model container [2020-10-20 01:53:09,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:09" (3/3) ... [2020-10-20 01:53:09,093 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-10-20 01:53:09,106 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:53:09,115 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:53:09,131 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:53:09,160 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:53:09,161 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:53:09,161 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:53:09,161 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:53:09,162 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:53:09,162 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:53:09,162 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:53:09,163 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:53:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states. [2020-10-20 01:53:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:09,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:09,195 INFO L422 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] [2020-10-20 01:53:09,196 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2020-10-20 01:53:09,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:09,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436924951] [2020-10-20 01:53:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:09,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436924951] [2020-10-20 01:53:09,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:09,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:09,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047027688] [2020-10-20 01:53:09,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:09,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:09,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,459 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 3 states. [2020-10-20 01:53:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:09,527 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2020-10-20 01:53:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:09,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:09,545 INFO L225 Difference]: With dead ends: 380 [2020-10-20 01:53:09,545 INFO L226 Difference]: Without dead ends: 188 [2020-10-20 01:53:09,550 INFO L677 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 [2020-10-20 01:53:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-10-20 01:53:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-10-20 01:53:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-20 01:53:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2020-10-20 01:53:09,616 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2020-10-20 01:53:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:09,617 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2020-10-20 01:53:09,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2020-10-20 01:53:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:09,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:09,620 INFO L422 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] [2020-10-20 01:53:09,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:53:09,621 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2020-10-20 01:53:09,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:09,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572386181] [2020-10-20 01:53:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:09,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572386181] [2020-10-20 01:53:09,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:09,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:09,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387702474] [2020-10-20 01:53:09,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:09,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:09,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:09,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,715 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2020-10-20 01:53:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:09,809 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2020-10-20 01:53:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:09,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:09,813 INFO L225 Difference]: With dead ends: 498 [2020-10-20 01:53:09,813 INFO L226 Difference]: Without dead ends: 317 [2020-10-20 01:53:09,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-20 01:53:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2020-10-20 01:53:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-20 01:53:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2020-10-20 01:53:09,868 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2020-10-20 01:53:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:09,868 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2020-10-20 01:53:09,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2020-10-20 01:53:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:09,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:09,870 INFO L422 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] [2020-10-20 01:53:09,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:53:09,871 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2020-10-20 01:53:09,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:09,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184589952] [2020-10-20 01:53:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:09,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184589952] [2020-10-20 01:53:09,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:09,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:09,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223825773] [2020-10-20 01:53:09,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:09,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:09,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,945 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2020-10-20 01:53:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:09,979 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2020-10-20 01:53:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:09,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:09,982 INFO L225 Difference]: With dead ends: 622 [2020-10-20 01:53:09,982 INFO L226 Difference]: Without dead ends: 315 [2020-10-20 01:53:09,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-20 01:53:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-20 01:53:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-20 01:53:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2020-10-20 01:53:10,020 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2020-10-20 01:53:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,021 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2020-10-20 01:53:10,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2020-10-20 01:53:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:10,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,027 INFO L422 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] [2020-10-20 01:53:10,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:53:10,027 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2020-10-20 01:53:10,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639495829] [2020-10-20 01:53:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:10,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639495829] [2020-10-20 01:53:10,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:10,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:10,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127958012] [2020-10-20 01:53:10,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:10,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,129 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2020-10-20 01:53:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:10,163 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2020-10-20 01:53:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:10,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:10,165 INFO L225 Difference]: With dead ends: 621 [2020-10-20 01:53:10,166 INFO L226 Difference]: Without dead ends: 315 [2020-10-20 01:53:10,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-20 01:53:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-20 01:53:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-20 01:53:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2020-10-20 01:53:10,184 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2020-10-20 01:53:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,184 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2020-10-20 01:53:10,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2020-10-20 01:53:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:10,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,186 INFO L422 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] [2020-10-20 01:53:10,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:53:10,186 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2020-10-20 01:53:10,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678304092] [2020-10-20 01:53:10,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:10,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678304092] [2020-10-20 01:53:10,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:10,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:10,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768309614] [2020-10-20 01:53:10,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:10,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,252 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2020-10-20 01:53:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:10,300 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2020-10-20 01:53:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:10,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:10,303 INFO L225 Difference]: With dead ends: 620 [2020-10-20 01:53:10,303 INFO L226 Difference]: Without dead ends: 315 [2020-10-20 01:53:10,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-20 01:53:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-20 01:53:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-20 01:53:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2020-10-20 01:53:10,320 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2020-10-20 01:53:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,320 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2020-10-20 01:53:10,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2020-10-20 01:53:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:10,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,322 INFO L422 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] [2020-10-20 01:53:10,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:53:10,322 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2020-10-20 01:53:10,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690681837] [2020-10-20 01:53:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:10,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690681837] [2020-10-20 01:53:10,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:10,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:10,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144702160] [2020-10-20 01:53:10,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:10,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,357 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2020-10-20 01:53:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:10,420 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2020-10-20 01:53:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:10,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:10,423 INFO L225 Difference]: With dead ends: 619 [2020-10-20 01:53:10,423 INFO L226 Difference]: Without dead ends: 315 [2020-10-20 01:53:10,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-20 01:53:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-20 01:53:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-20 01:53:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2020-10-20 01:53:10,441 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2020-10-20 01:53:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,441 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2020-10-20 01:53:10,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2020-10-20 01:53:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:10,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,443 INFO L422 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] [2020-10-20 01:53:10,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:53:10,444 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,444 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2020-10-20 01:53:10,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912404654] [2020-10-20 01:53:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:10,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912404654] [2020-10-20 01:53:10,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:10,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:10,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899433536] [2020-10-20 01:53:10,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:10,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:10,498 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 5 states. [2020-10-20 01:53:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:10,663 INFO L93 Difference]: Finished difference Result 1006 states and 1358 transitions. [2020-10-20 01:53:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:10,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-20 01:53:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:10,669 INFO L225 Difference]: With dead ends: 1006 [2020-10-20 01:53:10,669 INFO L226 Difference]: Without dead ends: 709 [2020-10-20 01:53:10,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-10-20 01:53:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 327. [2020-10-20 01:53:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-10-20 01:53:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2020-10-20 01:53:10,715 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 49 [2020-10-20 01:53:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,716 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2020-10-20 01:53:10,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2020-10-20 01:53:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:10,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,717 INFO L422 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] [2020-10-20 01:53:10,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:53:10,717 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash 145495590, now seen corresponding path program 1 times [2020-10-20 01:53:10,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826065770] [2020-10-20 01:53:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:10,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826065770] [2020-10-20 01:53:10,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:10,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:10,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076555822] [2020-10-20 01:53:10,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:10,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:10,766 INFO L87 Difference]: Start difference. First operand 327 states and 431 transitions. Second operand 5 states. [2020-10-20 01:53:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:10,912 INFO L93 Difference]: Finished difference Result 870 states and 1159 transitions. [2020-10-20 01:53:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:10,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-20 01:53:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:10,917 INFO L225 Difference]: With dead ends: 870 [2020-10-20 01:53:10,917 INFO L226 Difference]: Without dead ends: 568 [2020-10-20 01:53:10,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-10-20 01:53:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 333. [2020-10-20 01:53:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-20 01:53:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 431 transitions. [2020-10-20 01:53:10,952 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 431 transitions. Word has length 49 [2020-10-20 01:53:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,953 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 431 transitions. [2020-10-20 01:53:10,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 431 transitions. [2020-10-20 01:53:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:10,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,954 INFO L422 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] [2020-10-20 01:53:10,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:53:10,954 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2068723624, now seen corresponding path program 1 times [2020-10-20 01:53:10,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482205321] [2020-10-20 01:53:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:11,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482205321] [2020-10-20 01:53:11,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:11,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:11,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678867451] [2020-10-20 01:53:11,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:11,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:11,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:11,002 INFO L87 Difference]: Start difference. First operand 333 states and 431 transitions. Second operand 5 states. [2020-10-20 01:53:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:11,240 INFO L93 Difference]: Finished difference Result 895 states and 1173 transitions. [2020-10-20 01:53:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:11,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-20 01:53:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:11,244 INFO L225 Difference]: With dead ends: 895 [2020-10-20 01:53:11,244 INFO L226 Difference]: Without dead ends: 594 [2020-10-20 01:53:11,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-10-20 01:53:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 339. [2020-10-20 01:53:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-10-20 01:53:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2020-10-20 01:53:11,284 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 49 [2020-10-20 01:53:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:11,285 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2020-10-20 01:53:11,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2020-10-20 01:53:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-20 01:53:11,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:11,286 INFO L422 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] [2020-10-20 01:53:11,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:53:11,286 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1803541846, now seen corresponding path program 1 times [2020-10-20 01:53:11,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:11,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406736381] [2020-10-20 01:53:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:11,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406736381] [2020-10-20 01:53:11,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:11,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:11,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634329649] [2020-10-20 01:53:11,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:11,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:11,325 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand 3 states. [2020-10-20 01:53:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:11,423 INFO L93 Difference]: Finished difference Result 919 states and 1163 transitions. [2020-10-20 01:53:11,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:11,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-20 01:53:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:11,427 INFO L225 Difference]: With dead ends: 919 [2020-10-20 01:53:11,427 INFO L226 Difference]: Without dead ends: 617 [2020-10-20 01:53:11,428 INFO L677 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 [2020-10-20 01:53:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-10-20 01:53:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 595. [2020-10-20 01:53:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2020-10-20 01:53:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 741 transitions. [2020-10-20 01:53:11,489 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 741 transitions. Word has length 49 [2020-10-20 01:53:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:11,489 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 741 transitions. [2020-10-20 01:53:11,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 741 transitions. [2020-10-20 01:53:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:53:11,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:11,490 INFO L422 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] [2020-10-20 01:53:11,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:53:11,490 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1362638081, now seen corresponding path program 1 times [2020-10-20 01:53:11,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:11,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145789681] [2020-10-20 01:53:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:11,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145789681] [2020-10-20 01:53:11,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:11,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:11,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132603213] [2020-10-20 01:53:11,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:11,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:11,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:11,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:11,528 INFO L87 Difference]: Start difference. First operand 595 states and 741 transitions. Second operand 3 states. [2020-10-20 01:53:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:11,658 INFO L93 Difference]: Finished difference Result 1513 states and 1891 transitions. [2020-10-20 01:53:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:11,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-20 01:53:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:11,664 INFO L225 Difference]: With dead ends: 1513 [2020-10-20 01:53:11,665 INFO L226 Difference]: Without dead ends: 988 [2020-10-20 01:53:11,666 INFO L677 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 [2020-10-20 01:53:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2020-10-20 01:53:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2020-10-20 01:53:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-10-20 01:53:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1218 transitions. [2020-10-20 01:53:11,758 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1218 transitions. Word has length 50 [2020-10-20 01:53:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:11,758 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1218 transitions. [2020-10-20 01:53:11,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1218 transitions. [2020-10-20 01:53:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:53:11,759 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:11,759 INFO L422 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] [2020-10-20 01:53:11,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:53:11,760 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash -497328611, now seen corresponding path program 1 times [2020-10-20 01:53:11,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:11,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295132116] [2020-10-20 01:53:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:11,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295132116] [2020-10-20 01:53:11,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:11,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:11,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001674339] [2020-10-20 01:53:11,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:11,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:11,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:11,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:11,824 INFO L87 Difference]: Start difference. First operand 986 states and 1218 transitions. Second operand 3 states. [2020-10-20 01:53:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:12,014 INFO L93 Difference]: Finished difference Result 2794 states and 3457 transitions. [2020-10-20 01:53:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:12,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-10-20 01:53:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:12,027 INFO L225 Difference]: With dead ends: 2794 [2020-10-20 01:53:12,027 INFO L226 Difference]: Without dead ends: 1858 [2020-10-20 01:53:12,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2020-10-20 01:53:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1842. [2020-10-20 01:53:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2020-10-20 01:53:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2252 transitions. [2020-10-20 01:53:12,179 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2252 transitions. Word has length 51 [2020-10-20 01:53:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:12,181 INFO L481 AbstractCegarLoop]: Abstraction has 1842 states and 2252 transitions. [2020-10-20 01:53:12,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2252 transitions. [2020-10-20 01:53:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-20 01:53:12,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:12,183 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:12,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:53:12,184 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -798137423, now seen corresponding path program 1 times [2020-10-20 01:53:12,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:12,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449994180] [2020-10-20 01:53:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:12,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449994180] [2020-10-20 01:53:12,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:12,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:12,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264831415] [2020-10-20 01:53:12,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:12,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:12,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:12,278 INFO L87 Difference]: Start difference. First operand 1842 states and 2252 transitions. Second operand 4 states. [2020-10-20 01:53:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:12,676 INFO L93 Difference]: Finished difference Result 5392 states and 6581 transitions. [2020-10-20 01:53:12,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:12,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-20 01:53:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:12,692 INFO L225 Difference]: With dead ends: 5392 [2020-10-20 01:53:12,692 INFO L226 Difference]: Without dead ends: 2716 [2020-10-20 01:53:12,697 INFO L677 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 [2020-10-20 01:53:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2020-10-20 01:53:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2020-10-20 01:53:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-10-20 01:53:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3296 transitions. [2020-10-20 01:53:12,911 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3296 transitions. Word has length 66 [2020-10-20 01:53:12,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:12,912 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3296 transitions. [2020-10-20 01:53:12,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3296 transitions. [2020-10-20 01:53:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-20 01:53:12,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:12,914 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:12,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:53:12,915 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 280255658, now seen corresponding path program 1 times [2020-10-20 01:53:12,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:12,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311725748] [2020-10-20 01:53:12,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 01:53:12,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311725748] [2020-10-20 01:53:12,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:12,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:12,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614366243] [2020-10-20 01:53:12,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:12,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:12,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:12,980 INFO L87 Difference]: Start difference. First operand 2716 states and 3296 transitions. Second operand 3 states. [2020-10-20 01:53:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:13,269 INFO L93 Difference]: Finished difference Result 6156 states and 7455 transitions. [2020-10-20 01:53:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:13,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-10-20 01:53:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:13,288 INFO L225 Difference]: With dead ends: 6156 [2020-10-20 01:53:13,289 INFO L226 Difference]: Without dead ends: 3476 [2020-10-20 01:53:13,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2020-10-20 01:53:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3452. [2020-10-20 01:53:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-10-20 01:53:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4150 transitions. [2020-10-20 01:53:13,524 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4150 transitions. Word has length 89 [2020-10-20 01:53:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:13,525 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4150 transitions. [2020-10-20 01:53:13,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4150 transitions. [2020-10-20 01:53:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-20 01:53:13,528 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:13,528 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:13,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:53:13,528 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2020-10-20 01:53:13,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:13,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239298169] [2020-10-20 01:53:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:13,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239298169] [2020-10-20 01:53:13,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:13,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:13,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159541011] [2020-10-20 01:53:13,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:13,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:13,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:13,602 INFO L87 Difference]: Start difference. First operand 3452 states and 4150 transitions. Second operand 4 states. [2020-10-20 01:53:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:14,049 INFO L93 Difference]: Finished difference Result 6102 states and 7374 transitions. [2020-10-20 01:53:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:14,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-10-20 01:53:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:14,070 INFO L225 Difference]: With dead ends: 6102 [2020-10-20 01:53:14,071 INFO L226 Difference]: Without dead ends: 3454 [2020-10-20 01:53:14,079 INFO L677 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 [2020-10-20 01:53:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2020-10-20 01:53:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2020-10-20 01:53:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-10-20 01:53:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4120 transitions. [2020-10-20 01:53:14,425 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4120 transitions. Word has length 92 [2020-10-20 01:53:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:14,425 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4120 transitions. [2020-10-20 01:53:14,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4120 transitions. [2020-10-20 01:53:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-20 01:53:14,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:14,430 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:14,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:53:14,430 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:14,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1737719815, now seen corresponding path program 1 times [2020-10-20 01:53:14,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:14,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029445593] [2020-10-20 01:53:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:14,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029445593] [2020-10-20 01:53:14,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:14,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:14,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993741230] [2020-10-20 01:53:14,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:14,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:14,491 INFO L87 Difference]: Start difference. First operand 3452 states and 4120 transitions. Second operand 3 states. [2020-10-20 01:53:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:14,965 INFO L93 Difference]: Finished difference Result 5607 states and 6726 transitions. [2020-10-20 01:53:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:14,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-10-20 01:53:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:14,984 INFO L225 Difference]: With dead ends: 5607 [2020-10-20 01:53:14,984 INFO L226 Difference]: Without dead ends: 3452 [2020-10-20 01:53:14,989 INFO L677 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 [2020-10-20 01:53:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2020-10-20 01:53:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3438. [2020-10-20 01:53:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2020-10-20 01:53:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4042 transitions. [2020-10-20 01:53:15,295 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4042 transitions. Word has length 115 [2020-10-20 01:53:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:15,296 INFO L481 AbstractCegarLoop]: Abstraction has 3438 states and 4042 transitions. [2020-10-20 01:53:15,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4042 transitions. [2020-10-20 01:53:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-20 01:53:15,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:15,300 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:15,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:53:15,301 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2020-10-20 01:53:15,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:15,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887198007] [2020-10-20 01:53:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:53:15,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887198007] [2020-10-20 01:53:15,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:15,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:15,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682735482] [2020-10-20 01:53:15,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:15,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:15,355 INFO L87 Difference]: Start difference. First operand 3438 states and 4042 transitions. Second operand 3 states. [2020-10-20 01:53:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:15,669 INFO L93 Difference]: Finished difference Result 7668 states and 8933 transitions. [2020-10-20 01:53:15,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:15,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-20 01:53:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:15,682 INFO L225 Difference]: With dead ends: 7668 [2020-10-20 01:53:15,682 INFO L226 Difference]: Without dead ends: 2540 [2020-10-20 01:53:15,691 INFO L677 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 [2020-10-20 01:53:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2020-10-20 01:53:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2462. [2020-10-20 01:53:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2020-10-20 01:53:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2756 transitions. [2020-10-20 01:53:16,111 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2756 transitions. Word has length 116 [2020-10-20 01:53:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:16,112 INFO L481 AbstractCegarLoop]: Abstraction has 2462 states and 2756 transitions. [2020-10-20 01:53:16,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2756 transitions. [2020-10-20 01:53:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-20 01:53:16,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:16,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:16,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:53:16,117 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2020-10-20 01:53:16,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:16,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659348425] [2020-10-20 01:53:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:16,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659348425] [2020-10-20 01:53:16,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:16,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:16,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678779286] [2020-10-20 01:53:16,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:16,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,168 INFO L87 Difference]: Start difference. First operand 2462 states and 2756 transitions. Second operand 3 states. [2020-10-20 01:53:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:16,356 INFO L93 Difference]: Finished difference Result 4250 states and 4773 transitions. [2020-10-20 01:53:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:16,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-10-20 01:53:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:16,369 INFO L225 Difference]: With dead ends: 4250 [2020-10-20 01:53:16,370 INFO L226 Difference]: Without dead ends: 2462 [2020-10-20 01:53:16,374 INFO L677 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 [2020-10-20 01:53:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2020-10-20 01:53:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2020-10-20 01:53:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2020-10-20 01:53:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2722 transitions. [2020-10-20 01:53:16,537 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2722 transitions. Word has length 117 [2020-10-20 01:53:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:16,537 INFO L481 AbstractCegarLoop]: Abstraction has 2462 states and 2722 transitions. [2020-10-20 01:53:16,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2722 transitions. [2020-10-20 01:53:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-10-20 01:53:16,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:16,542 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:16,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:53:16,542 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:16,543 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2020-10-20 01:53:16,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:16,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806827676] [2020-10-20 01:53:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:16,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:16,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:16,676 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:53:16,677 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:53:16,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:53:16,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:53:16 BoogieIcfgContainer [2020-10-20 01:53:16,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:53:16,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:53:16,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:53:16,897 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:53:16,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:09" (3/4) ... [2020-10-20 01:53:16,901 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:53:17,016 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:53:17,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:53:17,021 INFO L168 Benchmark]: Toolchain (without parser) took 9469.89 ms. Allocated memory was 39.3 MB in the beginning and 196.6 MB in the end (delta: 157.3 MB). Free memory was 17.0 MB in the beginning and 124.5 MB in the end (delta: -107.5 MB). Peak memory consumption was 49.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,022 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 30.9 MB. Free memory was 7.3 MB in the beginning and 7.2 MB in the end (delta: 43.6 kB). Peak memory consumption was 43.6 kB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.45 ms. Allocated memory was 39.3 MB in the beginning and 40.4 MB in the end (delta: 1.0 MB). Free memory was 16.2 MB in the beginning and 12.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.54 ms. Allocated memory was 40.4 MB in the beginning and 41.9 MB in the end (delta: 1.6 MB). Free memory was 12.5 MB in the beginning and 25.3 MB in the end (delta: -12.7 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,023 INFO L168 Benchmark]: Boogie Preprocessor took 50.02 ms. Allocated memory is still 41.9 MB. Free memory was 25.3 MB in the beginning and 22.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,023 INFO L168 Benchmark]: RCFGBuilder took 931.08 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 22.5 MB in the beginning and 23.3 MB in the end (delta: -787.7 kB). Peak memory consumption was 16.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,024 INFO L168 Benchmark]: TraceAbstraction took 7811.59 ms. Allocated memory was 44.0 MB in the beginning and 196.6 MB in the end (delta: 152.6 MB). Free memory was 22.7 MB in the beginning and 143.5 MB in the end (delta: -120.8 MB). Peak memory consumption was 145.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,024 INFO L168 Benchmark]: Witness Printer took 119.37 ms. Allocated memory is still 196.6 MB. Free memory was 143.5 MB in the beginning and 124.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:17,027 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 30.9 MB. Free memory was 7.3 MB in the beginning and 7.2 MB in the end (delta: 43.6 kB). Peak memory consumption was 43.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 470.45 ms. Allocated memory was 39.3 MB in the beginning and 40.4 MB in the end (delta: 1.0 MB). Free memory was 16.2 MB in the beginning and 12.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 76.54 ms. Allocated memory was 40.4 MB in the beginning and 41.9 MB in the end (delta: 1.6 MB). Free memory was 12.5 MB in the beginning and 25.3 MB in the end (delta: -12.7 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 50.02 ms. Allocated memory is still 41.9 MB. Free memory was 25.3 MB in the beginning and 22.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 931.08 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 22.5 MB in the beginning and 23.3 MB in the end (delta: -787.7 kB). Peak memory consumption was 16.0 MB. Max. memory is 14.3 GB. * TraceAbstraction took 7811.59 ms. Allocated memory was 44.0 MB in the beginning and 196.6 MB in the end (delta: 152.6 MB). Free memory was 22.7 MB in the beginning and 143.5 MB in the end (delta: -120.8 MB). Peak memory consumption was 145.7 MB. Max. memory is 14.3 GB. * Witness Printer took 119.37 ms. Allocated memory is still 196.6 MB. Free memory was 143.5 MB in the beginning and 124.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L565] int __retres1 ; [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L213] COND TRUE m_i == 1 [L214] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L326] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L331] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L336] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L341] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L346] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L148] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L160] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L164] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L167] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L179] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L183] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L186] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L198] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L359] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L364] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L369] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L374] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L379] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L520] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] kernel_st = 1 [L259] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L80] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L115] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L128] t2_pc = 1 [L129] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L39] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L50] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L55] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L60] m_pc = 1 [L61] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L80] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L83] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L99] E_2 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L149] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L115] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L118] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L3] __assert_fail("0", "transmitter.02.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 193 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5214 SDtfs, 5299 SDslu, 4169 SDs, 0 SdLazy, 369 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3452occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 143287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 90/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...