./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a51e7d7d3160b4418bb04f01bccc7314d2964c0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:22:24,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:22:24,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:22:24,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:22:24,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:22:24,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:22:24,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:22:24,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:22:24,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:22:24,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:22:24,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:22:24,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:22:24,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:22:24,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:22:24,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:22:24,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:22:24,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:22:24,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:22:24,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:22:24,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:22:24,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:22:24,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:22:24,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:22:24,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:22:24,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:22:24,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:22:24,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:22:24,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:22:24,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:22:24,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:22:24,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:22:24,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:22:24,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:22:24,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:22:24,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:22:24,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:22:24,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:22:24,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:22:24,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:22:24,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:22:24,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:22:24,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:22:24,281 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:22:24,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:22:24,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:22:24,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:22:24,284 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:22:24,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:22:24,284 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:22:24,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:22:24,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:22:24,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:22:24,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:22:24,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:22:24,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:22:24,286 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:22:24,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:22:24,286 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:22:24,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:22:24,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:22:24,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:22:24,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:22:24,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:22:24,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:22:24,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:22:24,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:22:24,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:22:24,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:22:24,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:22:24,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:22:24,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:22:24,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a51e7d7d3160b4418bb04f01bccc7314d2964c0 [2020-10-25 22:22:24,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:22:24,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:22:24,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:22:24,805 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:22:24,807 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:22:24,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2020-10-25 22:22:24,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a29336c/58e8e8e5663b4e1fbf24e750c68ad52c/FLAG2e7c9a393 [2020-10-25 22:22:25,644 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:22:25,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2020-10-25 22:22:25,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a29336c/58e8e8e5663b4e1fbf24e750c68ad52c/FLAG2e7c9a393 [2020-10-25 22:22:25,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a29336c/58e8e8e5663b4e1fbf24e750c68ad52c [2020-10-25 22:22:25,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:22:25,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:22:25,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:22:25,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:22:25,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:22:25,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:22:25" (1/1) ... [2020-10-25 22:22:26,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730c2620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26, skipping insertion in model container [2020-10-25 22:22:26,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:22:25" (1/1) ... [2020-10-25 22:22:26,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:22:26,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:22:26,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:22:26,304 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:22:26,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:22:26,345 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:22:26,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26 WrapperNode [2020-10-25 22:22:26,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:22:26,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:22:26,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:22:26,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:22:26,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:22:26,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:22:26,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:22:26,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:22:26,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... [2020-10-25 22:22:26,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:22:26,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:22:26,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:22:26,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:22:26,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:22:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:22:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:22:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:22:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:22:26,991 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:22:26,992 INFO L298 CfgBuilder]: Removed 37 assume(true) statements. [2020-10-25 22:22:26,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:22:26 BoogieIcfgContainer [2020-10-25 22:22:26,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:22:26,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:22:26,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:22:27,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:22:27,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:22:25" (1/3) ... [2020-10-25 22:22:27,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6104541a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:22:27, skipping insertion in model container [2020-10-25 22:22:27,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:22:26" (2/3) ... [2020-10-25 22:22:27,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6104541a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:22:27, skipping insertion in model container [2020-10-25 22:22:27,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:22:26" (3/3) ... [2020-10-25 22:22:27,006 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-10-25 22:22:27,020 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:22:27,026 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-10-25 22:22:27,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-25 22:22:27,070 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:22:27,071 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:22:27,071 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:22:27,071 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:22:27,071 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:22:27,072 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:22:27,072 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:22:27,072 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:22:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2020-10-25 22:22:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:22:27,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:27,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:27,100 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1147777426, now seen corresponding path program 1 times [2020-10-25 22:22:27,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:27,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569350482] [2020-10-25 22:22:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:27,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569350482] [2020-10-25 22:22:27,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:27,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 22:22:27,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806545483] [2020-10-25 22:22:27,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 22:22:27,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 22:22:27,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:22:27,328 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2020-10-25 22:22:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:27,355 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2020-10-25 22:22:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 22:22:27,357 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-10-25 22:22:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:27,366 INFO L225 Difference]: With dead ends: 126 [2020-10-25 22:22:27,367 INFO L226 Difference]: Without dead ends: 57 [2020-10-25 22:22:27,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:22:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-25 22:22:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-25 22:22:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-25 22:22:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-25 22:22:27,414 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 12 [2020-10-25 22:22:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:27,414 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-25 22:22:27,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 22:22:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-25 22:22:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:22:27,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:27,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:27,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:22:27,417 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:27,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1315712712, now seen corresponding path program 1 times [2020-10-25 22:22:27,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:27,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473953324] [2020-10-25 22:22:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:27,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473953324] [2020-10-25 22:22:27,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:27,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:22:27,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033771301] [2020-10-25 22:22:27,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:22:27,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:27,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:22:27,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:22:27,536 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 4 states. [2020-10-25 22:22:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:27,673 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2020-10-25 22:22:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:22:27,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-25 22:22:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:27,676 INFO L225 Difference]: With dead ends: 61 [2020-10-25 22:22:27,676 INFO L226 Difference]: Without dead ends: 49 [2020-10-25 22:22:27,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:22:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-25 22:22:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2020-10-25 22:22:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:22:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-25 22:22:27,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 13 [2020-10-25 22:22:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:27,687 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-25 22:22:27,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:22:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-10-25 22:22:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-25 22:22:27,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:27,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:27,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:22:27,689 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2065014123, now seen corresponding path program 1 times [2020-10-25 22:22:27,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:27,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768199537] [2020-10-25 22:22:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:27,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768199537] [2020-10-25 22:22:27,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:27,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:22:27,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778114971] [2020-10-25 22:22:27,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:22:27,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:27,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:22:27,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:22:27,851 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2020-10-25 22:22:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:27,999 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-10-25 22:22:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:22:28,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-25 22:22:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:28,002 INFO L225 Difference]: With dead ends: 65 [2020-10-25 22:22:28,002 INFO L226 Difference]: Without dead ends: 57 [2020-10-25 22:22:28,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:22:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-25 22:22:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2020-10-25 22:22:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-25 22:22:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-10-25 22:22:28,014 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 15 [2020-10-25 22:22:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:28,014 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-10-25 22:22:28,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:22:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-10-25 22:22:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:22:28,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:28,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:28,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:22:28,017 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 193701111, now seen corresponding path program 1 times [2020-10-25 22:22:28,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:28,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534636518] [2020-10-25 22:22:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:28,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534636518] [2020-10-25 22:22:28,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:28,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:22:28,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126454660] [2020-10-25 22:22:28,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:22:28,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:22:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:22:28,100 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2020-10-25 22:22:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:28,164 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-10-25 22:22:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:22:28,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-25 22:22:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:28,165 INFO L225 Difference]: With dead ends: 70 [2020-10-25 22:22:28,165 INFO L226 Difference]: Without dead ends: 66 [2020-10-25 22:22:28,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:22:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-25 22:22:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-10-25 22:22:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-25 22:22:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2020-10-25 22:22:28,175 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 18 [2020-10-25 22:22:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:28,176 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2020-10-25 22:22:28,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:22:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2020-10-25 22:22:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:22:28,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:28,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:28,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:22:28,178 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:28,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:28,178 INFO L82 PathProgramCache]: Analyzing trace with hash -362658927, now seen corresponding path program 1 times [2020-10-25 22:22:28,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:28,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25116861] [2020-10-25 22:22:28,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:28,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25116861] [2020-10-25 22:22:28,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:28,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:28,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127597056] [2020-10-25 22:22:28,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:28,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:28,265 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 6 states. [2020-10-25 22:22:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:28,501 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2020-10-25 22:22:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 22:22:28,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-25 22:22:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:28,503 INFO L225 Difference]: With dead ends: 92 [2020-10-25 22:22:28,503 INFO L226 Difference]: Without dead ends: 72 [2020-10-25 22:22:28,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:22:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-25 22:22:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2020-10-25 22:22:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-25 22:22:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-10-25 22:22:28,514 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 19 [2020-10-25 22:22:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:28,514 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-10-25 22:22:28,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-10-25 22:22:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 22:22:28,515 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:28,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:28,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:22:28,516 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1848655546, now seen corresponding path program 1 times [2020-10-25 22:22:28,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:28,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475659895] [2020-10-25 22:22:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:28,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475659895] [2020-10-25 22:22:28,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:28,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 22:22:28,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026121109] [2020-10-25 22:22:28,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:22:28,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:28,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:22:28,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:28,602 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 7 states. [2020-10-25 22:22:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:28,778 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2020-10-25 22:22:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:22:28,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-25 22:22:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:28,780 INFO L225 Difference]: With dead ends: 80 [2020-10-25 22:22:28,780 INFO L226 Difference]: Without dead ends: 76 [2020-10-25 22:22:28,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:22:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-25 22:22:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2020-10-25 22:22:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-25 22:22:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-10-25 22:22:28,791 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 20 [2020-10-25 22:22:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:28,791 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-10-25 22:22:28,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:22:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-10-25 22:22:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 22:22:28,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:28,793 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:28,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:22:28,793 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2037054178, now seen corresponding path program 1 times [2020-10-25 22:22:28,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:28,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929094856] [2020-10-25 22:22:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:28,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929094856] [2020-10-25 22:22:28,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278688471] [2020-10-25 22:22:28,860 INFO L95 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 [2020-10-25 22:22:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:28,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 22:22:28,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:29,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:29,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:29,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:29,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-25 22:22:29,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647640759] [2020-10-25 22:22:29,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:22:29,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:22:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:29,068 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2020-10-25 22:22:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:29,167 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-10-25 22:22:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:22:29,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-10-25 22:22:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:29,168 INFO L225 Difference]: With dead ends: 66 [2020-10-25 22:22:29,168 INFO L226 Difference]: Without dead ends: 62 [2020-10-25 22:22:29,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:22:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-25 22:22:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-25 22:22:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-25 22:22:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-10-25 22:22:29,178 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 29 [2020-10-25 22:22:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:29,178 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-10-25 22:22:29,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:22:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-10-25 22:22:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 22:22:29,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:29,180 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 22:22:29,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 22:22:29,395 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash 946711302, now seen corresponding path program 1 times [2020-10-25 22:22:29,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:29,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285808745] [2020-10-25 22:22:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:29,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285808745] [2020-10-25 22:22:29,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831416527] [2020-10-25 22:22:29,595 INFO L95 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 [2020-10-25 22:22:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:29,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:22:29,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:29,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:29,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 22:22:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:29,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:29,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-25 22:22:29,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159683027] [2020-10-25 22:22:29,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 22:22:29,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:29,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 22:22:29,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:22:29,810 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 13 states. [2020-10-25 22:22:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:30,198 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2020-10-25 22:22:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 22:22:30,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-10-25 22:22:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:30,202 INFO L225 Difference]: With dead ends: 100 [2020-10-25 22:22:30,202 INFO L226 Difference]: Without dead ends: 80 [2020-10-25 22:22:30,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2020-10-25 22:22:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-25 22:22:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2020-10-25 22:22:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-25 22:22:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2020-10-25 22:22:30,228 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2020-10-25 22:22:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:30,229 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2020-10-25 22:22:30,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 22:22:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-10-25 22:22:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-25 22:22:30,233 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:30,233 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:30,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:30,435 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash -510540315, now seen corresponding path program 1 times [2020-10-25 22:22:30,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:30,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553233487] [2020-10-25 22:22:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:30,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553233487] [2020-10-25 22:22:30,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820406146] [2020-10-25 22:22:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:30,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 22:22:30,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:30,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:30,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:30,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:30,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:30,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-10-25 22:22:30,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028775973] [2020-10-25 22:22:30,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 22:22:30,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 22:22:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:22:30,709 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 12 states. [2020-10-25 22:22:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:30,984 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2020-10-25 22:22:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 22:22:30,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-10-25 22:22:30,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:30,987 INFO L225 Difference]: With dead ends: 87 [2020-10-25 22:22:30,987 INFO L226 Difference]: Without dead ends: 83 [2020-10-25 22:22:30,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2020-10-25 22:22:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-25 22:22:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2020-10-25 22:22:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-25 22:22:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-10-25 22:22:30,997 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 31 [2020-10-25 22:22:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:30,998 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-10-25 22:22:30,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 22:22:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-10-25 22:22:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-25 22:22:31,000 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:31,000 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-10-25 22:22:31,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:31,214 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1128036465, now seen corresponding path program 2 times [2020-10-25 22:22:31,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:31,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92474207] [2020-10-25 22:22:31,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:31,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92474207] [2020-10-25 22:22:31,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609840389] [2020-10-25 22:22:31,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:31,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 22:22:31,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:22:31,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-25 22:22:31,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:31,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:22:31,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:31,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-25 22:22:31,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:31,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-10-25 22:22:31,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417039796] [2020-10-25 22:22:31,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:22:31,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:22:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:22:31,717 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 15 states. [2020-10-25 22:22:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:32,181 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2020-10-25 22:22:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 22:22:32,182 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-10-25 22:22:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:32,182 INFO L225 Difference]: With dead ends: 73 [2020-10-25 22:22:32,183 INFO L226 Difference]: Without dead ends: 49 [2020-10-25 22:22:32,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2020-10-25 22:22:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-25 22:22:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-10-25 22:22:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-25 22:22:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-10-25 22:22:32,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2020-10-25 22:22:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:32,202 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-10-25 22:22:32,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:22:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-10-25 22:22:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-25 22:22:32,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:32,203 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:32,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:32,405 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 815572442, now seen corresponding path program 2 times [2020-10-25 22:22:32,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:32,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565205125] [2020-10-25 22:22:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:32,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565205125] [2020-10-25 22:22:32,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322727582] [2020-10-25 22:22:32,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:32,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 22:22:32,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:22:32,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-25 22:22:32,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:32,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:32,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:32,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:32,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:32,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-10-25 22:22:32,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039965141] [2020-10-25 22:22:32,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-25 22:22:32,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:32,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-25 22:22:32,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-10-25 22:22:32,873 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 17 states. [2020-10-25 22:22:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:33,357 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-10-25 22:22:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-25 22:22:33,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-10-25 22:22:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:33,359 INFO L225 Difference]: With dead ends: 66 [2020-10-25 22:22:33,359 INFO L226 Difference]: Without dead ends: 62 [2020-10-25 22:22:33,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=621, Unknown=0, NotChecked=0, Total=870 [2020-10-25 22:22:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-25 22:22:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2020-10-25 22:22:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-25 22:22:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2020-10-25 22:22:33,368 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 42 [2020-10-25 22:22:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:33,369 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2020-10-25 22:22:33,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-25 22:22:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-10-25 22:22:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-25 22:22:33,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:33,371 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:33,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-25 22:22:33,585 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash 325298885, now seen corresponding path program 3 times [2020-10-25 22:22:33,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:33,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604648192] [2020-10-25 22:22:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:33,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604648192] [2020-10-25 22:22:33,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122892938] [2020-10-25 22:22:33,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:34,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-25 22:22:34,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:22:34,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-25 22:22:34,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:34,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:34,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:34,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:22:34,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:34,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:34,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:34,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:34,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:34,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-10-25 22:22:34,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623837813] [2020-10-25 22:22:34,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-25 22:22:34,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:34,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-25 22:22:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2020-10-25 22:22:34,440 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 25 states. [2020-10-25 22:22:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:36,099 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2020-10-25 22:22:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-25 22:22:36,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2020-10-25 22:22:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:36,101 INFO L225 Difference]: With dead ends: 77 [2020-10-25 22:22:36,101 INFO L226 Difference]: Without dead ends: 73 [2020-10-25 22:22:36,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=386, Invalid=1870, Unknown=0, NotChecked=0, Total=2256 [2020-10-25 22:22:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-25 22:22:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2020-10-25 22:22:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-25 22:22:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2020-10-25 22:22:36,115 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 53 [2020-10-25 22:22:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:36,117 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2020-10-25 22:22:36,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-25 22:22:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2020-10-25 22:22:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-25 22:22:36,124 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:36,124 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:36,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:36,338 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:22:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1424291066, now seen corresponding path program 4 times [2020-10-25 22:22:36,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:36,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054050229] [2020-10-25 22:22:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:36,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054050229] [2020-10-25 22:22:36,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726847934] [2020-10-25 22:22:36,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:36,854 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 22:22:36,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:22:36,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-25 22:22:36,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:37,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:37,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:37,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 22:22:37,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:37,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:37,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:37,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:37,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:37,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2020-10-25 22:22:37,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460558285] [2020-10-25 22:22:37,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-25 22:22:37,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-25 22:22:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2020-10-25 22:22:37,364 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2020-10-25 22:22:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:40,343 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-25 22:22:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-10-25 22:22:40,344 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2020-10-25 22:22:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:40,344 INFO L225 Difference]: With dead ends: 84 [2020-10-25 22:22:40,344 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 22:22:40,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=859, Invalid=4111, Unknown=0, NotChecked=0, Total=4970 [2020-10-25 22:22:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 22:22:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 22:22:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 22:22:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 22:22:40,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-10-25 22:22:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:40,348 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 22:22:40,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-25 22:22:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 22:22:40,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 22:22:40,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:40,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 22:22:40,894 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2020-10-25 22:22:41,011 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2020-10-25 22:22:41,220 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-10-25 22:22:41,330 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2020-10-25 22:22:41,471 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-10-25 22:22:41,475 INFO L270 CegarLoopResult]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 3 ULTIMATE.start_main_~inlen~0)) (.cse1 (<= 1 ULTIMATE.start_main_~in~0)) (.cse2 (<= 0 ULTIMATE.start_main_~buf~0))) (or (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (= ULTIMATE.start_main_~buf~0 0) (<= 2 ULTIMATE.start_main_~bufferlen~0)) (and .cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_main_~buf~0 1) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 (< (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) .cse2))) [2020-10-25 22:22:41,475 INFO L274 CegarLoopResult]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,476 INFO L270 CegarLoopResult]: At program point L18-20(lines 17 22) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0)) [2020-10-25 22:22:41,476 INFO L274 CegarLoopResult]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,476 INFO L277 CegarLoopResult]: At program point L18-23(lines 17 22) the Hoare annotation is: true [2020-10-25 22:22:41,476 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,476 INFO L274 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,476 INFO L274 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,476 INFO L274 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,477 INFO L274 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,477 INFO L274 CegarLoopResult]: For program point L19-4(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,477 INFO L274 CegarLoopResult]: For program point L19-5(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,477 INFO L274 CegarLoopResult]: For program point L19-6(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,477 INFO L274 CegarLoopResult]: For program point L44(lines 44 45) no Hoare annotation was computed. [2020-10-25 22:22:41,477 INFO L274 CegarLoopResult]: For program point L19-7(line 19) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,478 INFO L274 CegarLoopResult]: For program point L12-7(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-8(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-10(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L37-3(lines 37 48) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-11(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-12(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-14(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-15(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-16(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-18(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,479 INFO L274 CegarLoopResult]: For program point L12-19(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-20(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-22(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-23(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-24(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-26(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-27(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-28(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-30(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point L12-31(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,480 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L277 CegarLoopResult]: At program point L55(lines 25 56) the Hoare annotation is: true [2020-10-25 22:22:41,481 INFO L277 CegarLoopResult]: At program point L55-1(lines 24 56) the Hoare annotation is: true [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point L39(lines 39 40) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point L32(lines 25 56) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-10-25 22:22:41,481 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 22:22:41,482 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,482 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-25 22:22:41,482 INFO L274 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,482 INFO L270 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse1 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~buf~0 0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse0 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) .cse1 (= ULTIMATE.start_main_~in~0 0)) (and (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) (<= 1 ULTIMATE.start_main_~in~0) .cse1 (<= 0 ULTIMATE.start_main_~buf~0)))) [2020-10-25 22:22:41,482 INFO L274 CegarLoopResult]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,482 INFO L270 CegarLoopResult]: At program point L18-5(lines 17 22) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse2 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~buf~0 0) .cse0 .cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) .cse2 (= ULTIMATE.start_main_~in~0 0)) (and (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) .cse1 (<= 1 ULTIMATE.start_main_~in~0) .cse2 (<= 0 ULTIMATE.start_main_~buf~0)))) [2020-10-25 22:22:41,482 INFO L274 CegarLoopResult]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,483 INFO L270 CegarLoopResult]: At program point L18-8(lines 17 22) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) (<= 1 ULTIMATE.start_main_~in~0) (<= 0 ULTIMATE.start_main_~buf~0)) [2020-10-25 22:22:41,483 INFO L274 CegarLoopResult]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,483 INFO L270 CegarLoopResult]: At program point L18-11(lines 17 48) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)))) (or (and (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) .cse0 (<= 1 ULTIMATE.start_main_~in~0) (<= 0 ULTIMATE.start_main_~buf~0)) (and (= ULTIMATE.start_main_~buf~0 0) .cse0 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) (<= 2 ULTIMATE.start_main_~bufferlen~0) (= ULTIMATE.start_main_~in~0 0)))) [2020-10-25 22:22:41,483 INFO L274 CegarLoopResult]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,483 INFO L270 CegarLoopResult]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= 1 ULTIMATE.start_main_~in~0)) (.cse2 (<= 0 ULTIMATE.start_main_~buf~0))) (or (and .cse0 (= ULTIMATE.start_main_~buf~0 0) (<= 2 ULTIMATE.start_main_~bufferlen~0) (= ULTIMATE.start_main_~in~0 0)) (and .cse0 (<= (+ ULTIMATE.start_main_~in~0 2) ULTIMATE.start_main_~inlen~0) (<= ULTIMATE.start_main_~buf~0 1) .cse1 (< (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) .cse2) (and .cse0 (<= 3 ULTIMATE.start_main_~inlen~0) (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) .cse1 .cse2))) [2020-10-25 22:22:41,483 INFO L274 CegarLoopResult]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2020-10-25 22:22:41,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:22:41 BoogieIcfgContainer [2020-10-25 22:22:41,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:22:41,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:22:41,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:22:41,509 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:22:41,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:22:26" (3/4) ... [2020-10-25 22:22:41,513 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 22:22:41,527 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-10-25 22:22:41,527 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 22:22:41,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:22:41,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:22:41,615 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:22:41,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:22:41,620 INFO L168 Benchmark]: Toolchain (without parser) took 15632.47 ms. Allocated memory was 41.9 MB in the beginning and 144.7 MB in the end (delta: 102.8 MB). Free memory was 19.9 MB in the beginning and 80.7 MB in the end (delta: -60.8 MB). Peak memory consumption was 43.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:41,621 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 22.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:22:41,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.41 ms. Allocated memory is still 41.9 MB. Free memory was 19.3 MB in the beginning and 18.9 MB in the end (delta: 380.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:41,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.75 ms. Allocated memory is still 41.9 MB. Free memory was 18.9 MB in the beginning and 17.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:22:41,622 INFO L168 Benchmark]: Boogie Preprocessor took 29.33 ms. Allocated memory is still 41.9 MB. Free memory was 17.2 MB in the beginning and 15.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:22:41,622 INFO L168 Benchmark]: RCFGBuilder took 573.66 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 15.9 MB in the beginning and 35.6 MB in the end (delta: -19.7 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:41,623 INFO L168 Benchmark]: TraceAbstraction took 14511.98 ms. Allocated memory was 54.5 MB in the beginning and 144.7 MB in the end (delta: 90.2 MB). Free memory was 35.1 MB in the beginning and 84.9 MB in the end (delta: -49.8 MB). Peak memory consumption was 82.4 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:41,623 INFO L168 Benchmark]: Witness Printer took 106.90 ms. Allocated memory is still 144.7 MB. Free memory was 84.9 MB in the beginning and 80.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:41,627 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 22.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 355.41 ms. Allocated memory is still 41.9 MB. Free memory was 19.3 MB in the beginning and 18.9 MB in the end (delta: 380.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.75 ms. Allocated memory is still 41.9 MB. Free memory was 18.9 MB in the beginning and 17.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.33 ms. Allocated memory is still 41.9 MB. Free memory was 17.2 MB in the beginning and 15.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 573.66 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 15.9 MB in the beginning and 35.6 MB in the end (delta: -19.7 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14511.98 ms. Allocated memory was 54.5 MB in the beginning and 144.7 MB in the end (delta: 90.2 MB). Free memory was 35.1 MB in the beginning and 84.9 MB in the end (delta: -49.8 MB). Peak memory consumption was 82.4 MB. Max. memory is 16.1 GB. * Witness Printer took 106.90 ms. Allocated memory is still 144.7 MB. Free memory was 84.9 MB in the beginning and 80.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((bufferlen + 1 <= inlen && buf + 2 <= bufferlen) && 1 <= cond) && buflim + in + 3 <= inlen + buf) && bufferlen == buflim + 2) && 1 <= in) && 0 <= buf - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((buf == 0 && 1 == cond) && bufferlen == buflim + 2) && bufferlen < inlen) && buf < buflim) && in == 0) || ((((((bufferlen + 1 <= inlen && !(0 == cond)) && bufferlen == buflim + 2) && buflim + in + 3 <= inlen + buf) && 1 <= in) && buf < buflim) && 0 <= buf) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((!(0 == cond) && buf == 0) && 2 <= bufferlen) || (((((3 <= inlen && 1 == cond) && buf + 2 <= bufferlen) && bufferlen == buflim + 2) && 1 <= in) && 0 <= buf)) || (((((3 <= inlen && buf <= 1) && 1 <= cond) && 1 <= in) && buf + 1 < bufferlen) && 0 <= buf) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((bufferlen + 1 <= inlen && buf + 2 <= bufferlen) && 1 <= cond) && buflim + in + 3 <= inlen + buf) && bufferlen == buflim + 2) && 1 <= in) && 0 <= buf) || ((((buf == 0 && bufferlen == buflim + 2) && bufferlen < inlen) && 2 <= bufferlen) && in == 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((buf == 0 && 1 == cond) && bufferlen == buflim + 2) && bufferlen < inlen) && buf < buflim) && in == 0) || ((((((bufferlen + 1 <= inlen && 1 == cond) && buflim + in + 3 <= inlen + buf) && bufferlen == buflim + 2) && 1 <= in) && buf < buflim) && 0 <= buf) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((!(0 == cond) && buf + 1 <= bufferlen) && 2 <= bufferlen) && 0 <= buf - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((!(0 == cond) && buf == 0) && 2 <= bufferlen) && in == 0) || (((((!(0 == cond) && in + 2 <= inlen) && buf <= 1) && 1 <= in) && buf + 1 < bufferlen) && 0 <= buf)) || (((((!(0 == cond) && 3 <= inlen) && buf + 2 <= bufferlen) && bufferlen == buflim + 2) && 1 <= in) && 0 <= buf) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.4s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 465 SDtfs, 1396 SDslu, 1548 SDs, 0 SdLazy, 1681 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 254 SyntacticMatches, 6 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 50 NumberOfFragments, 330 HoareAnnotationTreeSize, 10 FomulaSimplifications, 17927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 924 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 677 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 183328 SizeOfPredicates, 43 NumberOfNonLiveVariables, 860 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 11/492 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...