./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/product-lines/minepump_spec1_product42.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f3978068d3e88eb2e8d08ee6f85f2ba09bbc729 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-28 00:20:17,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:17,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:17,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:17,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:17,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:17,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:17,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:17,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:17,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:17,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:17,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:17,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:17,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:17,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:17,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:17,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:17,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:17,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:17,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:17,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:17,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:17,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:17,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:17,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:17,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:17,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:17,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:17,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:17,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:17,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:17,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:17,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:17,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:17,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:17,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:17,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:17,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:17,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:17,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:17,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:17,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:17,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:17,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:17,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:17,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:17,310 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:17,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:17,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:17,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:17,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:17,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:17,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:17,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:17,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:17,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:17,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:17,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:17,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:17,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:17,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:17,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:17,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:17,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:17,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:17,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:17,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:17,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:17,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:17,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:17,316 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(__VERIFIER_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 -> 0f3978068d3e88eb2e8d08ee6f85f2ba09bbc729 [2019-11-28 00:20:17,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:17,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:17,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:17,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:17,658 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:17,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2019-11-28 00:20:17,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dde9b9f8/4222997544024567aa3b65912f20e037/FLAG23d5d656b [2019-11-28 00:20:18,213 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:18,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2019-11-28 00:20:18,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dde9b9f8/4222997544024567aa3b65912f20e037/FLAG23d5d656b [2019-11-28 00:20:18,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dde9b9f8/4222997544024567aa3b65912f20e037 [2019-11-28 00:20:18,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:18,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:18,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:18,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:18,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:18,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:18" (1/1) ... [2019-11-28 00:20:18,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bfba7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18, skipping insertion in model container [2019-11-28 00:20:18,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:18" (1/1) ... [2019-11-28 00:20:18,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:18,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:19,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:19,016 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:19,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:19,144 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:19,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19 WrapperNode [2019-11-28 00:20:19,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:19,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:19,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:19,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:19,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:19,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:19,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:19,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:19,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:19,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:19,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:19,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:19,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:19,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:20,115 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:20,115 INFO L297 CfgBuilder]: Removed 116 assume(true) statements. [2019-11-28 00:20:20,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20 BoogieIcfgContainer [2019-11-28 00:20:20,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:20,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:20,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:20,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:20,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:18" (1/3) ... [2019-11-28 00:20:20,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f51a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:20, skipping insertion in model container [2019-11-28 00:20:20,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (2/3) ... [2019-11-28 00:20:20,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f51a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:20, skipping insertion in model container [2019-11-28 00:20:20,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20" (3/3) ... [2019-11-28 00:20:20,133 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product42.cil.c [2019-11-28 00:20:20,143 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:20,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:20,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:20,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:20,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:20,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:20,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:20,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:20,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:20,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:20,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-28 00:20:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:20,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:20,236 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1594902839, now seen corresponding path program 1 times [2019-11-28 00:20:20,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362845076] [2019-11-28 00:20:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:20,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362845076] [2019-11-28 00:20:20,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:20,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885061817] [2019-11-28 00:20:20,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:20,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:20,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:20,533 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2019-11-28 00:20:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,570 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-11-28 00:20:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:20,572 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,585 INFO L225 Difference]: With dead ends: 168 [2019-11-28 00:20:20,586 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:20:20,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:20:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 00:20:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:20:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2019-11-28 00:20:20,639 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2019-11-28 00:20:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,639 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2019-11-28 00:20:20,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2019-11-28 00:20:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:20,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:20,642 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1653307560, now seen corresponding path program 1 times [2019-11-28 00:20:20,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772889027] [2019-11-28 00:20:20,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:20,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772889027] [2019-11-28 00:20:20,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:20,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183527522] [2019-11-28 00:20:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:20,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,794 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2019-11-28 00:20:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,807 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-11-28 00:20:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:20,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,809 INFO L225 Difference]: With dead ends: 83 [2019-11-28 00:20:20,809 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 00:20:20,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 00:20:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 00:20:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:20:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-11-28 00:20:20,823 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2019-11-28 00:20:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,824 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-11-28 00:20:20,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-11-28 00:20:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:20,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,826 INFO L410 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] [2019-11-28 00:20:20,826 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,826 INFO L82 PathProgramCache]: Analyzing trace with hash 533078269, now seen corresponding path program 1 times [2019-11-28 00:20:20,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29047274] [2019-11-28 00:20:20,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:20,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29047274] [2019-11-28 00:20:20,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:20,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168754282] [2019-11-28 00:20:20,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:20,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:20,984 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 5 states. [2019-11-28 00:20:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,052 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2019-11-28 00:20:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:20:21,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:20:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,054 INFO L225 Difference]: With dead ends: 68 [2019-11-28 00:20:21,054 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 00:20:21,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 00:20:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 00:20:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:20:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-11-28 00:20:21,062 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-11-28 00:20:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,065 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-28 00:20:21,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-11-28 00:20:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:20:21,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,067 INFO L410 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] [2019-11-28 00:20:21,067 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 545820985, now seen corresponding path program 1 times [2019-11-28 00:20:21,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807187077] [2019-11-28 00:20:21,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:21,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807187077] [2019-11-28 00:20:21,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:21,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273853984] [2019-11-28 00:20:21,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,135 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-11-28 00:20:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,170 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2019-11-28 00:20:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:21,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:20:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,172 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:20:21,173 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 00:20:21,174 INFO L630 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 [2019-11-28 00:20:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 00:20:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-28 00:20:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:20:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-11-28 00:20:21,189 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2019-11-28 00:20:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,189 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-11-28 00:20:21,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-11-28 00:20:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 00:20:21,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,193 INFO L410 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] [2019-11-28 00:20:21,193 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2110814541, now seen corresponding path program 1 times [2019-11-28 00:20:21,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425632466] [2019-11-28 00:20:21,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:21,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425632466] [2019-11-28 00:20:21,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:21,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017747317] [2019-11-28 00:20:21,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,338 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 5 states. [2019-11-28 00:20:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,473 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2019-11-28 00:20:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:21,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 00:20:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,478 INFO L225 Difference]: With dead ends: 266 [2019-11-28 00:20:21,478 INFO L226 Difference]: Without dead ends: 216 [2019-11-28 00:20:21,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-28 00:20:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 100. [2019-11-28 00:20:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 00:20:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2019-11-28 00:20:21,513 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 29 [2019-11-28 00:20:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,514 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2019-11-28 00:20:21,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2019-11-28 00:20:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:20:21,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,520 INFO L410 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] [2019-11-28 00:20:21,520 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 331369175, now seen corresponding path program 1 times [2019-11-28 00:20:21,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380479248] [2019-11-28 00:20:21,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:21,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380479248] [2019-11-28 00:20:21,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:21,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338018371] [2019-11-28 00:20:21,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,611 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand 5 states. [2019-11-28 00:20:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,717 INFO L93 Difference]: Finished difference Result 280 states and 394 transitions. [2019-11-28 00:20:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:21,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:20:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,719 INFO L225 Difference]: With dead ends: 280 [2019-11-28 00:20:21,720 INFO L226 Difference]: Without dead ends: 278 [2019-11-28 00:20:21,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-28 00:20:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-11-28 00:20:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 00:20:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2019-11-28 00:20:21,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 30 [2019-11-28 00:20:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,736 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2019-11-28 00:20:21,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2019-11-28 00:20:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:21,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,738 INFO L410 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] [2019-11-28 00:20:21,738 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash 261712181, now seen corresponding path program 1 times [2019-11-28 00:20:21,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876634073] [2019-11-28 00:20:21,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:21,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876634073] [2019-11-28 00:20:21,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:21,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503886270] [2019-11-28 00:20:21,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,798 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2019-11-28 00:20:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,861 INFO L93 Difference]: Finished difference Result 270 states and 372 transitions. [2019-11-28 00:20:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:21,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:20:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,863 INFO L225 Difference]: With dead ends: 270 [2019-11-28 00:20:21,863 INFO L226 Difference]: Without dead ends: 176 [2019-11-28 00:20:21,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-28 00:20:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2019-11-28 00:20:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 00:20:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-11-28 00:20:21,878 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 33 [2019-11-28 00:20:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,879 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-11-28 00:20:21,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-11-28 00:20:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:21,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,880 INFO L410 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] [2019-11-28 00:20:21,881 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -325093833, now seen corresponding path program 1 times [2019-11-28 00:20:21,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595548753] [2019-11-28 00:20:21,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:21,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595548753] [2019-11-28 00:20:21,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:21,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383230434] [2019-11-28 00:20:21,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:21,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:21,943 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 4 states. [2019-11-28 00:20:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,991 INFO L93 Difference]: Finished difference Result 252 states and 342 transitions. [2019-11-28 00:20:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:21,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 00:20:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,993 INFO L225 Difference]: With dead ends: 252 [2019-11-28 00:20:21,993 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 00:20:21,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 00:20:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2019-11-28 00:20:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 00:20:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2019-11-28 00:20:22,010 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 33 [2019-11-28 00:20:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,010 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2019-11-28 00:20:22,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2019-11-28 00:20:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:22,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,012 INFO L410 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] [2019-11-28 00:20:22,012 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1604957511, now seen corresponding path program 1 times [2019-11-28 00:20:22,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648032222] [2019-11-28 00:20:22,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:22,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648032222] [2019-11-28 00:20:22,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:22,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754345108] [2019-11-28 00:20:22,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:22,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:22,068 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand 3 states. [2019-11-28 00:20:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,101 INFO L93 Difference]: Finished difference Result 262 states and 352 transitions. [2019-11-28 00:20:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:20:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,104 INFO L225 Difference]: With dead ends: 262 [2019-11-28 00:20:22,104 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 00:20:22,105 INFO L630 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 [2019-11-28 00:20:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 00:20:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-28 00:20:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 00:20:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2019-11-28 00:20:22,121 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 33 [2019-11-28 00:20:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,121 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2019-11-28 00:20:22,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2019-11-28 00:20:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:20:22,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,122 INFO L410 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] [2019-11-28 00:20:22,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -447661573, now seen corresponding path program 1 times [2019-11-28 00:20:22,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579013840] [2019-11-28 00:20:22,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:22,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579013840] [2019-11-28 00:20:22,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:20:22,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711093582] [2019-11-28 00:20:22,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:22,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:22,192 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand 6 states. [2019-11-28 00:20:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,405 INFO L93 Difference]: Finished difference Result 482 states and 630 transitions. [2019-11-28 00:20:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:20:22,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 00:20:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,407 INFO L225 Difference]: With dead ends: 482 [2019-11-28 00:20:22,407 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 00:20:22,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:20:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 00:20:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 158. [2019-11-28 00:20:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 00:20:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2019-11-28 00:20:22,454 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 34 [2019-11-28 00:20:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,454 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2019-11-28 00:20:22,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2019-11-28 00:20:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 00:20:22,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,455 INFO L410 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] [2019-11-28 00:20:22,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2059222374, now seen corresponding path program 1 times [2019-11-28 00:20:22,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300594412] [2019-11-28 00:20:22,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:22,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:22,639 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:22,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:22 BoogieIcfgContainer [2019-11-28 00:20:22,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:22,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:22,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:22,802 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:22,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20" (3/4) ... [2019-11-28 00:20:22,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:22,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:22,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:22,993 INFO L168 Benchmark]: Toolchain (without parser) took 4429.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,993 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,994 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,994 INFO L168 Benchmark]: RCFGBuilder took 852.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,995 INFO L168 Benchmark]: TraceAbstraction took 2681.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,995 INFO L168 Benchmark]: Witness Printer took 189.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,997 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 852.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2681.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 189.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 764]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L413] int waterLevel = 1; [L414] int methaneLevelCritical = 0; [L581] int pumpRunning = 0; [L582] int systemActive = 1; [L833] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L906] int retValue_acc ; [L907] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] int retValue_acc ; [L827] retValue_acc = 1 [L828] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L913] tmp = valid_product() [L915] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L511] int splverifierCounter ; [L512] int tmp ; [L513] int tmp___0 ; [L514] int tmp___1 ; [L515] int tmp___2 ; [L518] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L522] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L528] tmp = __VERIFIER_nondet_int() [L530] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE waterLevel < 2 [L432] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] tmp___0 = __VERIFIER_nondet_int() [L540] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L548] tmp___2 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___2) [L755] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L589] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L621] COND TRUE ! pumpRunning [L733] int retValue_acc ; [L734] int tmp ; [L735] int tmp___0 ; [L493] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L496] COND FALSE !(waterLevel < 2) [L500] retValue_acc = 0 [L501] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L739] tmp = isHighWaterSensorDry() [L741] COND FALSE !(\read(tmp)) [L744] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L746] retValue_acc = tmp___0 [L747] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L623] tmp = isHighWaterLevel() [L625] COND TRUE \read(tmp) [L652] int tmp ; [L677] int retValue_acc ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L681] retValue_acc = isMethaneLevelCritical() [L683] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isMethaneAlarm() [L658] COND FALSE !(\read(tmp)) [L646] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L770] int tmp ; [L771] int tmp___0 ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L775] tmp = isMethaneLevelCritical() [L777] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L520] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L522] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L528] tmp = __VERIFIER_nondet_int() [L530] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L538] tmp___0 = __VERIFIER_nondet_int() [L540] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L443] COND FALSE !(\read(methaneLevelCritical)) [L446] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L548] tmp___2 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___2) [L755] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L589] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L419] COND TRUE waterLevel > 0 [L420] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L596] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L621] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L770] int tmp ; [L771] int tmp___0 ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L775] tmp = isMethaneLevelCritical() [L777] COND TRUE \read(tmp) [L688] int retValue_acc ; [L691] retValue_acc = pumpRunning [L692] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L779] tmp___0 = isPumpRunning() [L781] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L764] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 748 SDtfs, 1018 SDslu, 1178 SDs, 0 SdLazy, 167 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 580 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 13590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...