./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label16.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/eca-rers2012/Problem01_label16.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 82fd55bcca66e80c1d71fa13be1c40df80f8da42 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:38:39,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:39,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:39,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:39,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:39,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:39,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:39,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:39,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:39,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:39,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:39,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:39,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:39,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:39,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:39,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:39,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:39,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:39,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:39,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:39,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:39,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:39,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:39,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:39,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:39,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:39,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:39,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:39,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:39,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:39,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:39,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:39,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:39,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:39,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:39,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:39,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:39,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:39,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:39,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:39,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:39,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:38:39,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:39,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:39,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:39,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:39,361 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:39,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:39,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:39,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:39,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:39,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:39,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:39,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:39,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:39,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:39,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:39,367 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:39,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:39,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:39,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:39,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:39,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:39,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:39,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:39,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:39,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:39,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:39,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:39,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:39,371 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 -> 82fd55bcca66e80c1d71fa13be1c40df80f8da42 [2019-11-27 22:38:39,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:39,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:39,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:39,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:39,694 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:39,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2019-11-27 22:38:39,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b031088/cd32f5cbd63d4bfa9e0321b6718a2399/FLAG4e6e653fa [2019-11-27 22:38:40,349 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:40,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2019-11-27 22:38:40,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b031088/cd32f5cbd63d4bfa9e0321b6718a2399/FLAG4e6e653fa [2019-11-27 22:38:40,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b031088/cd32f5cbd63d4bfa9e0321b6718a2399 [2019-11-27 22:38:40,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:40,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:40,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:40,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:40,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:40,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:40" (1/1) ... [2019-11-27 22:38:40,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3463e911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:40, skipping insertion in model container [2019-11-27 22:38:40,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:40" (1/1) ... [2019-11-27 22:38:40,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:40,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:41,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:41,196 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:41,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:41,352 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:41,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41 WrapperNode [2019-11-27 22:38:41,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:41,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:41,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:41,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:41,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:41,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:41,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:41,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:41,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (1/1) ... [2019-11-27 22:38:41,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:41,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:41,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:41,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:41,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (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-27 22:38:41,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:41,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:38:42,866 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:38:42,866 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:38:42,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:42 BoogieIcfgContainer [2019-11-27 22:38:42,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:38:42,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:38:42,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:38:42,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:38:42,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:40" (1/3) ... [2019-11-27 22:38:42,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10997ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:42, skipping insertion in model container [2019-11-27 22:38:42,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:41" (2/3) ... [2019-11-27 22:38:42,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10997ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:42, skipping insertion in model container [2019-11-27 22:38:42,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:42" (3/3) ... [2019-11-27 22:38:42,878 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label16.c [2019-11-27 22:38:42,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:38:42,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:38:42,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:38:42,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:38:42,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:38:42,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:38:42,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:38:42,961 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:38:42,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:38:42,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:38:42,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:38:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:38:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-27 22:38:43,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:43,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:43,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1597904809, now seen corresponding path program 1 times [2019-11-27 22:38:43,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:43,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686975246] [2019-11-27 22:38:43,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:44,312 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-27 22:38:44,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686975246] [2019-11-27 22:38:44,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:44,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 22:38:44,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078983882] [2019-11-27 22:38:44,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:38:44,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:38:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:38:44,344 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-27 22:38:44,997 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-27 22:38:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:46,194 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-27 22:38:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:38:46,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-11-27 22:38:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:46,212 INFO L225 Difference]: With dead ends: 493 [2019-11-27 22:38:46,212 INFO L226 Difference]: Without dead ends: 193 [2019-11-27 22:38:46,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-27 22:38:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-27 22:38:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-27 22:38:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-27 22:38:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-27 22:38:46,274 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 130 [2019-11-27 22:38:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:46,275 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-27 22:38:46,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:38:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-27 22:38:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-27 22:38:46,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:46,278 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:46,279 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2062675825, now seen corresponding path program 1 times [2019-11-27 22:38:46,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:46,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511473945] [2019-11-27 22:38:46,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:46,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511473945] [2019-11-27 22:38:46,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:46,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:46,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997353] [2019-11-27 22:38:46,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:46,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:46,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:46,456 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 4 states. [2019-11-27 22:38:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:47,328 INFO L93 Difference]: Finished difference Result 588 states and 859 transitions. [2019-11-27 22:38:47,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:47,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-27 22:38:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:47,343 INFO L225 Difference]: With dead ends: 588 [2019-11-27 22:38:47,343 INFO L226 Difference]: Without dead ends: 455 [2019-11-27 22:38:47,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-27 22:38:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 324. [2019-11-27 22:38:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-27 22:38:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 437 transitions. [2019-11-27 22:38:47,377 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 437 transitions. Word has length 134 [2019-11-27 22:38:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:47,378 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 437 transitions. [2019-11-27 22:38:47,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 437 transitions. [2019-11-27 22:38:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-27 22:38:47,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:47,383 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:47,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2061250518, now seen corresponding path program 1 times [2019-11-27 22:38:47,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:47,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672435250] [2019-11-27 22:38:47,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:47,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672435250] [2019-11-27 22:38:47,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:47,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:47,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130003160] [2019-11-27 22:38:47,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:47,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:47,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:47,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:47,688 INFO L87 Difference]: Start difference. First operand 324 states and 437 transitions. Second operand 4 states. [2019-11-27 22:38:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:48,486 INFO L93 Difference]: Finished difference Result 814 states and 1168 transitions. [2019-11-27 22:38:48,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:48,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-27 22:38:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:48,494 INFO L225 Difference]: With dead ends: 814 [2019-11-27 22:38:48,496 INFO L226 Difference]: Without dead ends: 455 [2019-11-27 22:38:48,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-27 22:38:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-27 22:38:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-27 22:38:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 536 transitions. [2019-11-27 22:38:48,552 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 536 transitions. Word has length 137 [2019-11-27 22:38:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:48,552 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 536 transitions. [2019-11-27 22:38:48,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 536 transitions. [2019-11-27 22:38:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-27 22:38:48,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:48,563 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:48,566 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1412559080, now seen corresponding path program 1 times [2019-11-27 22:38:48,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:48,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669301034] [2019-11-27 22:38:48,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:38:48,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669301034] [2019-11-27 22:38:48,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:48,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:48,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157660403] [2019-11-27 22:38:48,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:48,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:48,650 INFO L87 Difference]: Start difference. First operand 455 states and 536 transitions. Second operand 3 states. [2019-11-27 22:38:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:49,115 INFO L93 Difference]: Finished difference Result 981 states and 1171 transitions. [2019-11-27 22:38:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:49,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-27 22:38:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:49,120 INFO L225 Difference]: With dead ends: 981 [2019-11-27 22:38:49,120 INFO L226 Difference]: Without dead ends: 586 [2019-11-27 22:38:49,121 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-27 22:38:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-27 22:38:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-27 22:38:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-27 22:38:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 676 transitions. [2019-11-27 22:38:49,137 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 676 transitions. Word has length 145 [2019-11-27 22:38:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:49,137 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 676 transitions. [2019-11-27 22:38:49,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 676 transitions. [2019-11-27 22:38:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-27 22:38:49,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:49,140 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:49,140 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1731311838, now seen corresponding path program 1 times [2019-11-27 22:38:49,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:49,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631614095] [2019-11-27 22:38:49,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:49,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631614095] [2019-11-27 22:38:49,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:49,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:49,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459720360] [2019-11-27 22:38:49,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:38:49,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:38:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:49,213 INFO L87 Difference]: Start difference. First operand 586 states and 676 transitions. Second operand 5 states. [2019-11-27 22:38:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:50,280 INFO L93 Difference]: Finished difference Result 1898 states and 2221 transitions. [2019-11-27 22:38:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:50,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-11-27 22:38:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:50,287 INFO L225 Difference]: With dead ends: 1898 [2019-11-27 22:38:50,288 INFO L226 Difference]: Without dead ends: 1372 [2019-11-27 22:38:50,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-27 22:38:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1241. [2019-11-27 22:38:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-27 22:38:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1410 transitions. [2019-11-27 22:38:50,316 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1410 transitions. Word has length 149 [2019-11-27 22:38:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:50,316 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 1410 transitions. [2019-11-27 22:38:50,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:38:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1410 transitions. [2019-11-27 22:38:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-27 22:38:50,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:50,320 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:50,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash 911359967, now seen corresponding path program 1 times [2019-11-27 22:38:50,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:50,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314099455] [2019-11-27 22:38:50,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:50,886 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-11-27 22:38:51,064 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-11-27 22:38:51,198 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-27 22:38:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:51,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314099455] [2019-11-27 22:38:51,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:51,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-27 22:38:51,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855380663] [2019-11-27 22:38:51,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 22:38:51,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 22:38:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:38:51,484 INFO L87 Difference]: Start difference. First operand 1241 states and 1410 transitions. Second operand 12 states. [2019-11-27 22:38:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:53,337 INFO L93 Difference]: Finished difference Result 2794 states and 3292 transitions. [2019-11-27 22:38:53,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 22:38:53,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2019-11-27 22:38:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:53,347 INFO L225 Difference]: With dead ends: 2794 [2019-11-27 22:38:53,348 INFO L226 Difference]: Without dead ends: 1579 [2019-11-27 22:38:53,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:38:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2019-11-27 22:38:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1538. [2019-11-27 22:38:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-27 22:38:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1742 transitions. [2019-11-27 22:38:53,414 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1742 transitions. Word has length 167 [2019-11-27 22:38:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:53,414 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 1742 transitions. [2019-11-27 22:38:53,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 22:38:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1742 transitions. [2019-11-27 22:38:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:38:53,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:53,419 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:53,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1583433812, now seen corresponding path program 1 times [2019-11-27 22:38:53,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:53,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050534310] [2019-11-27 22:38:53,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 22:38:53,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050534310] [2019-11-27 22:38:53,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859285917] [2019-11-27 22:38:53,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:53,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:53,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-27 22:38:53,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:53,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-27 22:38:53,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258581186] [2019-11-27 22:38:53,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:53,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:53,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:38:53,818 INFO L87 Difference]: Start difference. First operand 1538 states and 1742 transitions. Second operand 3 states. [2019-11-27 22:38:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:54,287 INFO L93 Difference]: Finished difference Result 3706 states and 4171 transitions. [2019-11-27 22:38:54,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:54,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:38:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:54,300 INFO L225 Difference]: With dead ends: 3706 [2019-11-27 22:38:54,301 INFO L226 Difference]: Without dead ends: 2228 [2019-11-27 22:38:54,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:38:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2019-11-27 22:38:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2019-11-27 22:38:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-27 22:38:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2466 transitions. [2019-11-27 22:38:54,375 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2466 transitions. Word has length 193 [2019-11-27 22:38:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:54,376 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2466 transitions. [2019-11-27 22:38:54,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2466 transitions. [2019-11-27 22:38:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-27 22:38:54,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:54,386 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:54,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:54,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash -79848107, now seen corresponding path program 1 times [2019-11-27 22:38:54,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:54,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770106156] [2019-11-27 22:38:54,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-27 22:38:54,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770106156] [2019-11-27 22:38:54,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750761294] [2019-11-27 22:38:54,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:54,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:54,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-27 22:38:55,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:55,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-27 22:38:55,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693413234] [2019-11-27 22:38:55,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:55,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:55,010 INFO L87 Difference]: Start difference. First operand 2228 states and 2466 transitions. Second operand 3 states. [2019-11-27 22:38:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:55,572 INFO L93 Difference]: Finished difference Result 4920 states and 5484 transitions. [2019-11-27 22:38:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:55,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-27 22:38:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:55,585 INFO L225 Difference]: With dead ends: 4920 [2019-11-27 22:38:55,586 INFO L226 Difference]: Without dead ends: 2752 [2019-11-27 22:38:55,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2019-11-27 22:38:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2621. [2019-11-27 22:38:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2621 states. [2019-11-27 22:38:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 2939 transitions. [2019-11-27 22:38:55,650 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 2939 transitions. Word has length 210 [2019-11-27 22:38:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:55,651 INFO L462 AbstractCegarLoop]: Abstraction has 2621 states and 2939 transitions. [2019-11-27 22:38:55,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 2939 transitions. [2019-11-27 22:38:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-27 22:38:55,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:55,660 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:55,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:55,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash 290784368, now seen corresponding path program 1 times [2019-11-27 22:38:55,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:55,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854433584] [2019-11-27 22:38:55,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 129 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-27 22:38:56,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854433584] [2019-11-27 22:38:56,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149349666] [2019-11-27 22:38:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:56,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:56,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-27 22:38:56,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:56,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-27 22:38:56,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403887724] [2019-11-27 22:38:56,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:56,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:56,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:56,249 INFO L87 Difference]: Start difference. First operand 2621 states and 2939 transitions. Second operand 3 states. [2019-11-27 22:38:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:56,778 INFO L93 Difference]: Finished difference Result 5444 states and 6130 transitions. [2019-11-27 22:38:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:56,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-27 22:38:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:56,796 INFO L225 Difference]: With dead ends: 5444 [2019-11-27 22:38:56,796 INFO L226 Difference]: Without dead ends: 2883 [2019-11-27 22:38:56,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-11-27 22:38:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2752. [2019-11-27 22:38:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-11-27 22:38:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3087 transitions. [2019-11-27 22:38:56,881 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3087 transitions. Word has length 226 [2019-11-27 22:38:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:56,882 INFO L462 AbstractCegarLoop]: Abstraction has 2752 states and 3087 transitions. [2019-11-27 22:38:56,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3087 transitions. [2019-11-27 22:38:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-27 22:38:56,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:56,895 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:57,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:57,108 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2066967986, now seen corresponding path program 1 times [2019-11-27 22:38:57,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:57,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047945289] [2019-11-27 22:38:57,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-27 22:38:57,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047945289] [2019-11-27 22:38:57,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:57,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:57,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282996609] [2019-11-27 22:38:57,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:57,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:57,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:57,226 INFO L87 Difference]: Start difference. First operand 2752 states and 3087 transitions. Second operand 4 states. [2019-11-27 22:38:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:57,799 INFO L93 Difference]: Finished difference Result 6099 states and 6881 transitions. [2019-11-27 22:38:57,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:57,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-27 22:38:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:57,816 INFO L225 Difference]: With dead ends: 6099 [2019-11-27 22:38:57,816 INFO L226 Difference]: Without dead ends: 3407 [2019-11-27 22:38:57,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2019-11-27 22:38:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 2883. [2019-11-27 22:38:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-11-27 22:38:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 3232 transitions. [2019-11-27 22:38:57,882 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 3232 transitions. Word has length 229 [2019-11-27 22:38:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:57,882 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 3232 transitions. [2019-11-27 22:38:57,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3232 transitions. [2019-11-27 22:38:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-27 22:38:57,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:57,890 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:57,890 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2098359784, now seen corresponding path program 1 times [2019-11-27 22:38:57,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:57,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620137236] [2019-11-27 22:38:57,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-27 22:38:58,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620137236] [2019-11-27 22:38:58,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300092804] [2019-11-27 22:38:58,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:58,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:58,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:38:58,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:58,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-27 22:38:58,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69617150] [2019-11-27 22:38:58,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:58,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:58,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:58,320 INFO L87 Difference]: Start difference. First operand 2883 states and 3232 transitions. Second operand 3 states. [2019-11-27 22:38:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:58,796 INFO L93 Difference]: Finished difference Result 6230 states and 7042 transitions. [2019-11-27 22:38:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:58,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-27 22:38:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:58,810 INFO L225 Difference]: With dead ends: 6230 [2019-11-27 22:38:58,810 INFO L226 Difference]: Without dead ends: 3407 [2019-11-27 22:38:58,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2019-11-27 22:38:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3145. [2019-11-27 22:38:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-11-27 22:38:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3527 transitions. [2019-11-27 22:38:58,866 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3527 transitions. Word has length 235 [2019-11-27 22:38:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:58,866 INFO L462 AbstractCegarLoop]: Abstraction has 3145 states and 3527 transitions. [2019-11-27 22:38:58,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3527 transitions. [2019-11-27 22:38:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-27 22:38:58,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:58,874 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:59,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:59,082 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -244499915, now seen corresponding path program 1 times [2019-11-27 22:38:59,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:59,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451452536] [2019-11-27 22:38:59,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 189 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-27 22:38:59,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451452536] [2019-11-27 22:38:59,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215873551] [2019-11-27 22:38:59,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:59,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:38:59,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-27 22:38:59,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:59,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-27 22:38:59,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225187925] [2019-11-27 22:38:59,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:59,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:59,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:59,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:59,438 INFO L87 Difference]: Start difference. First operand 3145 states and 3527 transitions. Second operand 3 states. [2019-11-27 22:38:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:59,910 INFO L93 Difference]: Finished difference Result 4883 states and 5449 transitions. [2019-11-27 22:38:59,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:59,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-11-27 22:38:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:59,911 INFO L225 Difference]: With dead ends: 4883 [2019-11-27 22:38:59,912 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:38:59,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:38:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:38:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:38:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:38:59,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2019-11-27 22:38:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:59,917 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:38:59,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:38:59,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:00,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:00,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:00,536 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-27 22:39:00,930 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-27 22:39:00,935 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:00,935 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:00,936 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,936 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,936 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,936 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,937 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,937 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,938 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:00,938 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:00,938 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:00,938 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:00,939 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:00,940 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:00,942 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,943 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:00,944 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:00,945 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:00,945 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:00,945 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:00,947 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1))) (let ((.cse6 (<= 14 ~a8~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (not .cse3)) (.cse7 (<= ~a16~0 5)) (.cse4 (<= ~a7~0 0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse1) (and .cse5 .cse8 .cse1 .cse3) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 (= 15 ~a8~0) (= ~a16~0 6) .cse4) (and .cse5 .cse9 .cse6 .cse7) (and .cse5 .cse9 .cse8 .cse7 .cse0) (and .cse9 (<= 15 ~a8~0) .cse4) (and .cse7 .cse4) (and .cse5 (= 13 ~a8~0) (= ~a16~0 4) .cse0 .cse1 .cse2 .cse3)))) [2019-11-27 22:39:00,947 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,947 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,947 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:00,948 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,949 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:00,950 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,951 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:00,952 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,953 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1))) (let ((.cse6 (<= 14 ~a8~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (not .cse3)) (.cse7 (<= ~a16~0 5)) (.cse4 (<= ~a7~0 0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse1) (and .cse5 .cse8 .cse1 .cse3) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 (= 15 ~a8~0) (= ~a16~0 6) .cse4) (and .cse5 .cse9 .cse6 .cse7) (and .cse5 .cse9 .cse8 .cse7 .cse0) (and .cse9 (<= 15 ~a8~0) .cse4) (and .cse7 .cse4) (and .cse5 (= 13 ~a8~0) (= ~a16~0 4) .cse0 .cse1 .cse2 .cse3)))) [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:00,954 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,955 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:00,956 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,957 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:00,958 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,959 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:00,960 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:00,961 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 566) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,962 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:00,963 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:00,964 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:00,964 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:00,964 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:00,964 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:00,964 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:00,964 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:01,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:01 BoogieIcfgContainer [2019-11-27 22:39:01,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:01,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:01,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:01,003 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:01,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:42" (3/4) ... [2019-11-27 22:39:01,014 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:01,067 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:01,068 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:01,287 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:01,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:01,289 INFO L168 Benchmark]: Toolchain (without parser) took 20671.89 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.8 MB). Free memory was 951.0 MB in the beginning and 825.5 MB in the end (delta: 125.5 MB). Peak memory consumption was 683.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,290 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:01,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.76 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,291 INFO L168 Benchmark]: Boogie Preprocessor took 70.37 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,291 INFO L168 Benchmark]: RCFGBuilder took 1349.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.6 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,292 INFO L168 Benchmark]: TraceAbstraction took 18132.33 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 410.5 MB). Free memory was 1.0 GB in the beginning and 839.8 MB in the end (delta: 161.0 MB). Peak memory consumption was 571.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,292 INFO L168 Benchmark]: Witness Printer took 285.56 ms. Allocated memory is still 1.6 GB. Free memory was 839.8 MB in the beginning and 825.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:01,294 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 734.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.76 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.37 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1349.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.6 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18132.33 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 410.5 MB). Free memory was 1.0 GB in the beginning and 839.8 MB in the end (delta: 161.0 MB). Peak memory consumption was 571.5 MB. Max. memory is 11.5 GB. * Witness Printer took 285.56 ms. Allocated memory is still 1.6 GB. Free memory was 839.8 MB in the beginning and 825.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) && a7 <= 0) || (((1 == a7 && 14 <= a8) && a16 <= 5) && a12 == 8)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) && a7 <= 0)) || (((1 == a7 && !(a20 == 1)) && 14 <= a8) && a16 <= 5)) || ((((1 == a7 && !(a20 == 1)) && a21 <= 0) && a16 <= 5) && a17 == 1)) || ((!(a20 == 1) && 15 <= a8) && a7 <= 0)) || (a16 <= 5 && a7 <= 0)) || ((((((1 == a7 && 13 == a8) && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) && a7 <= 0) || (((1 == a7 && 14 <= a8) && a16 <= 5) && a12 == 8)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) && a7 <= 0)) || (((1 == a7 && !(a20 == 1)) && 14 <= a8) && a16 <= 5)) || ((((1 == a7 && !(a20 == 1)) && a21 <= 0) && a16 <= 5) && a17 == 1)) || ((!(a20 == 1) && 15 <= a8) && a7 <= 0)) || (a16 <= 5 && a7 <= 0)) || ((((((1 == a7 && 13 == a8) && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 17.1s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1029 SDtfs, 2057 SDslu, 145 SDs, 0 SdLazy, 6174 SolverSat, 794 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1229 GetRequests, 1157 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3145occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1351 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 299 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1064 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 176 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3379 NumberOfCodeBlocks, 3379 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3362 ConstructedInterpolants, 0 QuantifiedInterpolants, 2503310 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2066 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 2121/2136 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 correct! Received shutdown request...