./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 54858612 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.5.800.v20200727-1323.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.2.0-5485861 [2020-10-25 23:16:42,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:16:42,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:16:42,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:16:42,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:16:42,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:16:42,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:16:42,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:16:42,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:16:42,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:16:42,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:16:42,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:16:42,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:16:42,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:16:42,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:16:42,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:16:42,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:16:42,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:16:42,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:16:42,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:16:42,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:16:42,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:16:42,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:16:42,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:16:42,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:16:42,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:16:42,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:16:42,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:16:42,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:16:42,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:16:42,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:16:42,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:16:42,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:16:42,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:16:42,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:16:42,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:16:42,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:16:42,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:16:42,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:16:42,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:16:42,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:16:42,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:16:42,212 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:16:42,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:16:42,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:16:42,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:16:42,220 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:16:42,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:16:42,220 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:16:42,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:16:42,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:16:42,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:16:42,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:16:42,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:16:42,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:16:42,222 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:16:42,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:16:42,223 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:16:42,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:16:42,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:16:42,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:16:42,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:16:42,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:16:42,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:16:42,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:16:42,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:16:42,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:16:42,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:16:42,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:16:42,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:16:42,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:16:42,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-25 23:16:42,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:16:42,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:16:42,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:16:42,700 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:16:42,703 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:16:42,704 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-25 23:16:42,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62fc39479/b03985b383cd40bd884071d1fee1084d/FLAG37f36f062 [2020-10-25 23:16:43,382 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:16:43,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-10-25 23:16:43,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62fc39479/b03985b383cd40bd884071d1fee1084d/FLAG37f36f062 [2020-10-25 23:16:43,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62fc39479/b03985b383cd40bd884071d1fee1084d [2020-10-25 23:16:43,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:16:43,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:16:43,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:16:43,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:16:43,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:16:43,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:16:43" (1/1) ... [2020-10-25 23:16:43,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564fb441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:43, skipping insertion in model container [2020-10-25 23:16:43,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:16:43" (1/1) ... [2020-10-25 23:16:43,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:16:43,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:16:44,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:16:44,088 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:16:44,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:16:44,171 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:16:44,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44 WrapperNode [2020-10-25 23:16:44,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:16:44,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:16:44,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:16:44,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:16:44,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:16:44,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:16:44,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:16:44,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:16:44,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (1/1) ... [2020-10-25 23:16:44,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:16:44,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:16:44,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:16:44,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:16:44,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (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-25 23:16:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:16:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:16:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:16:44,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:16:45,368 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:16:45,369 INFO L298 CfgBuilder]: Removed 96 assume(true) statements. [2020-10-25 23:16:45,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:45 BoogieIcfgContainer [2020-10-25 23:16:45,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:16:45,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:16:45,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:16:45,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:16:45,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:16:43" (1/3) ... [2020-10-25 23:16:45,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e0ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:16:45, skipping insertion in model container [2020-10-25 23:16:45,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:44" (2/3) ... [2020-10-25 23:16:45,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e0ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:16:45, skipping insertion in model container [2020-10-25 23:16:45,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:45" (3/3) ... [2020-10-25 23:16:45,380 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-10-25 23:16:45,392 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:16:45,397 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:16:45,410 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:16:45,441 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:16:45,441 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:16:45,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:16:45,442 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:16:45,442 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:16:45,442 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:16:45,443 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:16:45,443 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:16:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states. [2020-10-25 23:16:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:45,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:45,474 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-25 23:16:45,474 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2020-10-25 23:16:45,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:45,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969064793] [2020-10-25 23:16:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:45,691 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-25 23:16:45,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969064793] [2020-10-25 23:16:45,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:45,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:45,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932187270] [2020-10-25 23:16:45,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:45,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:45,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:45,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:45,717 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 3 states. [2020-10-25 23:16:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:45,787 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2020-10-25 23:16:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:45,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:45,803 INFO L225 Difference]: With dead ends: 380 [2020-10-25 23:16:45,803 INFO L226 Difference]: Without dead ends: 188 [2020-10-25 23:16:45,808 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-25 23:16:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-10-25 23:16:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-10-25 23:16:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-25 23:16:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2020-10-25 23:16:45,869 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2020-10-25 23:16:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:45,870 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2020-10-25 23:16:45,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2020-10-25 23:16:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:45,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:45,873 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-25 23:16:45,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:16:45,873 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2020-10-25 23:16:45,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:45,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373636060] [2020-10-25 23:16:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:45,945 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-25 23:16:45,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373636060] [2020-10-25 23:16:45,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:45,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:45,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264998701] [2020-10-25 23:16:45,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:45,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:45,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:45,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:45,950 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2020-10-25 23:16:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:46,055 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2020-10-25 23:16:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:46,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:46,059 INFO L225 Difference]: With dead ends: 498 [2020-10-25 23:16:46,059 INFO L226 Difference]: Without dead ends: 317 [2020-10-25 23:16:46,061 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-25 23:16:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-25 23:16:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2020-10-25 23:16:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-25 23:16:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2020-10-25 23:16:46,105 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2020-10-25 23:16:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:46,106 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2020-10-25 23:16:46,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2020-10-25 23:16:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:46,108 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:46,108 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-25 23:16:46,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:16:46,109 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:46,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2020-10-25 23:16:46,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:46,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904039854] [2020-10-25 23:16:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:46,177 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-25 23:16:46,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904039854] [2020-10-25 23:16:46,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:46,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:46,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757772128] [2020-10-25 23:16:46,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:46,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:46,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:46,185 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2020-10-25 23:16:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:46,236 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2020-10-25 23:16:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:46,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:46,240 INFO L225 Difference]: With dead ends: 622 [2020-10-25 23:16:46,240 INFO L226 Difference]: Without dead ends: 315 [2020-10-25 23:16:46,245 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-25 23:16:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-25 23:16:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-25 23:16:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-25 23:16:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2020-10-25 23:16:46,273 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2020-10-25 23:16:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:46,273 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2020-10-25 23:16:46,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2020-10-25 23:16:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:46,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:46,275 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-25 23:16:46,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:16:46,276 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2020-10-25 23:16:46,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:46,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408567095] [2020-10-25 23:16:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:46,334 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-25 23:16:46,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408567095] [2020-10-25 23:16:46,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:46,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:46,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263285933] [2020-10-25 23:16:46,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:46,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:46,337 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2020-10-25 23:16:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:46,377 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2020-10-25 23:16:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:46,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:46,379 INFO L225 Difference]: With dead ends: 621 [2020-10-25 23:16:46,379 INFO L226 Difference]: Without dead ends: 315 [2020-10-25 23:16:46,380 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-25 23:16:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-25 23:16:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-25 23:16:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-25 23:16:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2020-10-25 23:16:46,400 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2020-10-25 23:16:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:46,401 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2020-10-25 23:16:46,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2020-10-25 23:16:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:46,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:46,403 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-25 23:16:46,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:16:46,403 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2020-10-25 23:16:46,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:46,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971278278] [2020-10-25 23:16:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:46,469 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-25 23:16:46,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971278278] [2020-10-25 23:16:46,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:46,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:46,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529395345] [2020-10-25 23:16:46,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:46,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:46,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:46,472 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2020-10-25 23:16:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:46,530 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2020-10-25 23:16:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:46,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:46,532 INFO L225 Difference]: With dead ends: 620 [2020-10-25 23:16:46,533 INFO L226 Difference]: Without dead ends: 315 [2020-10-25 23:16:46,534 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-25 23:16:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-25 23:16:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-25 23:16:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-25 23:16:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2020-10-25 23:16:46,550 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2020-10-25 23:16:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:46,551 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2020-10-25 23:16:46,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2020-10-25 23:16:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:46,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:46,553 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-25 23:16:46,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:16:46,553 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2020-10-25 23:16:46,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:46,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736745681] [2020-10-25 23:16:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:46,612 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-25 23:16:46,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736745681] [2020-10-25 23:16:46,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:46,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:46,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886340241] [2020-10-25 23:16:46,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:46,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:46,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:46,617 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2020-10-25 23:16:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:46,685 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2020-10-25 23:16:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:46,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:46,688 INFO L225 Difference]: With dead ends: 619 [2020-10-25 23:16:46,688 INFO L226 Difference]: Without dead ends: 315 [2020-10-25 23:16:46,689 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-25 23:16:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-25 23:16:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-10-25 23:16:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-25 23:16:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2020-10-25 23:16:46,717 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2020-10-25 23:16:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:46,721 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2020-10-25 23:16:46,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2020-10-25 23:16:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:46,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:46,727 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-25 23:16:46,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:16:46,728 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2020-10-25 23:16:46,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:46,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680370268] [2020-10-25 23:16:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:46,844 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-25 23:16:46,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680370268] [2020-10-25 23:16:46,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:46,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:16:46,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842328552] [2020-10-25 23:16:46,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:16:46,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:16:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:16:46,847 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 5 states. [2020-10-25 23:16:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:47,011 INFO L93 Difference]: Finished difference Result 1006 states and 1358 transitions. [2020-10-25 23:16:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:16:47,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-25 23:16:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:47,022 INFO L225 Difference]: With dead ends: 1006 [2020-10-25 23:16:47,022 INFO L226 Difference]: Without dead ends: 709 [2020-10-25 23:16:47,023 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-25 23:16:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-10-25 23:16:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 327. [2020-10-25 23:16:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-10-25 23:16:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2020-10-25 23:16:47,058 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 49 [2020-10-25 23:16:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:47,058 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2020-10-25 23:16:47,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:16:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2020-10-25 23:16:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:47,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:47,061 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-25 23:16:47,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:16:47,062 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 145495590, now seen corresponding path program 1 times [2020-10-25 23:16:47,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:47,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936727762] [2020-10-25 23:16:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:47,162 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-25 23:16:47,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936727762] [2020-10-25 23:16:47,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:47,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:16:47,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309962735] [2020-10-25 23:16:47,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:16:47,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:47,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:16:47,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:16:47,167 INFO L87 Difference]: Start difference. First operand 327 states and 431 transitions. Second operand 5 states. [2020-10-25 23:16:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:47,306 INFO L93 Difference]: Finished difference Result 870 states and 1159 transitions. [2020-10-25 23:16:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:16:47,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-25 23:16:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:47,310 INFO L225 Difference]: With dead ends: 870 [2020-10-25 23:16:47,311 INFO L226 Difference]: Without dead ends: 568 [2020-10-25 23:16:47,312 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-25 23:16:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-10-25 23:16:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 333. [2020-10-25 23:16:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-25 23:16:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 431 transitions. [2020-10-25 23:16:47,348 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 431 transitions. Word has length 49 [2020-10-25 23:16:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:47,349 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 431 transitions. [2020-10-25 23:16:47,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:16:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 431 transitions. [2020-10-25 23:16:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:47,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:47,350 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-25 23:16:47,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:16:47,350 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2068723624, now seen corresponding path program 1 times [2020-10-25 23:16:47,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:47,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777865238] [2020-10-25 23:16:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:47,394 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-25 23:16:47,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777865238] [2020-10-25 23:16:47,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:47,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:16:47,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997760196] [2020-10-25 23:16:47,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:16:47,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:16:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:16:47,397 INFO L87 Difference]: Start difference. First operand 333 states and 431 transitions. Second operand 5 states. [2020-10-25 23:16:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:47,542 INFO L93 Difference]: Finished difference Result 895 states and 1173 transitions. [2020-10-25 23:16:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:16:47,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-25 23:16:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:47,547 INFO L225 Difference]: With dead ends: 895 [2020-10-25 23:16:47,547 INFO L226 Difference]: Without dead ends: 594 [2020-10-25 23:16:47,548 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-25 23:16:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-10-25 23:16:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 339. [2020-10-25 23:16:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-10-25 23:16:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2020-10-25 23:16:47,580 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 49 [2020-10-25 23:16:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:47,581 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2020-10-25 23:16:47,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:16:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2020-10-25 23:16:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:47,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:47,582 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-25 23:16:47,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:16:47,582 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1803541846, now seen corresponding path program 1 times [2020-10-25 23:16:47,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:47,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368398396] [2020-10-25 23:16:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:47,633 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-25 23:16:47,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368398396] [2020-10-25 23:16:47,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:47,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:47,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057514649] [2020-10-25 23:16:47,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:47,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:47,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:47,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:47,636 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand 3 states. [2020-10-25 23:16:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:47,738 INFO L93 Difference]: Finished difference Result 919 states and 1163 transitions. [2020-10-25 23:16:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:47,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-10-25 23:16:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:47,745 INFO L225 Difference]: With dead ends: 919 [2020-10-25 23:16:47,746 INFO L226 Difference]: Without dead ends: 617 [2020-10-25 23:16:47,747 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-25 23:16:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-10-25 23:16:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 595. [2020-10-25 23:16:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2020-10-25 23:16:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 741 transitions. [2020-10-25 23:16:47,813 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 741 transitions. Word has length 49 [2020-10-25 23:16:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:47,814 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 741 transitions. [2020-10-25 23:16:47,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 741 transitions. [2020-10-25 23:16:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:16:47,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:47,815 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-25 23:16:47,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:16:47,816 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1362638081, now seen corresponding path program 1 times [2020-10-25 23:16:47,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:47,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971843824] [2020-10-25 23:16:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:47,902 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-25 23:16:47,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971843824] [2020-10-25 23:16:47,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:47,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:47,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748978362] [2020-10-25 23:16:47,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:47,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:47,906 INFO L87 Difference]: Start difference. First operand 595 states and 741 transitions. Second operand 3 states. [2020-10-25 23:16:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:48,025 INFO L93 Difference]: Finished difference Result 1513 states and 1891 transitions. [2020-10-25 23:16:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:48,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 23:16:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:48,032 INFO L225 Difference]: With dead ends: 1513 [2020-10-25 23:16:48,032 INFO L226 Difference]: Without dead ends: 988 [2020-10-25 23:16:48,034 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-25 23:16:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2020-10-25 23:16:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2020-10-25 23:16:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-10-25 23:16:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1218 transitions. [2020-10-25 23:16:48,126 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1218 transitions. Word has length 50 [2020-10-25 23:16:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:48,126 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1218 transitions. [2020-10-25 23:16:48,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1218 transitions. [2020-10-25 23:16:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 23:16:48,127 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:48,128 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-25 23:16:48,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:16:48,128 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash -497328611, now seen corresponding path program 1 times [2020-10-25 23:16:48,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:48,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102130389] [2020-10-25 23:16:48,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:48,184 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-25 23:16:48,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102130389] [2020-10-25 23:16:48,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:48,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:48,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032429034] [2020-10-25 23:16:48,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:48,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:48,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:48,188 INFO L87 Difference]: Start difference. First operand 986 states and 1218 transitions. Second operand 3 states. [2020-10-25 23:16:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:48,369 INFO L93 Difference]: Finished difference Result 2794 states and 3457 transitions. [2020-10-25 23:16:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:48,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-10-25 23:16:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:48,381 INFO L225 Difference]: With dead ends: 2794 [2020-10-25 23:16:48,382 INFO L226 Difference]: Without dead ends: 1858 [2020-10-25 23:16:48,384 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-25 23:16:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2020-10-25 23:16:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1842. [2020-10-25 23:16:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2020-10-25 23:16:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2252 transitions. [2020-10-25 23:16:48,534 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2252 transitions. Word has length 51 [2020-10-25 23:16:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:48,536 INFO L481 AbstractCegarLoop]: Abstraction has 1842 states and 2252 transitions. [2020-10-25 23:16:48,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2252 transitions. [2020-10-25 23:16:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-25 23:16:48,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:48,544 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-25 23:16:48,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:16:48,545 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash -798137423, now seen corresponding path program 1 times [2020-10-25 23:16:48,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:48,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826283614] [2020-10-25 23:16:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:48,594 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-25 23:16:48,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826283614] [2020-10-25 23:16:48,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:48,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:48,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254249179] [2020-10-25 23:16:48,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:48,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:48,597 INFO L87 Difference]: Start difference. First operand 1842 states and 2252 transitions. Second operand 4 states. [2020-10-25 23:16:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:48,992 INFO L93 Difference]: Finished difference Result 5392 states and 6581 transitions. [2020-10-25 23:16:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:48,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-25 23:16:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:49,005 INFO L225 Difference]: With dead ends: 5392 [2020-10-25 23:16:49,005 INFO L226 Difference]: Without dead ends: 2716 [2020-10-25 23:16:49,009 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-25 23:16:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2020-10-25 23:16:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2020-10-25 23:16:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-10-25 23:16:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3296 transitions. [2020-10-25 23:16:49,247 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3296 transitions. Word has length 66 [2020-10-25 23:16:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:49,248 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3296 transitions. [2020-10-25 23:16:49,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3296 transitions. [2020-10-25 23:16:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-25 23:16:49,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:49,257 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-25 23:16:49,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:16:49,257 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 280255658, now seen corresponding path program 1 times [2020-10-25 23:16:49,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:49,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396250607] [2020-10-25 23:16:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:49,342 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-25 23:16:49,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396250607] [2020-10-25 23:16:49,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:49,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:16:49,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638546170] [2020-10-25 23:16:49,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:49,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:49,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:49,346 INFO L87 Difference]: Start difference. First operand 2716 states and 3296 transitions. Second operand 3 states. [2020-10-25 23:16:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:49,676 INFO L93 Difference]: Finished difference Result 6156 states and 7455 transitions. [2020-10-25 23:16:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:49,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-10-25 23:16:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:49,694 INFO L225 Difference]: With dead ends: 6156 [2020-10-25 23:16:49,694 INFO L226 Difference]: Without dead ends: 3476 [2020-10-25 23:16:49,699 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-25 23:16:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2020-10-25 23:16:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3452. [2020-10-25 23:16:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-10-25 23:16:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4150 transitions. [2020-10-25 23:16:50,024 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4150 transitions. Word has length 89 [2020-10-25 23:16:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:50,024 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4150 transitions. [2020-10-25 23:16:50,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4150 transitions. [2020-10-25 23:16:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-25 23:16:50,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:50,029 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-25 23:16:50,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:16:50,029 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2020-10-25 23:16:50,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:50,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745567766] [2020-10-25 23:16:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:50,103 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-25 23:16:50,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745567766] [2020-10-25 23:16:50,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:50,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:50,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556900162] [2020-10-25 23:16:50,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:50,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:50,106 INFO L87 Difference]: Start difference. First operand 3452 states and 4150 transitions. Second operand 4 states. [2020-10-25 23:16:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:50,397 INFO L93 Difference]: Finished difference Result 6102 states and 7374 transitions. [2020-10-25 23:16:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:50,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-10-25 23:16:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:50,415 INFO L225 Difference]: With dead ends: 6102 [2020-10-25 23:16:50,416 INFO L226 Difference]: Without dead ends: 3454 [2020-10-25 23:16:50,421 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-25 23:16:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2020-10-25 23:16:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2020-10-25 23:16:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-10-25 23:16:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4120 transitions. [2020-10-25 23:16:50,698 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4120 transitions. Word has length 92 [2020-10-25 23:16:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:50,698 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4120 transitions. [2020-10-25 23:16:50,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4120 transitions. [2020-10-25 23:16:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-25 23:16:50,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:50,703 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-25 23:16:50,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:16:50,703 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1737719815, now seen corresponding path program 1 times [2020-10-25 23:16:50,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:50,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600739] [2020-10-25 23:16:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:50,750 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-25 23:16:50,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600739] [2020-10-25 23:16:50,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:50,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:50,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929776288] [2020-10-25 23:16:50,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:50,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:50,752 INFO L87 Difference]: Start difference. First operand 3452 states and 4120 transitions. Second operand 3 states. [2020-10-25 23:16:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:51,004 INFO L93 Difference]: Finished difference Result 5607 states and 6726 transitions. [2020-10-25 23:16:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:51,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-10-25 23:16:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:51,020 INFO L225 Difference]: With dead ends: 5607 [2020-10-25 23:16:51,020 INFO L226 Difference]: Without dead ends: 3452 [2020-10-25 23:16:51,024 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-25 23:16:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2020-10-25 23:16:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3438. [2020-10-25 23:16:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2020-10-25 23:16:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4042 transitions. [2020-10-25 23:16:51,299 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4042 transitions. Word has length 115 [2020-10-25 23:16:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:51,300 INFO L481 AbstractCegarLoop]: Abstraction has 3438 states and 4042 transitions. [2020-10-25 23:16:51,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4042 transitions. [2020-10-25 23:16:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-25 23:16:51,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:51,305 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-25 23:16:51,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:16:51,306 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2020-10-25 23:16:51,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:51,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500472279] [2020-10-25 23:16:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:51,379 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-25 23:16:51,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500472279] [2020-10-25 23:16:51,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:51,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:51,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214523431] [2020-10-25 23:16:51,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:51,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:51,383 INFO L87 Difference]: Start difference. First operand 3438 states and 4042 transitions. Second operand 3 states. [2020-10-25 23:16:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:51,743 INFO L93 Difference]: Finished difference Result 7668 states and 8933 transitions. [2020-10-25 23:16:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:51,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-25 23:16:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:51,756 INFO L225 Difference]: With dead ends: 7668 [2020-10-25 23:16:51,757 INFO L226 Difference]: Without dead ends: 2540 [2020-10-25 23:16:51,764 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-25 23:16:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2020-10-25 23:16:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2462. [2020-10-25 23:16:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2020-10-25 23:16:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2756 transitions. [2020-10-25 23:16:51,981 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2756 transitions. Word has length 116 [2020-10-25 23:16:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:51,981 INFO L481 AbstractCegarLoop]: Abstraction has 2462 states and 2756 transitions. [2020-10-25 23:16:51,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2756 transitions. [2020-10-25 23:16:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-25 23:16:51,985 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:51,985 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-25 23:16:51,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 23:16:51,986 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2020-10-25 23:16:51,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:51,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620482214] [2020-10-25 23:16:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:52,052 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-25 23:16:52,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620482214] [2020-10-25 23:16:52,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:52,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:52,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879042240] [2020-10-25 23:16:52,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:52,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:52,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:52,061 INFO L87 Difference]: Start difference. First operand 2462 states and 2756 transitions. Second operand 3 states. [2020-10-25 23:16:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:52,252 INFO L93 Difference]: Finished difference Result 4250 states and 4773 transitions. [2020-10-25 23:16:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:52,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-10-25 23:16:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:52,264 INFO L225 Difference]: With dead ends: 4250 [2020-10-25 23:16:52,265 INFO L226 Difference]: Without dead ends: 2462 [2020-10-25 23:16:52,268 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-25 23:16:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2020-10-25 23:16:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2020-10-25 23:16:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2020-10-25 23:16:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2722 transitions. [2020-10-25 23:16:52,434 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2722 transitions. Word has length 117 [2020-10-25 23:16:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:52,434 INFO L481 AbstractCegarLoop]: Abstraction has 2462 states and 2722 transitions. [2020-10-25 23:16:52,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2722 transitions. [2020-10-25 23:16:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-10-25 23:16:52,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:52,438 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-25 23:16:52,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 23:16:52,439 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2020-10-25 23:16:52,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:52,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925983345] [2020-10-25 23:16:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:16:52,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:16:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:16:52,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:16:52,568 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:16:52,568 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:16:52,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:16:52,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:16:52 BoogieIcfgContainer [2020-10-25 23:16:52,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:16:52,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:16:52,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:16:52,718 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:16:52,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:45" (3/4) ... [2020-10-25 23:16:52,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:16:52,888 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:16:52,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:16:52,891 INFO L168 Benchmark]: Toolchain (without parser) took 9126.74 ms. Allocated memory was 44.0 MB in the beginning and 482.3 MB in the end (delta: 438.3 MB). Free memory was 21.7 MB in the beginning and 194.1 MB in the end (delta: -172.4 MB). Peak memory consumption was 267.4 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,894 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 44.0 MB. Free memory is still 29.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:16:52,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.00 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.1 MB in the beginning and 38.8 MB in the end (delta: -17.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 54.5 MB. Free memory was 38.6 MB in the beginning and 35.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,895 INFO L168 Benchmark]: Boogie Preprocessor took 50.14 ms. Allocated memory is still 54.5 MB. Free memory was 35.9 MB in the beginning and 33.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,896 INFO L168 Benchmark]: RCFGBuilder took 1081.09 ms. Allocated memory is still 54.5 MB. Free memory was 33.4 MB in the beginning and 29.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,896 INFO L168 Benchmark]: TraceAbstraction took 7344.07 ms. Allocated memory was 54.5 MB in the beginning and 482.3 MB in the end (delta: 427.8 MB). Free memory was 28.8 MB in the beginning and 210.8 MB in the end (delta: -182.0 MB). Peak memory consumption was 245.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,897 INFO L168 Benchmark]: Witness Printer took 170.75 ms. Allocated memory is still 482.3 MB. Free memory was 209.8 MB in the beginning and 194.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:52,900 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.16 ms. Allocated memory is still 44.0 MB. Free memory is still 29.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 398.00 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.1 MB in the beginning and 38.8 MB in the end (delta: -17.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 54.5 MB. Free memory was 38.6 MB in the beginning and 35.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.14 ms. Allocated memory is still 54.5 MB. Free memory was 35.9 MB in the beginning and 33.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1081.09 ms. Allocated memory is still 54.5 MB. Free memory was 33.4 MB in the beginning and 29.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7344.07 ms. Allocated memory was 54.5 MB in the beginning and 482.3 MB in the end (delta: 427.8 MB). Free memory was 28.8 MB in the beginning and 210.8 MB in the end (delta: -182.0 MB). Peak memory consumption was 245.6 MB. Max. memory is 16.1 GB. * Witness Printer took 170.75 ms. Allocated memory is still 482.3 MB. Free memory was 209.8 MB in the beginning and 194.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 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.1s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.3s, 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s 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...