./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label45.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_label45.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 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:39:21,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:39:21,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:39:21,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:39:21,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:39:21,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:39:21,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:39:21,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:39:21,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:39:21,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:39:21,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:39:21,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:39:21,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:39:21,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:39:21,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:39:21,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:39:21,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:39:21,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:39:21,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:39:21,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:39:21,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:39:21,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:39:21,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:39:21,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:39:21,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:39:21,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:39:21,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:39:21,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:39:21,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:39:21,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:39:21,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:39:21,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:39:21,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:39:21,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:39:21,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:39:21,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:39:21,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:39:21,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:39:21,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:39:21,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:39:21,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:39:21,185 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:39:21,212 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:39:21,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:39:21,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:39:21,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:39:21,214 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:39:21,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:39:21,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:39:21,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:39:21,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:39:21,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:39:21,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:39:21,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:39:21,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:39:21,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:39:21,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:39:21,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:39:21,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:39:21,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:39:21,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:39:21,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:39:21,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:39:21,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:39:21,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:39:21,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:39:21,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:39:21,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:39:21,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:39:21,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:39:21,221 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 -> 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 [2019-11-27 22:39:21,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:39:21,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:39:21,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:39:21,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:39:21,573 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:39:21,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2019-11-27 22:39:21,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7274623b9/a26f5cf99e384007a6c664e3035c9107/FLAG43181b372 [2019-11-27 22:39:22,239 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:39:22,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label45.c [2019-11-27 22:39:22,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7274623b9/a26f5cf99e384007a6c664e3035c9107/FLAG43181b372 [2019-11-27 22:39:22,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7274623b9/a26f5cf99e384007a6c664e3035c9107 [2019-11-27 22:39:22,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:39:22,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:39:22,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:39:22,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:39:22,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:39:22,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:39:22" (1/1) ... [2019-11-27 22:39:22,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa2590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:22, skipping insertion in model container [2019-11-27 22:39:22,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:39:22" (1/1) ... [2019-11-27 22:39:22,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:39:22,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:39:23,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:39:23,204 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:39:23,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:39:23,329 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:39:23,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23 WrapperNode [2019-11-27 22:39:23,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:39:23,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:39:23,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:39:23,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:39:23,339 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:39:23" (1/1) ... [2019-11-27 22:39:23,368 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:39:23" (1/1) ... [2019-11-27 22:39:23,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:39:23,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:39:23,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:39:23,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:39:23,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (1/1) ... [2019-11-27 22:39:23,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:39:23,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:39:23,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:39:23,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:39:23,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (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:39:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:39:23,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:39:24,792 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:39:24,793 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:39:24,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:24 BoogieIcfgContainer [2019-11-27 22:39:24,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:39:24,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:39:24,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:39:24,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:39:24,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:39:22" (1/3) ... [2019-11-27 22:39:24,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d18d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:24, skipping insertion in model container [2019-11-27 22:39:24,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:39:23" (2/3) ... [2019-11-27 22:39:24,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d18d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:24, skipping insertion in model container [2019-11-27 22:39:24,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:24" (3/3) ... [2019-11-27 22:39:24,805 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label45.c [2019-11-27 22:39:24,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:39:24,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:39:24,842 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:39:24,877 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:39:24,877 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:39:24,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:39:24,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:39:24,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:39:24,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:39:24,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:39:24,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:39:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:39:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 22:39:24,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:24,934 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] [2019-11-27 22:39:24,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -286323610, now seen corresponding path program 1 times [2019-11-27 22:39:24,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:24,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185763250] [2019-11-27 22:39:24,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:25,382 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:39:25,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185763250] [2019-11-27 22:39:25,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:25,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:25,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793241268] [2019-11-27 22:39:25,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:25,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:25,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:25,411 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-27 22:39:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:26,261 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-27 22:39:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:26,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-27 22:39:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:26,281 INFO L225 Difference]: With dead ends: 528 [2019-11-27 22:39:26,281 INFO L226 Difference]: Without dead ends: 266 [2019-11-27 22:39:26,286 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:39:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-27 22:39:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-27 22:39:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:39:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-27 22:39:26,362 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 117 [2019-11-27 22:39:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:26,364 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-27 22:39:26,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-27 22:39:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-27 22:39:26,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:26,374 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:39:26,375 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1653159310, now seen corresponding path program 1 times [2019-11-27 22:39:26,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:26,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772448979] [2019-11-27 22:39:26,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:26,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772448979] [2019-11-27 22:39:26,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:26,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:26,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477298039] [2019-11-27 22:39:26,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:26,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:26,481 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-27 22:39:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:27,198 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-27 22:39:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:27,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-27 22:39:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:27,206 INFO L225 Difference]: With dead ends: 792 [2019-11-27 22:39:27,207 INFO L226 Difference]: Without dead ends: 528 [2019-11-27 22:39:27,211 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:39:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-27 22:39:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-27 22:39:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:39:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2019-11-27 22:39:27,269 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 122 [2019-11-27 22:39:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:27,270 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2019-11-27 22:39:27,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2019-11-27 22:39:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-27 22:39:27,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:27,275 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:27,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash -691237342, now seen corresponding path program 1 times [2019-11-27 22:39:27,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:27,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691547616] [2019-11-27 22:39:27,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:27,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691547616] [2019-11-27 22:39:27,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:27,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:27,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26931527] [2019-11-27 22:39:27,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:27,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:27,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:27,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:27,373 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2019-11-27 22:39:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:27,844 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2019-11-27 22:39:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:27,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-27 22:39:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:27,848 INFO L225 Difference]: With dead ends: 1185 [2019-11-27 22:39:27,849 INFO L226 Difference]: Without dead ends: 659 [2019-11-27 22:39:27,850 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:39:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-27 22:39:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2019-11-27 22:39:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:39:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2019-11-27 22:39:27,867 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 130 [2019-11-27 22:39:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:27,868 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2019-11-27 22:39:27,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2019-11-27 22:39:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-27 22:39:27,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:27,871 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:39:27,871 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -183469584, now seen corresponding path program 1 times [2019-11-27 22:39:27,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:27,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122208538] [2019-11-27 22:39:27,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:27,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122208538] [2019-11-27 22:39:27,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:27,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:27,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664177020] [2019-11-27 22:39:27,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:27,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:27,942 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2019-11-27 22:39:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:28,725 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2019-11-27 22:39:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:28,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-27 22:39:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:28,733 INFO L225 Difference]: With dead ends: 1971 [2019-11-27 22:39:28,733 INFO L226 Difference]: Without dead ends: 1445 [2019-11-27 22:39:28,735 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:39:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-27 22:39:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-27 22:39:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-27 22:39:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2019-11-27 22:39:28,775 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 139 [2019-11-27 22:39:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:28,776 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2019-11-27 22:39:28,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2019-11-27 22:39:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-27 22:39:28,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:28,781 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:39:28,781 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 7667169, now seen corresponding path program 1 times [2019-11-27 22:39:28,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:28,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95907008] [2019-11-27 22:39:28,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:28,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95907008] [2019-11-27 22:39:28,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:28,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:28,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993203938] [2019-11-27 22:39:28,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:28,973 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2019-11-27 22:39:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:29,682 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2019-11-27 22:39:29,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:29,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-27 22:39:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:29,691 INFO L225 Difference]: With dead ends: 2762 [2019-11-27 22:39:29,691 INFO L226 Difference]: Without dead ends: 1450 [2019-11-27 22:39:29,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-27 22:39:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-27 22:39:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2019-11-27 22:39:29,736 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 145 [2019-11-27 22:39:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:29,736 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2019-11-27 22:39:29,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2019-11-27 22:39:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-27 22:39:29,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:29,741 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:39:29,742 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:29,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1656987991, now seen corresponding path program 1 times [2019-11-27 22:39:29,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:29,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335245480] [2019-11-27 22:39:29,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:29,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335245480] [2019-11-27 22:39:29,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:29,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:29,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358609864] [2019-11-27 22:39:29,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:29,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:29,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:29,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:29,847 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2019-11-27 22:39:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:30,828 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2019-11-27 22:39:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:30,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-11-27 22:39:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:30,836 INFO L225 Difference]: With dead ends: 2888 [2019-11-27 22:39:30,837 INFO L226 Difference]: Without dead ends: 1576 [2019-11-27 22:39:30,840 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:39:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-27 22:39:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-27 22:39:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-27 22:39:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2019-11-27 22:39:30,878 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 149 [2019-11-27 22:39:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:30,879 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2019-11-27 22:39:30,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2019-11-27 22:39:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-27 22:39:30,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:30,884 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:39:30,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 945952174, now seen corresponding path program 1 times [2019-11-27 22:39:30,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:30,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602886490] [2019-11-27 22:39:30,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-27 22:39:30,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602886490] [2019-11-27 22:39:30,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:30,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:30,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916398380] [2019-11-27 22:39:30,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:30,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:30,938 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2019-11-27 22:39:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:31,524 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2019-11-27 22:39:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:31,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-27 22:39:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:31,534 INFO L225 Difference]: With dead ends: 3674 [2019-11-27 22:39:31,534 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:39:31,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:39:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-27 22:39:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:39:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2019-11-27 22:39:31,576 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 152 [2019-11-27 22:39:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:31,577 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2019-11-27 22:39:31,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2019-11-27 22:39:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-27 22:39:31,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:31,582 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-27 22:39:31,582 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1818027434, now seen corresponding path program 1 times [2019-11-27 22:39:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587960453] [2019-11-27 22:39:31,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:31,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587960453] [2019-11-27 22:39:31,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:31,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:31,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647395618] [2019-11-27 22:39:31,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:31,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:31,731 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2019-11-27 22:39:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:32,815 INFO L93 Difference]: Finished difference Result 4591 states and 5242 transitions. [2019-11-27 22:39:32,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:32,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-11-27 22:39:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:32,828 INFO L225 Difference]: With dead ends: 4591 [2019-11-27 22:39:32,828 INFO L226 Difference]: Without dead ends: 3017 [2019-11-27 22:39:32,831 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:39:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2019-11-27 22:39:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2493. [2019-11-27 22:39:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-27 22:39:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2761 transitions. [2019-11-27 22:39:32,884 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2761 transitions. Word has length 167 [2019-11-27 22:39:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:32,885 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2761 transitions. [2019-11-27 22:39:32,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2761 transitions. [2019-11-27 22:39:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-27 22:39:32,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:32,892 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, 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] [2019-11-27 22:39:32,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1902421532, now seen corresponding path program 1 times [2019-11-27 22:39:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:32,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933100234] [2019-11-27 22:39:32,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:39:33,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933100234] [2019-11-27 22:39:33,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399168692] [2019-11-27 22:39:33,216 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:39:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:33,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:39:33,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:39:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-27 22:39:33,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:39:33,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-27 22:39:33,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635808374] [2019-11-27 22:39:33,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:33,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:33,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:39:33,441 INFO L87 Difference]: Start difference. First operand 2493 states and 2761 transitions. Second operand 3 states. [2019-11-27 22:39:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:33,968 INFO L93 Difference]: Finished difference Result 5246 states and 5799 transitions. [2019-11-27 22:39:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:33,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-27 22:39:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:33,980 INFO L225 Difference]: With dead ends: 5246 [2019-11-27 22:39:33,981 INFO L226 Difference]: Without dead ends: 2755 [2019-11-27 22:39:33,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:39:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-27 22:39:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2231. [2019-11-27 22:39:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-11-27 22:39:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2446 transitions. [2019-11-27 22:39:34,034 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2446 transitions. Word has length 221 [2019-11-27 22:39:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:34,034 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 2446 transitions. [2019-11-27 22:39:34,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2446 transitions. [2019-11-27 22:39:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-27 22:39:34,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:34,042 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:34,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:34,250 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash -770011340, now seen corresponding path program 1 times [2019-11-27 22:39:34,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:34,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253702732] [2019-11-27 22:39:34,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-27 22:39:34,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253702732] [2019-11-27 22:39:34,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361460868] [2019-11-27 22:39:34,455 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:39:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:34,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:39:34,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:39:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-27 22:39:34,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:39:34,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-27 22:39:34,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876932052] [2019-11-27 22:39:34,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:34,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:39:34,676 INFO L87 Difference]: Start difference. First operand 2231 states and 2446 transitions. Second operand 3 states. [2019-11-27 22:39:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:35,127 INFO L93 Difference]: Finished difference Result 5113 states and 5613 transitions. [2019-11-27 22:39:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:35,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-27 22:39:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:35,131 INFO L225 Difference]: With dead ends: 5113 [2019-11-27 22:39:35,131 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:39:35,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:39:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:39:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:39:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:39:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:39:35,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2019-11-27 22:39:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:35,141 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:39:35,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:39:35,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:35,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:35,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:35,622 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-27 22:39:35,762 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,766 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:35,767 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:35,768 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:35,769 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,770 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:35,771 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a20~0 1)) (.cse5 (= ~a16~0 5))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 (not (= ~a16~0 6)) .cse2 .cse3) (and .cse2 .cse3 .cse1) (and .cse4 .cse5) (= 15 ~a8~0) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse1 .cse5) (<= ~a16~0 4))) [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:35,772 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:35,773 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:35,774 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,775 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:35,776 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:35,777 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a20~0 1)) (.cse5 (= ~a16~0 5))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 (not (= ~a16~0 6)) .cse2 .cse3) (and .cse2 .cse3 .cse1) (and .cse4 .cse5) (= 15 ~a8~0) (and .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse1 .cse5) (<= ~a16~0 4))) [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:35,778 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,779 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:35,780 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,781 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:35,782 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,783 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:35,784 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:35,785 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:35,785 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:35,785 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:35,785 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2019-11-27 22:39:35,785 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:35,785 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:35,786 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:35,787 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:35,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:35 BoogieIcfgContainer [2019-11-27 22:39:35,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:35,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:35,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:35,830 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:35,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:24" (3/4) ... [2019-11-27 22:39:35,835 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:35,875 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:35,877 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:36,122 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:36,122 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:36,124 INFO L168 Benchmark]: Toolchain (without parser) took 13657.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 956.3 MB in the beginning and 928.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 453.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,124 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:36,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.32 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,125 INFO L168 Benchmark]: Boogie Preprocessor took 93.61 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,125 INFO L168 Benchmark]: RCFGBuilder took 1263.92 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: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,126 INFO L168 Benchmark]: TraceAbstraction took 11031.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 275.8 MB). Free memory was 1.0 GB in the beginning and 952.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,126 INFO L168 Benchmark]: Witness Printer took 292.64 ms. Allocated memory is still 1.5 GB. Free memory was 952.2 MB in the beginning and 928.5 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:36,129 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 861.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.32 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.61 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1263.92 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: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11031.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 275.8 MB). Free memory was 1.0 GB in the beginning and 952.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. * Witness Printer took 292.64 ms. Allocated memory is still 1.5 GB. Free memory was 952.2 MB in the beginning and 928.5 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: 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: ((((((((1 == a7 && a17 <= 0) && a20 == 1) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (14 <= a8 && a16 == 5)) || 15 == a8) || ((14 <= a8 && a17 == 1) && a21 == 1)) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a17 <= 0) && a20 == 1) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (14 <= a8 && a16 == 5)) || 15 == a8) || ((14 <= a8 && a17 == 1) && a21 == 1)) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 10.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 711 SDtfs, 1931 SDslu, 96 SDs, 0 SdLazy, 4815 SolverSat, 749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 490 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1577 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 53 NumberOfFragments, 143 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2528 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 308 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2083 NumberOfCodeBlocks, 2083 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 862658 SizeOfPredicates, 2 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 962/1098 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...