./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.01.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 278371fb5fb32cd768dabde497dd9d5964ee74d9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:53:04,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:53:04,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:53:04,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:53:04,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:53:04,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:53:04,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:53:04,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:53:04,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:53:04,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:53:04,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:53:04,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:53:04,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:53:04,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:53:04,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:53:04,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:53:04,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:53:04,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:53:04,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:53:04,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:53:04,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:53:04,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:53:04,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:53:04,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:53:04,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:53:04,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:53:04,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:53:04,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:53:04,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:53:04,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:53:04,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:53:04,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:53:04,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:53:04,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:53:04,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:53:04,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:53:04,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:53:04,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:53:04,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:53:04,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:53:04,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:53:04,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:53:04,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:53:04,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:53:04,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:53:04,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:53:04,608 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:53:04,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:53:04,609 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:53:04,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:53:04,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:53:04,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:53:04,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:53:04,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:53:04,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:53:04,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:53:04,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:53:04,612 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:53:04,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:53:04,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:53:04,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:53:04,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:53:04,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:53:04,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:04,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:53:04,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:53:04,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:53:04,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:53:04,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:53:04,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:53:04,616 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:53:04,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 278371fb5fb32cd768dabde497dd9d5964ee74d9 [2020-10-20 01:53:04,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:53:04,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:53:04,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:53:04,884 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:53:04,885 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:53:04,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2020-10-20 01:53:04,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996c17362/317b952c0cf442a98fa337d3ce03fe2c/FLAGda04dda73 [2020-10-20 01:53:05,406 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:53:05,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2020-10-20 01:53:05,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996c17362/317b952c0cf442a98fa337d3ce03fe2c/FLAGda04dda73 [2020-10-20 01:53:05,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996c17362/317b952c0cf442a98fa337d3ce03fe2c [2020-10-20 01:53:05,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:53:05,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:53:05,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:05,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:53:05,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:53:05,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:05" (1/1) ... [2020-10-20 01:53:05,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22997cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:05, skipping insertion in model container [2020-10-20 01:53:05,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:05" (1/1) ... [2020-10-20 01:53:05,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:53:05,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:53:06,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:06,297 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:53:06,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:06,411 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:53:06,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06 WrapperNode [2020-10-20 01:53:06,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:06,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:06,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:53:06,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:53:06,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:06,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:53:06,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:53:06,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:53:06,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... [2020-10-20 01:53:06,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:53:06,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:53:06,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:53:06,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:53:06,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:53:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:53:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:53:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:53:07,227 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:53:07,228 INFO L298 CfgBuilder]: Removed 75 assume(true) statements. [2020-10-20 01:53:07,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:07 BoogieIcfgContainer [2020-10-20 01:53:07,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:53:07,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:53:07,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:53:07,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:53:07,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:53:05" (1/3) ... [2020-10-20 01:53:07,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5dcb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:07, skipping insertion in model container [2020-10-20 01:53:07,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:06" (2/3) ... [2020-10-20 01:53:07,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5dcb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:07, skipping insertion in model container [2020-10-20 01:53:07,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:07" (3/3) ... [2020-10-20 01:53:07,239 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-10-20 01:53:07,252 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:53:07,262 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:53:07,276 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:53:07,315 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:53:07,316 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:53:07,316 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:53:07,316 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:53:07,316 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:53:07,317 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:53:07,317 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:53:07,317 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:53:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2020-10-20 01:53:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:07,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:07,346 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] [2020-10-20 01:53:07,346 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2020-10-20 01:53:07,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:07,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358807339] [2020-10-20 01:53:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:07,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358807339] [2020-10-20 01:53:07,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:07,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:07,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314746645] [2020-10-20 01:53:07,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:07,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,552 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2020-10-20 01:53:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:07,611 INFO L93 Difference]: Finished difference Result 240 states and 374 transitions. [2020-10-20 01:53:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:07,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-20 01:53:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:07,627 INFO L225 Difference]: With dead ends: 240 [2020-10-20 01:53:07,627 INFO L226 Difference]: Without dead ends: 118 [2020-10-20 01:53:07,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-20 01:53:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-10-20 01:53:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-20 01:53:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2020-10-20 01:53:07,694 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2020-10-20 01:53:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:07,694 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2020-10-20 01:53:07,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2020-10-20 01:53:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:07,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:07,696 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] [2020-10-20 01:53:07,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:53:07,697 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2020-10-20 01:53:07,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:07,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010587580] [2020-10-20 01:53:07,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:07,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010587580] [2020-10-20 01:53:07,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:07,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:07,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095176762] [2020-10-20 01:53:07,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:07,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,763 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2020-10-20 01:53:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:07,881 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2020-10-20 01:53:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:07,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-20 01:53:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:07,885 INFO L225 Difference]: With dead ends: 308 [2020-10-20 01:53:07,885 INFO L226 Difference]: Without dead ends: 196 [2020-10-20 01:53:07,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-10-20 01:53:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2020-10-20 01:53:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-20 01:53:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2020-10-20 01:53:07,920 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2020-10-20 01:53:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:07,921 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2020-10-20 01:53:07,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2020-10-20 01:53:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:07,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:07,923 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] [2020-10-20 01:53:07,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:53:07,923 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2020-10-20 01:53:07,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:07,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862074369] [2020-10-20 01:53:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:07,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862074369] [2020-10-20 01:53:07,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:07,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:07,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949968246] [2020-10-20 01:53:07,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:07,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,995 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2020-10-20 01:53:08,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:08,037 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2020-10-20 01:53:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:08,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-20 01:53:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:08,040 INFO L225 Difference]: With dead ends: 381 [2020-10-20 01:53:08,040 INFO L226 Difference]: Without dead ends: 194 [2020-10-20 01:53:08,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-20 01:53:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-20 01:53:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-20 01:53:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2020-10-20 01:53:08,065 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2020-10-20 01:53:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:08,066 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2020-10-20 01:53:08,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2020-10-20 01:53:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:08,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:08,068 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] [2020-10-20 01:53:08,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:53:08,068 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2020-10-20 01:53:08,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:08,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381496948] [2020-10-20 01:53:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:08,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381496948] [2020-10-20 01:53:08,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:08,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:08,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133810386] [2020-10-20 01:53:08,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:08,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:08,121 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2020-10-20 01:53:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:08,170 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2020-10-20 01:53:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:08,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-20 01:53:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:08,172 INFO L225 Difference]: With dead ends: 380 [2020-10-20 01:53:08,173 INFO L226 Difference]: Without dead ends: 194 [2020-10-20 01:53:08,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-20 01:53:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-20 01:53:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-20 01:53:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2020-10-20 01:53:08,207 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2020-10-20 01:53:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:08,208 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2020-10-20 01:53:08,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2020-10-20 01:53:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:08,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:08,209 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] [2020-10-20 01:53:08,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:53:08,210 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2020-10-20 01:53:08,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:08,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862005751] [2020-10-20 01:53:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:08,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862005751] [2020-10-20 01:53:08,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:08,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:08,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221002045] [2020-10-20 01:53:08,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:08,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:08,273 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 5 states. [2020-10-20 01:53:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:08,422 INFO L93 Difference]: Finished difference Result 628 states and 846 transitions. [2020-10-20 01:53:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:08,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-10-20 01:53:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:08,426 INFO L225 Difference]: With dead ends: 628 [2020-10-20 01:53:08,426 INFO L226 Difference]: Without dead ends: 449 [2020-10-20 01:53:08,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-10-20 01:53:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 203. [2020-10-20 01:53:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-20 01:53:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 266 transitions. [2020-10-20 01:53:08,451 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 266 transitions. Word has length 37 [2020-10-20 01:53:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:08,454 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 266 transitions. [2020-10-20 01:53:08,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2020-10-20 01:53:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:08,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:08,457 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] [2020-10-20 01:53:08,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:53:08,457 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:08,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2056966386, now seen corresponding path program 1 times [2020-10-20 01:53:08,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:08,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970450500] [2020-10-20 01:53:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:08,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970450500] [2020-10-20 01:53:08,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:08,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:08,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326678586] [2020-10-20 01:53:08,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:08,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:08,541 INFO L87 Difference]: Start difference. First operand 203 states and 266 transitions. Second operand 5 states. [2020-10-20 01:53:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:08,670 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2020-10-20 01:53:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:08,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-10-20 01:53:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:08,673 INFO L225 Difference]: With dead ends: 540 [2020-10-20 01:53:08,674 INFO L226 Difference]: Without dead ends: 359 [2020-10-20 01:53:08,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-20 01:53:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 209. [2020-10-20 01:53:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-20 01:53:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2020-10-20 01:53:08,698 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 37 [2020-10-20 01:53:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:08,698 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2020-10-20 01:53:08,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2020-10-20 01:53:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:53:08,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:08,700 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] [2020-10-20 01:53:08,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:53:08,700 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash 62821680, now seen corresponding path program 1 times [2020-10-20 01:53:08,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:08,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100854939] [2020-10-20 01:53:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:08,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100854939] [2020-10-20 01:53:08,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:08,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:08,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480362497] [2020-10-20 01:53:08,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:08,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:08,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:08,766 INFO L87 Difference]: Start difference. First operand 209 states and 268 transitions. Second operand 3 states. [2020-10-20 01:53:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:08,847 INFO L93 Difference]: Finished difference Result 554 states and 708 transitions. [2020-10-20 01:53:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:08,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-20 01:53:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:08,850 INFO L225 Difference]: With dead ends: 554 [2020-10-20 01:53:08,850 INFO L226 Difference]: Without dead ends: 370 [2020-10-20 01:53:08,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-20 01:53:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 355. [2020-10-20 01:53:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-10-20 01:53:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 443 transitions. [2020-10-20 01:53:08,890 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 443 transitions. Word has length 37 [2020-10-20 01:53:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:08,892 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 443 transitions. [2020-10-20 01:53:08,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 443 transitions. [2020-10-20 01:53:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 01:53:08,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:08,904 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] [2020-10-20 01:53:08,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:53:08,905 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1851829351, now seen corresponding path program 1 times [2020-10-20 01:53:08,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:08,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307987499] [2020-10-20 01:53:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:09,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307987499] [2020-10-20 01:53:09,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:09,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:09,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547757002] [2020-10-20 01:53:09,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:09,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,014 INFO L87 Difference]: Start difference. First operand 355 states and 443 transitions. Second operand 3 states. [2020-10-20 01:53:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:09,124 INFO L93 Difference]: Finished difference Result 967 states and 1214 transitions. [2020-10-20 01:53:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:09,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-10-20 01:53:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:09,129 INFO L225 Difference]: With dead ends: 967 [2020-10-20 01:53:09,129 INFO L226 Difference]: Without dead ends: 642 [2020-10-20 01:53:09,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-10-20 01:53:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 634. [2020-10-20 01:53:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-10-20 01:53:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 784 transitions. [2020-10-20 01:53:09,193 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 784 transitions. Word has length 38 [2020-10-20 01:53:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:09,198 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 784 transitions. [2020-10-20 01:53:09,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 784 transitions. [2020-10-20 01:53:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:53:09,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:09,201 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:09,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:53:09,201 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1992530247, now seen corresponding path program 1 times [2020-10-20 01:53:09,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:09,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848305267] [2020-10-20 01:53:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:09,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848305267] [2020-10-20 01:53:09,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:09,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:09,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641055431] [2020-10-20 01:53:09,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:09,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:09,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:09,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:09,313 INFO L87 Difference]: Start difference. First operand 634 states and 784 transitions. Second operand 4 states. [2020-10-20 01:53:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:09,488 INFO L93 Difference]: Finished difference Result 1784 states and 2213 transitions. [2020-10-20 01:53:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:09,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-10-20 01:53:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:09,495 INFO L225 Difference]: With dead ends: 1784 [2020-10-20 01:53:09,495 INFO L226 Difference]: Without dead ends: 921 [2020-10-20 01:53:09,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2020-10-20 01:53:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2020-10-20 01:53:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2020-10-20 01:53:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1123 transitions. [2020-10-20 01:53:09,565 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1123 transitions. Word has length 51 [2020-10-20 01:53:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:09,565 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 1123 transitions. [2020-10-20 01:53:09,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1123 transitions. [2020-10-20 01:53:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-20 01:53:09,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:09,567 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:53:09,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:53:09,568 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2020-10-20 01:53:09,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:09,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370595805] [2020-10-20 01:53:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:09,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:09,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:09,682 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:53:09,682 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:53:09,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:53:09,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:53:09 BoogieIcfgContainer [2020-10-20 01:53:09,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:53:09,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:53:09,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:53:09,817 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:53:09,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:07" (3/4) ... [2020-10-20 01:53:09,820 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:53:09,965 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:53:09,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:53:09,971 INFO L168 Benchmark]: Toolchain (without parser) took 4135.09 ms. Allocated memory was 36.7 MB in the beginning and 70.3 MB in the end (delta: 33.6 MB). Free memory was 19.9 MB in the beginning and 26.6 MB in the end (delta: -6.7 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,972 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 33.6 MB. Free memory was 11.9 MB in the beginning and 11.9 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.24 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 19.0 MB in the beginning and 23.1 MB in the end (delta: -4.1 MB). Peak memory consumption was 10.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.41 ms. Allocated memory is still 44.0 MB. Free memory was 23.1 MB in the beginning and 20.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,973 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 44.0 MB. Free memory was 20.5 MB in the beginning and 18.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,974 INFO L168 Benchmark]: RCFGBuilder took 682.56 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 18.4 MB in the beginning and 14.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,975 INFO L168 Benchmark]: TraceAbstraction took 2584.40 ms. Allocated memory was 46.1 MB in the beginning and 70.3 MB in the end (delta: 24.1 MB). Free memory was 14.5 MB in the beginning and 36.5 MB in the end (delta: -22.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,975 INFO L168 Benchmark]: Witness Printer took 151.15 ms. Allocated memory is still 70.3 MB. Free memory was 36.5 MB in the beginning and 26.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:09,980 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.32 ms. Allocated memory is still 33.6 MB. Free memory was 11.9 MB in the beginning and 11.9 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 573.24 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 19.0 MB in the beginning and 23.1 MB in the end (delta: -4.1 MB). Peak memory consumption was 10.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 92.41 ms. Allocated memory is still 44.0 MB. Free memory was 23.1 MB in the beginning and 20.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 44.0 MB. Free memory was 20.5 MB in the beginning and 18.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 682.56 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 18.4 MB in the beginning and 14.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 2584.40 ms. Allocated memory was 46.1 MB in the beginning and 70.3 MB in the end (delta: 24.1 MB). Free memory was 14.5 MB in the beginning and 36.5 MB in the end (delta: -22.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Witness Printer took 151.15 ms. Allocated memory is still 70.3 MB. Free memory was 36.5 MB in the beginning and 26.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int E_1 = 2; VAL [E_1=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] [L441] int __retres1 ; [L356] m_i = 1 [L357] t1_i = 1 VAL [E_1=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] [L382] int kernel_st ; [L383] int tmp ; [L384] int tmp___0 ; [L388] kernel_st = 0 VAL [E_1=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] [L153] COND TRUE m_i == 1 [L154] m_st = 0 VAL [E_1=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] [L158] COND TRUE t1_i == 1 [L159] t1_st = 0 VAL [E_1=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] [L242] COND FALSE !(M_E == 0) VAL [E_1=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] [L247] COND FALSE !(T1_E == 0) VAL [E_1=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] [L252] COND FALSE !(E_1 == 0) VAL [E_1=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] [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; VAL [E_1=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] [L107] COND FALSE !(m_pc == 1) VAL [E_1=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] [L117] __retres1 = 0 VAL [E_1=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] [L119] return (__retres1); VAL [E_1=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] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [E_1=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] [L123] int __retres1 ; VAL [E_1=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] [L126] COND FALSE !(t1_pc == 1) VAL [E_1=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] [L136] __retres1 = 0 VAL [E_1=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] [L138] return (__retres1); VAL [E_1=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] [L298] tmp___0 = is_transmit1_triggered() [L300] COND FALSE !(\read(tmp___0)) VAL [E_1=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] [L265] COND FALSE !(M_E == 1) VAL [E_1=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] [L270] COND FALSE !(T1_E == 1) VAL [E_1=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] [L275] COND FALSE !(E_1 == 1) VAL [E_1=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] [L396] COND TRUE 1 VAL [E_1=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] [L399] kernel_st = 1 [L189] int tmp ; VAL [E_1=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] [L193] COND TRUE 1 VAL [E_1=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] [L168] int __retres1 ; VAL [E_1=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] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [E_1=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] [L184] return (__retres1); VAL [E_1=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] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [E_1=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] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [E_1=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] [L74] COND TRUE t1_pc == 0 VAL [E_1=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] [L85] COND TRUE 1 VAL [E_1=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] [L87] t1_pc = 1 [L88] t1_st = 2 VAL [E_1=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] [L193] COND TRUE 1 VAL [E_1=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] [L168] int __retres1 ; VAL [E_1=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] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [E_1=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] [L184] return (__retres1); VAL [E_1=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] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [E_1=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] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND TRUE \read(tmp_ndt_1) [L208] m_st = 1 VAL [E_1=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] [L33] COND TRUE m_pc == 0 VAL [E_1=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] [L44] COND TRUE 1 VAL [E_1=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] [L47] E_1 = 1 [L285] int tmp ; [L286] int tmp___0 ; [L104] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L107] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L119] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L123] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L126] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] COND TRUE E_1 == 1 [L128] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L138] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] tmp___0 = is_transmit1_triggered() [L300] COND TRUE \read(tmp___0) [L301] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L49] E_1 = 2 VAL [E_1=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] [L52] COND TRUE 1 VAL [E_1=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] [L54] m_pc = 1 [L55] m_st = 2 VAL [E_1=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] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [E_1=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] [L74] COND FALSE !(t1_pc == 0) VAL [E_1=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] [L77] COND TRUE t1_pc == 1 VAL [E_1=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] [L3] __assert_fail("0", "transmitter.01.cil.c", 3, "reach_error") VAL [E_1=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1528 SDtfs, 1813 SDslu, 1437 SDs, 0 SdLazy, 175 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 421 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 21541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11/11 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...