./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/heapsort.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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:18:36,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:18:36,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:18:36,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:18:36,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:18:36,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:18:36,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:18:36,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:18:36,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:18:36,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:18:36,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:18:36,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:18:36,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:18:36,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:18:36,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:18:36,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:18:36,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:18:36,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:18:36,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:18:36,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:18:36,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:18:36,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:18:36,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:18:36,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:18:36,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:18:36,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:18:36,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:18:36,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:18:36,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:18:36,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:18:36,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:18:36,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:18:36,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:18:36,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:18:36,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:18:36,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:18:36,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:18:36,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:18:36,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:18:36,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:18:36,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:18:36,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 00:18:36,614 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:18:36,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:18:36,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:18:36,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:18:36,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:18:36,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:18:36,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:18:36,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:18:36,617 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:18:36,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:18:36,618 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:18:36,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:18:36,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:18:36,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:18:36,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:18:36,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:18:36,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:18:36,620 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:18:36,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:18:36,620 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:18:36,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:18:36,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:18:36,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:18:36,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:18:36,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:18:36,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:18:36,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:18:36,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:18:36,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:18:36,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:18:36,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:18:36,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:18:36,623 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:18:36,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:18:36,623 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:18:36,623 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2023-02-18 00:18:36,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:18:36,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:18:36,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:18:36,846 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:18:36,846 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:18:36,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2023-02-18 00:18:37,997 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:18:38,176 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:18:38,177 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2023-02-18 00:18:38,183 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c250b2425/1750a5eeb3c4470caca0bc43ae0a9442/FLAG56c6c7549 [2023-02-18 00:18:38,194 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c250b2425/1750a5eeb3c4470caca0bc43ae0a9442 [2023-02-18 00:18:38,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:18:38,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:18:38,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:18:38,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:18:38,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:18:38,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b13c8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38, skipping insertion in model container [2023-02-18 00:18:38,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:18:38,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:18:38,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2023-02-18 00:18:38,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:18:38,370 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:18:38,384 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2023-02-18 00:18:38,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:18:38,405 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:18:38,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38 WrapperNode [2023-02-18 00:18:38,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:18:38,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:18:38,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:18:38,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:18:38,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,449 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-02-18 00:18:38,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:18:38,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:18:38,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:18:38,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:18:38,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:18:38,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:18:38,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:18:38,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:18:38,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (1/1) ... [2023-02-18 00:18:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:18:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:18:38,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 00:18:38,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 00:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:18:38,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 00:18:38,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 00:18:38,609 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:18:38,611 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:18:38,825 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:18:38,830 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:18:38,830 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 00:18:38,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:18:38 BoogieIcfgContainer [2023-02-18 00:18:38,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:18:38,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:18:38,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:18:38,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:18:38,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:18:38" (1/3) ... [2023-02-18 00:18:38,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fd8411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:18:38, skipping insertion in model container [2023-02-18 00:18:38,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:18:38" (2/3) ... [2023-02-18 00:18:38,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fd8411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:18:38, skipping insertion in model container [2023-02-18 00:18:38,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:18:38" (3/3) ... [2023-02-18 00:18:38,839 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2023-02-18 00:18:38,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:18:38,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:18:38,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:18:38,956 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38c933ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:18:38,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:18:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 00:18:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 00:18:38,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:38,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:38,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1754201352, now seen corresponding path program 1 times [2023-02-18 00:18:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:38,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840862582] [2023-02-18 00:18:38,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840862582] [2023-02-18 00:18:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840862582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:39,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:39,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:18:39,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479990076] [2023-02-18 00:18:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:39,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:18:39,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:18:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:18:39,363 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:39,475 INFO L93 Difference]: Finished difference Result 104 states and 193 transitions. [2023-02-18 00:18:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:18:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-18 00:18:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:39,489 INFO L225 Difference]: With dead ends: 104 [2023-02-18 00:18:39,489 INFO L226 Difference]: Without dead ends: 61 [2023-02-18 00:18:39,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:39,496 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:39,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-18 00:18:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2023-02-18 00:18:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 00:18:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2023-02-18 00:18:39,535 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2023-02-18 00:18:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2023-02-18 00:18:39,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2023-02-18 00:18:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 00:18:39,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:39,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:39,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:18:39,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1749464583, now seen corresponding path program 1 times [2023-02-18 00:18:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:39,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997678621] [2023-02-18 00:18:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:39,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997678621] [2023-02-18 00:18:39,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997678621] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:39,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:39,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:18:39,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141254224] [2023-02-18 00:18:39,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:18:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:18:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:18:39,613 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:39,677 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2023-02-18 00:18:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:18:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-18 00:18:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:39,678 INFO L225 Difference]: With dead ends: 46 [2023-02-18 00:18:39,679 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 00:18:39,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:39,681 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:39,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:18:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 00:18:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-02-18 00:18:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 00:18:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-02-18 00:18:39,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2023-02-18 00:18:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:39,692 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-02-18 00:18:39,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-02-18 00:18:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 00:18:39,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:39,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:39,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 00:18:39,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1728015063, now seen corresponding path program 1 times [2023-02-18 00:18:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:39,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543982072] [2023-02-18 00:18:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543982072] [2023-02-18 00:18:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543982072] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:39,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:39,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:18:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147966677] [2023-02-18 00:18:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:39,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:18:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:18:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:39,780 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:39,946 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2023-02-18 00:18:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-18 00:18:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:39,951 INFO L225 Difference]: With dead ends: 76 [2023-02-18 00:18:39,952 INFO L226 Difference]: Without dead ends: 74 [2023-02-18 00:18:39,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:18:39,959 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:39,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-18 00:18:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2023-02-18 00:18:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 00:18:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2023-02-18 00:18:39,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 11 [2023-02-18 00:18:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:39,976 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2023-02-18 00:18:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2023-02-18 00:18:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 00:18:39,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:39,978 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 00:18:39,979 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1885075524, now seen corresponding path program 1 times [2023-02-18 00:18:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:39,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857212846] [2023-02-18 00:18:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:40,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857212846] [2023-02-18 00:18:40,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857212846] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:40,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:40,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:18:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287299771] [2023-02-18 00:18:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:40,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:18:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:40,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:18:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:40,146 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:40,334 INFO L93 Difference]: Finished difference Result 102 states and 153 transitions. [2023-02-18 00:18:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-18 00:18:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:40,341 INFO L225 Difference]: With dead ends: 102 [2023-02-18 00:18:40,341 INFO L226 Difference]: Without dead ends: 100 [2023-02-18 00:18:40,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:18:40,342 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:40,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 217 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-18 00:18:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2023-02-18 00:18:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-18 00:18:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2023-02-18 00:18:40,377 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 16 [2023-02-18 00:18:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:40,377 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2023-02-18 00:18:40,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2023-02-18 00:18:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 00:18:40,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:40,379 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:40,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 00:18:40,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1503713061, now seen corresponding path program 1 times [2023-02-18 00:18:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765001437] [2023-02-18 00:18:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:40,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765001437] [2023-02-18 00:18:40,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765001437] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:40,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:40,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:18:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494244943] [2023-02-18 00:18:40,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:40,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:18:40,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:40,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:18:40,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:18:40,430 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:40,489 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2023-02-18 00:18:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:18:40,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-18 00:18:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:40,492 INFO L225 Difference]: With dead ends: 103 [2023-02-18 00:18:40,492 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 00:18:40,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:40,493 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:40,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:18:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 00:18:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-18 00:18:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-18 00:18:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2023-02-18 00:18:40,511 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 16 [2023-02-18 00:18:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:40,512 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2023-02-18 00:18:40,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2023-02-18 00:18:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 00:18:40,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:40,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:40,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 00:18:40,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:40,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1518715221, now seen corresponding path program 1 times [2023-02-18 00:18:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:40,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116744969] [2023-02-18 00:18:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:40,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116744969] [2023-02-18 00:18:40,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116744969] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:40,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:40,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:18:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124930723] [2023-02-18 00:18:40,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:40,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:18:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:18:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:40,582 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:40,763 INFO L93 Difference]: Finished difference Result 155 states and 240 transitions. [2023-02-18 00:18:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-18 00:18:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:40,766 INFO L225 Difference]: With dead ends: 155 [2023-02-18 00:18:40,766 INFO L226 Difference]: Without dead ends: 153 [2023-02-18 00:18:40,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:18:40,767 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:40,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 245 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:18:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-18 00:18:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2023-02-18 00:18:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 72 states have internal predecessors, (94), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-02-18 00:18:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2023-02-18 00:18:40,791 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 16 [2023-02-18 00:18:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:40,791 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2023-02-18 00:18:40,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2023-02-18 00:18:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 00:18:40,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:40,793 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:40,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 00:18:40,793 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1823085758, now seen corresponding path program 1 times [2023-02-18 00:18:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:40,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959933998] [2023-02-18 00:18:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:40,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959933998] [2023-02-18 00:18:40,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959933998] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:40,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:40,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 00:18:40,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387182220] [2023-02-18 00:18:40,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:40,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 00:18:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:40,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 00:18:40,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:18:40,820 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:40,866 INFO L93 Difference]: Finished difference Result 274 states and 436 transitions. [2023-02-18 00:18:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 00:18:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-18 00:18:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:40,868 INFO L225 Difference]: With dead ends: 274 [2023-02-18 00:18:40,868 INFO L226 Difference]: Without dead ends: 205 [2023-02-18 00:18:40,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:18:40,870 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:40,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:18:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-18 00:18:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-02-18 00:18:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 99 states have (on average 1.404040404040404) internal successors, (139), 103 states have internal predecessors, (139), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2023-02-18 00:18:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2023-02-18 00:18:40,905 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 16 [2023-02-18 00:18:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:40,905 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2023-02-18 00:18:40,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2023-02-18 00:18:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 00:18:40,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:40,907 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:40,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 00:18:40,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2105521235, now seen corresponding path program 1 times [2023-02-18 00:18:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069993963] [2023-02-18 00:18:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:18:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:40,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069993963] [2023-02-18 00:18:40,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069993963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:40,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:40,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:18:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700329853] [2023-02-18 00:18:40,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:18:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:40,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:18:40,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:18:40,959 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:41,025 INFO L93 Difference]: Finished difference Result 230 states and 359 transitions. [2023-02-18 00:18:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:18:41,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-18 00:18:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:41,027 INFO L225 Difference]: With dead ends: 230 [2023-02-18 00:18:41,027 INFO L226 Difference]: Without dead ends: 183 [2023-02-18 00:18:41,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:41,028 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:41,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:18:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-18 00:18:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-02-18 00:18:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-02-18 00:18:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2023-02-18 00:18:41,053 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 16 [2023-02-18 00:18:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:41,054 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2023-02-18 00:18:41,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 00:18:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2023-02-18 00:18:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 00:18:41,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:41,057 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:41,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 00:18:41,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash 186914675, now seen corresponding path program 1 times [2023-02-18 00:18:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:41,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226136365] [2023-02-18 00:18:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 00:18:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226136365] [2023-02-18 00:18:41,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226136365] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:41,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:41,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:18:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599478350] [2023-02-18 00:18:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:41,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:18:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:41,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:18:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:41,151 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 00:18:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:41,254 INFO L93 Difference]: Finished difference Result 217 states and 348 transitions. [2023-02-18 00:18:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-18 00:18:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:41,256 INFO L225 Difference]: With dead ends: 217 [2023-02-18 00:18:41,256 INFO L226 Difference]: Without dead ends: 215 [2023-02-18 00:18:41,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:18:41,259 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:41,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:41,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-18 00:18:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2023-02-18 00:18:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 102 states have internal predecessors, (133), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2023-02-18 00:18:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2023-02-18 00:18:41,285 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 23 [2023-02-18 00:18:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:41,286 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2023-02-18 00:18:41,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 00:18:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2023-02-18 00:18:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 00:18:41,288 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:41,288 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 00:18:41,288 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash 768784003, now seen corresponding path program 1 times [2023-02-18 00:18:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443546781] [2023-02-18 00:18:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 00:18:41,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:41,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443546781] [2023-02-18 00:18:41,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443546781] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:41,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:41,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:18:41,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958342392] [2023-02-18 00:18:41,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:41,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:18:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:41,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:18:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:18:41,371 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 00:18:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:41,564 INFO L93 Difference]: Finished difference Result 520 states and 854 transitions. [2023-02-18 00:18:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 00:18:41,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-18 00:18:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:41,567 INFO L225 Difference]: With dead ends: 520 [2023-02-18 00:18:41,567 INFO L226 Difference]: Without dead ends: 366 [2023-02-18 00:18:41,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:41,569 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:41,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 136 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-02-18 00:18:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 197. [2023-02-18 00:18:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 102 states have internal predecessors, (131), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2023-02-18 00:18:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 315 transitions. [2023-02-18 00:18:41,596 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 315 transitions. Word has length 25 [2023-02-18 00:18:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:41,596 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 315 transitions. [2023-02-18 00:18:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 00:18:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 315 transitions. [2023-02-18 00:18:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 00:18:41,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:41,597 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:41,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 00:18:41,598 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -299150037, now seen corresponding path program 1 times [2023-02-18 00:18:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:41,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765426549] [2023-02-18 00:18:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 00:18:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:18:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:41,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765426549] [2023-02-18 00:18:41,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765426549] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:41,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:41,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 00:18:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251105048] [2023-02-18 00:18:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:18:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:18:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 00:18:41,648 INFO L87 Difference]: Start difference. First operand 197 states and 315 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 00:18:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:41,792 INFO L93 Difference]: Finished difference Result 291 states and 471 transitions. [2023-02-18 00:18:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 00:18:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-18 00:18:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:41,794 INFO L225 Difference]: With dead ends: 291 [2023-02-18 00:18:41,794 INFO L226 Difference]: Without dead ends: 289 [2023-02-18 00:18:41,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:18:41,795 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:41,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-18 00:18:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2023-02-18 00:18:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 132 states have internal predecessors, (161), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2023-02-18 00:18:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 441 transitions. [2023-02-18 00:18:41,827 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 441 transitions. Word has length 26 [2023-02-18 00:18:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:41,827 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 441 transitions. [2023-02-18 00:18:41,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 00:18:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 441 transitions. [2023-02-18 00:18:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 00:18:41,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:41,828 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:41,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 00:18:41,829 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1714235681, now seen corresponding path program 1 times [2023-02-18 00:18:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:41,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368308802] [2023-02-18 00:18:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 00:18:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 00:18:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:41,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368308802] [2023-02-18 00:18:41,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368308802] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:41,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:41,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:18:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183932345] [2023-02-18 00:18:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:18:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:18:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:41,942 INFO L87 Difference]: Start difference. First operand 269 states and 441 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 00:18:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:42,086 INFO L93 Difference]: Finished difference Result 317 states and 516 transitions. [2023-02-18 00:18:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:42,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-02-18 00:18:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:42,092 INFO L225 Difference]: With dead ends: 317 [2023-02-18 00:18:42,092 INFO L226 Difference]: Without dead ends: 315 [2023-02-18 00:18:42,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-18 00:18:42,093 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:42,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 197 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-02-18 00:18:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2023-02-18 00:18:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 125 states have (on average 1.36) internal successors, (170), 141 states have internal predecessors, (170), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2023-02-18 00:18:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 470 transitions. [2023-02-18 00:18:42,129 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 470 transitions. Word has length 28 [2023-02-18 00:18:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:42,130 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 470 transitions. [2023-02-18 00:18:42,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 00:18:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 470 transitions. [2023-02-18 00:18:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 00:18:42,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:42,132 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:42,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 00:18:42,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash 523331784, now seen corresponding path program 1 times [2023-02-18 00:18:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:42,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364802902] [2023-02-18 00:18:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 00:18:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 00:18:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-18 00:18:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-18 00:18:42,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:42,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364802902] [2023-02-18 00:18:42,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364802902] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:42,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:42,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:18:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934096747] [2023-02-18 00:18:42,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:42,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:18:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:42,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:18:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:42,214 INFO L87 Difference]: Start difference. First operand 287 states and 470 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 00:18:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:42,387 INFO L93 Difference]: Finished difference Result 329 states and 527 transitions. [2023-02-18 00:18:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-02-18 00:18:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:42,390 INFO L225 Difference]: With dead ends: 329 [2023-02-18 00:18:42,391 INFO L226 Difference]: Without dead ends: 327 [2023-02-18 00:18:42,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 00:18:42,392 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:42,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 194 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-18 00:18:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2023-02-18 00:18:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 128 states have (on average 1.3515625) internal successors, (173), 144 states have internal predecessors, (173), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2023-02-18 00:18:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2023-02-18 00:18:42,432 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 38 [2023-02-18 00:18:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:42,432 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2023-02-18 00:18:42,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 00:18:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2023-02-18 00:18:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 00:18:42,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:42,433 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 00:18:42,434 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1856149802, now seen corresponding path program 1 times [2023-02-18 00:18:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:42,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927907117] [2023-02-18 00:18:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-18 00:18:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-18 00:18:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 00:18:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:42,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927907117] [2023-02-18 00:18:42,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927907117] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:42,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:42,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:18:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021511497] [2023-02-18 00:18:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:42,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:18:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:18:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:42,501 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 00:18:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:42,617 INFO L93 Difference]: Finished difference Result 297 states and 478 transitions. [2023-02-18 00:18:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:18:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-02-18 00:18:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:42,619 INFO L225 Difference]: With dead ends: 297 [2023-02-18 00:18:42,619 INFO L226 Difference]: Without dead ends: 295 [2023-02-18 00:18:42,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 00:18:42,620 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:42,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-18 00:18:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-02-18 00:18:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 147 states have internal predecessors, (176), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2023-02-18 00:18:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 476 transitions. [2023-02-18 00:18:42,654 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 476 transitions. Word has length 38 [2023-02-18 00:18:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:42,655 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 476 transitions. [2023-02-18 00:18:42,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 00:18:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 476 transitions. [2023-02-18 00:18:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 00:18:42,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:42,656 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:42,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 00:18:42,656 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2019762676, now seen corresponding path program 1 times [2023-02-18 00:18:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:42,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052219169] [2023-02-18 00:18:42,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-18 00:18:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-18 00:18:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 00:18:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 00:18:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 00:18:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052219169] [2023-02-18 00:18:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052219169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:18:42,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 00:18:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964995538] [2023-02-18 00:18:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:18:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:18:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:18:42,724 INFO L87 Difference]: Start difference. First operand 295 states and 476 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 00:18:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:42,848 INFO L93 Difference]: Finished difference Result 329 states and 525 transitions. [2023-02-18 00:18:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 00:18:42,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2023-02-18 00:18:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:42,850 INFO L225 Difference]: With dead ends: 329 [2023-02-18 00:18:42,850 INFO L226 Difference]: Without dead ends: 327 [2023-02-18 00:18:42,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 00:18:42,851 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:42,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 226 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-18 00:18:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 174. [2023-02-18 00:18:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2023-02-18 00:18:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2023-02-18 00:18:42,878 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 50 [2023-02-18 00:18:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:42,878 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2023-02-18 00:18:42,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 00:18:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2023-02-18 00:18:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 00:18:42,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:42,879 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 00:18:42,880 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2077570128, now seen corresponding path program 1 times [2023-02-18 00:18:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:42,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723771412] [2023-02-18 00:18:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:42,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 00:18:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 00:18:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-18 00:18:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 00:18:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-18 00:18:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-02-18 00:18:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-18 00:18:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723771412] [2023-02-18 00:18:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723771412] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:18:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911007988] [2023-02-18 00:18:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:18:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:18:42,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:18:42,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 00:18:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:42,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 00:18:42,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:18:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-18 00:18:43,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 00:18:43,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911007988] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:18:43,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 00:18:43,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2023-02-18 00:18:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44728122] [2023-02-18 00:18:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:18:43,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 00:18:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:43,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 00:18:43,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:18:43,078 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 00:18:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:43,281 INFO L93 Difference]: Finished difference Result 505 states and 801 transitions. [2023-02-18 00:18:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 00:18:43,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2023-02-18 00:18:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:43,283 INFO L225 Difference]: With dead ends: 505 [2023-02-18 00:18:43,283 INFO L226 Difference]: Without dead ends: 335 [2023-02-18 00:18:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-18 00:18:43,285 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:43,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 168 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:18:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-18 00:18:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2023-02-18 00:18:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 152 states have internal predecessors, (183), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2023-02-18 00:18:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2023-02-18 00:18:43,338 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 58 [2023-02-18 00:18:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:43,338 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2023-02-18 00:18:43,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 00:18:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2023-02-18 00:18:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-18 00:18:43,340 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:43,340 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:43,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 00:18:43,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 00:18:43,552 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:43,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1244619342, now seen corresponding path program 1 times [2023-02-18 00:18:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:43,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009283626] [2023-02-18 00:18:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 00:18:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 00:18:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-18 00:18:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 00:18:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-18 00:18:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-18 00:18:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 00:18:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-18 00:18:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 00:18:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-18 00:18:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 00:18:43,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:43,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009283626] [2023-02-18 00:18:43,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009283626] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:18:43,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110954614] [2023-02-18 00:18:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:18:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:18:43,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:18:43,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 00:18:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:43,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 00:18:43,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:18:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 00:18:43,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:18:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 00:18:43,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110954614] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:18:43,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:18:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2023-02-18 00:18:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512113876] [2023-02-18 00:18:43,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:18:43,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 00:18:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 00:18:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-18 00:18:43,858 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2023-02-18 00:18:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:45,069 INFO L93 Difference]: Finished difference Result 671 states and 1116 transitions. [2023-02-18 00:18:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-18 00:18:45,070 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 80 [2023-02-18 00:18:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:45,073 INFO L225 Difference]: With dead ends: 671 [2023-02-18 00:18:45,074 INFO L226 Difference]: Without dead ends: 669 [2023-02-18 00:18:45,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 00:18:45,075 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 275 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:45,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 624 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 00:18:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-02-18 00:18:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 367. [2023-02-18 00:18:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 181 states have internal predecessors, (220), 188 states have call successors, (188), 15 states have call predecessors, (188), 15 states have return successors, (188), 170 states have call predecessors, (188), 188 states have call successors, (188) [2023-02-18 00:18:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 596 transitions. [2023-02-18 00:18:45,138 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 596 transitions. Word has length 80 [2023-02-18 00:18:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 596 transitions. [2023-02-18 00:18:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2023-02-18 00:18:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 596 transitions. [2023-02-18 00:18:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 00:18:45,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:45,141 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:45,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 00:18:45,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 00:18:45,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1679445438, now seen corresponding path program 2 times [2023-02-18 00:18:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:45,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754068530] [2023-02-18 00:18:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 00:18:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 00:18:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-18 00:18:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 00:18:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-18 00:18:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-18 00:18:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 00:18:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-18 00:18:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 00:18:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-18 00:18:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-02-18 00:18:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 00:18:45,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:45,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754068530] [2023-02-18 00:18:45,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754068530] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:18:45,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892033696] [2023-02-18 00:18:45,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:18:45,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:18:45,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:18:45,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:18:45,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 00:18:45,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:18:45,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:18:45,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 00:18:45,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:18:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 00:18:45,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:18:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 00:18:45,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892033696] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:18:45,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:18:45,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-02-18 00:18:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420359369] [2023-02-18 00:18:45,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:18:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 00:18:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 00:18:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-18 00:18:45,723 INFO L87 Difference]: Start difference. First operand 367 states and 596 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2023-02-18 00:18:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:46,070 INFO L93 Difference]: Finished difference Result 399 states and 639 transitions. [2023-02-18 00:18:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 00:18:46,070 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 85 [2023-02-18 00:18:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:46,072 INFO L225 Difference]: With dead ends: 399 [2023-02-18 00:18:46,072 INFO L226 Difference]: Without dead ends: 317 [2023-02-18 00:18:46,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2023-02-18 00:18:46,073 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 98 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:46,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 148 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:18:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-02-18 00:18:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2023-02-18 00:18:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 154 states have internal predecessors, (184), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2023-02-18 00:18:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 472 transitions. [2023-02-18 00:18:46,121 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 472 transitions. Word has length 85 [2023-02-18 00:18:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:46,121 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 472 transitions. [2023-02-18 00:18:46,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2023-02-18 00:18:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 472 transitions. [2023-02-18 00:18:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-02-18 00:18:46,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:18:46,124 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:46,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 00:18:46,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 00:18:46,329 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:18:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:18:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash 520521549, now seen corresponding path program 1 times [2023-02-18 00:18:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:18:46,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172997161] [2023-02-18 00:18:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:18:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:18:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 00:18:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-18 00:18:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-18 00:18:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 00:18:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 00:18:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-18 00:18:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-18 00:18:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-18 00:18:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-02-18 00:18:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-18 00:18:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 00:18:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-18 00:18:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-02-18 00:18:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-18 00:18:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 00:18:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-02-18 00:18:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-02-18 00:18:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-18 00:18:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-02-18 00:18:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-02-18 00:18:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:18:46,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172997161] [2023-02-18 00:18:46,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172997161] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:18:46,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960956893] [2023-02-18 00:18:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:18:46,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:18:46,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:18:46,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:18:46,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 00:18:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:18:46,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 00:18:46,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:18:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-02-18 00:18:46,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:18:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-02-18 00:18:46,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960956893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:18:46,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:18:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-02-18 00:18:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425060424] [2023-02-18 00:18:46,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:18:46,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 00:18:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:18:46,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 00:18:46,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-02-18 00:18:46,759 INFO L87 Difference]: Start difference. First operand 301 states and 472 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2023-02-18 00:18:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:18:49,310 INFO L93 Difference]: Finished difference Result 894 states and 1429 transitions. [2023-02-18 00:18:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-02-18 00:18:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) Word has length 129 [2023-02-18 00:18:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:18:49,311 INFO L225 Difference]: With dead ends: 894 [2023-02-18 00:18:49,311 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 00:18:49,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1180, Invalid=4370, Unknown=0, NotChecked=0, Total=5550 [2023-02-18 00:18:49,321 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 349 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-18 00:18:49,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 845 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-18 00:18:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 00:18:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 00:18:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:18:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 00:18:49,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2023-02-18 00:18:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:18:49,324 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 00:18:49,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2023-02-18 00:18:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 00:18:49,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 00:18:49,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 00:18:49,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 00:18:49,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:18:49,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 00:18:49,590 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse30 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse28 (+ (- 2) |ULTIMATE.start_main_~j~0#1|)) (.cse69 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)) (.cse24 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse23 (<= .cse24 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse34 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse25 (<= .cse69 0)) (.cse16 (<= 0 .cse69)) (.cse22 (<= 0 .cse28)) (.cse26 (let ((.cse68 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse68 (and .cse2 (not .cse68))))) (.cse27 (let ((.cse67 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse67) .cse30) .cse67))) (.cse66 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~r~0#1| .cse24)) (.cse64 (* 2 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse17 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse0 (<= .cse63 (+ 2 .cse64))) (.cse1 (<= .cse66 |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= .cse66 |ULTIMATE.start_main_~n~0#1|)) (.cse19 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (> |ULTIMATE.start_main_~r~0#1| 1)) (.cse37 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse38 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse39 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse66))) (.cse35 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse36 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse21 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse6 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse8 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse9 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse32 (let ((.cse65 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse47 (<= |ULTIMATE.start_main_~i~0#1| .cse65)) (.cse45 (<= |ULTIMATE.start_main_~j~0#1| .cse65)) (.cse50 (<= .cse24 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse52 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse53 (<= .cse24 |ULTIMATE.start_main_~r~0#1|)) (.cse46 (<= |ULTIMATE.start_main_~l~0#1| .cse65)) (.cse54 (<= .cse24 |ULTIMATE.start_main_~n~0#1|)) (.cse44 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse55 (<= .cse63 .cse64))) (let ((.cse41 (let ((.cse56 (let ((.cse57 (let ((.cse58 (let ((.cse62 (or (and .cse16 .cse46 .cse22 .cse54 .cse26 .cse27 .cse55) (and .cse16 .cse46 .cse22 .cse54 .cse26 .cse44 .cse27 .cse55)))) (let ((.cse59 (and .cse16 .cse25 .cse62)) (.cse61 (and .cse16 .cse25 .cse34 .cse62))) (let ((.cse60 (or .cse59 .cse61))) (or .cse59 (and .cse60 .cse50) (and .cse60 .cse50 .cse52) (and .cse60 .cse53 .cse52) (and .cse60 .cse52) (and .cse60 .cse53) .cse61)))))) (or (and .cse2 .cse58) (and .cse2 .cse58 .cse45))))) (or (and .cse46 .cse47 .cse57 .cse23) (and .cse46 .cse57 .cse23))))) (or (and .cse2 .cse56 .cse44) (and .cse2 .cse56) (and .cse2 .cse56 .cse45)))) (.cse42 (let ((.cse43 (let ((.cse48 (let ((.cse49 (let ((.cse51 (or (and .cse46 .cse54 .cse26 .cse27 .cse55) (and .cse46 .cse54 .cse26 .cse44 .cse27 .cse55)))) (or (and .cse50 .cse51 .cse52 .cse25) (and .cse50 .cse51 .cse25) (and .cse51 .cse53 .cse52 .cse25) (and .cse51 .cse52 .cse25) (and .cse51 .cse25) (and .cse51 .cse53 .cse25))))) (or (and .cse2 .cse49) (and .cse2 .cse49 .cse45))))) (or (and .cse46 .cse47 .cse48 .cse23) (and .cse46 .cse48 .cse23))))) (or (and .cse43 .cse2 .cse44) (and .cse43 .cse2) (and .cse43 .cse2 .cse45))))) (or (and .cse16 .cse22 .cse41 .cse34) (and .cse16 .cse22 .cse42 .cse34) (and .cse16 .cse22 .cse41) (and .cse16 .cse22 .cse42))))))) (let ((.cse4 (let ((.cse40 (or (and .cse6 .cse8 .cse32) (and (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse6 .cse21 .cse32) (and .cse6 .cse8 .cse9 .cse32)))) (or (and .cse35 .cse30 .cse6 .cse34 .cse40) (and .cse30 .cse33 .cse6 .cse8 .cse34 .cse40) (and .cse35 .cse30 .cse33 .cse6 .cse36 .cse40) (and .cse35 .cse30 .cse33 .cse6 .cse34 .cse40) (and .cse35 .cse30 .cse6 .cse36 .cse40)))) (.cse10 (<= |ULTIMATE.start_main_~j~0#1| .cse24)) (.cse20 (<= (+ (* .cse39 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~r~0#1| .cse24)) (.cse15 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse24))) (.cse12 (<= (+ 2 (* .cse39 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse14 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse37 (- 3))) .cse38)) (.cse13 (or (< (+ (- 1) |ULTIMATE.start_main_~r~0#1|) (+ .cse37 (- 4))) .cse38)) (.cse7 (let ((.cse29 (let ((.cse31 (< (- 1) .cse24))) (or (and .cse30 (< 0 |ULTIMATE.start_main_~j~0#1|) .cse31 .cse32) (and .cse30 .cse33 .cse31 .cse8 .cse34 .cse32) (and (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1)) .cse30 .cse33 .cse31 .cse32) (and .cse35 .cse30 .cse33 .cse31 .cse36 .cse32) (and .cse35 .cse30 .cse31 .cse34 .cse32) (and .cse35 .cse30 .cse31 .cse36 .cse32) (and .cse35 .cse30 .cse33 .cse31 .cse34 .cse32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse29) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse29) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse29))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse13 .cse6 .cse7 .cse8 .cse10 .cse12) (and .cse14 .cse15 .cse16 .cse13 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse4) (and .cse14 .cse15 .cse16 .cse20 .cse13 .cse7 .cse21) (and .cse14 .cse15 .cse16 .cse22 .cse13 .cse7) (and .cse14 .cse15 .cse5 .cse20 .cse13 .cse6 .cse7 .cse21) (and .cse14 .cse5 .cse13 .cse6 .cse7 .cse8 .cse12) (and .cse16 .cse22 .cse13 .cse7 .cse10) (and .cse0 .cse16 .cse22 .cse23 (<= |ULTIMATE.start_main_~r~0#1| (+ (- 2) .cse24)) .cse25 .cse26 .cse27 (<= |ULTIMATE.start_main_~r~0#1| .cse28)) (and .cse14 .cse15 .cse5 .cse20 .cse6 .cse7 .cse11 .cse21) (and .cse14 .cse15 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse14 .cse16 .cse22 .cse13 .cse7)))))) [2023-02-18 00:18:49,591 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse30 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse28 (+ (- 2) |ULTIMATE.start_main_~j~0#1|)) (.cse69 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)) (.cse24 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse23 (<= .cse24 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse34 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse25 (<= .cse69 0)) (.cse16 (<= 0 .cse69)) (.cse22 (<= 0 .cse28)) (.cse26 (let ((.cse68 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse68 (and .cse2 (not .cse68))))) (.cse27 (let ((.cse67 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse67) .cse30) .cse67))) (.cse66 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~r~0#1| .cse24)) (.cse64 (* 2 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse17 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse0 (<= .cse63 (+ 2 .cse64))) (.cse1 (<= .cse66 |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= .cse66 |ULTIMATE.start_main_~n~0#1|)) (.cse19 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (> |ULTIMATE.start_main_~r~0#1| 1)) (.cse37 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse38 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse39 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse66))) (.cse35 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse36 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse21 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse6 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse8 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse9 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse32 (let ((.cse65 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse47 (<= |ULTIMATE.start_main_~i~0#1| .cse65)) (.cse45 (<= |ULTIMATE.start_main_~j~0#1| .cse65)) (.cse50 (<= .cse24 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse52 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse53 (<= .cse24 |ULTIMATE.start_main_~r~0#1|)) (.cse46 (<= |ULTIMATE.start_main_~l~0#1| .cse65)) (.cse54 (<= .cse24 |ULTIMATE.start_main_~n~0#1|)) (.cse44 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse55 (<= .cse63 .cse64))) (let ((.cse41 (let ((.cse56 (let ((.cse57 (let ((.cse58 (let ((.cse62 (or (and .cse16 .cse46 .cse22 .cse54 .cse26 .cse27 .cse55) (and .cse16 .cse46 .cse22 .cse54 .cse26 .cse44 .cse27 .cse55)))) (let ((.cse59 (and .cse16 .cse25 .cse62)) (.cse61 (and .cse16 .cse25 .cse34 .cse62))) (let ((.cse60 (or .cse59 .cse61))) (or .cse59 (and .cse60 .cse50) (and .cse60 .cse50 .cse52) (and .cse60 .cse53 .cse52) (and .cse60 .cse52) (and .cse60 .cse53) .cse61)))))) (or (and .cse2 .cse58) (and .cse2 .cse58 .cse45))))) (or (and .cse46 .cse47 .cse57 .cse23) (and .cse46 .cse57 .cse23))))) (or (and .cse2 .cse56 .cse44) (and .cse2 .cse56) (and .cse2 .cse56 .cse45)))) (.cse42 (let ((.cse43 (let ((.cse48 (let ((.cse49 (let ((.cse51 (or (and .cse46 .cse54 .cse26 .cse27 .cse55) (and .cse46 .cse54 .cse26 .cse44 .cse27 .cse55)))) (or (and .cse50 .cse51 .cse52 .cse25) (and .cse50 .cse51 .cse25) (and .cse51 .cse53 .cse52 .cse25) (and .cse51 .cse52 .cse25) (and .cse51 .cse25) (and .cse51 .cse53 .cse25))))) (or (and .cse2 .cse49) (and .cse2 .cse49 .cse45))))) (or (and .cse46 .cse47 .cse48 .cse23) (and .cse46 .cse48 .cse23))))) (or (and .cse43 .cse2 .cse44) (and .cse43 .cse2) (and .cse43 .cse2 .cse45))))) (or (and .cse16 .cse22 .cse41 .cse34) (and .cse16 .cse22 .cse42 .cse34) (and .cse16 .cse22 .cse41) (and .cse16 .cse22 .cse42))))))) (let ((.cse4 (let ((.cse40 (or (and .cse6 .cse8 .cse32) (and (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse6 .cse21 .cse32) (and .cse6 .cse8 .cse9 .cse32)))) (or (and .cse35 .cse30 .cse6 .cse34 .cse40) (and .cse30 .cse33 .cse6 .cse8 .cse34 .cse40) (and .cse35 .cse30 .cse33 .cse6 .cse36 .cse40) (and .cse35 .cse30 .cse33 .cse6 .cse34 .cse40) (and .cse35 .cse30 .cse6 .cse36 .cse40)))) (.cse10 (<= |ULTIMATE.start_main_~j~0#1| .cse24)) (.cse20 (<= (+ (* .cse39 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~r~0#1| .cse24)) (.cse15 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse24))) (.cse12 (<= (+ 2 (* .cse39 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse14 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse37 (- 3))) .cse38)) (.cse13 (or (< (+ (- 1) |ULTIMATE.start_main_~r~0#1|) (+ .cse37 (- 4))) .cse38)) (.cse7 (let ((.cse29 (let ((.cse31 (< (- 1) .cse24))) (or (and .cse30 (< 0 |ULTIMATE.start_main_~j~0#1|) .cse31 .cse32) (and .cse30 .cse33 .cse31 .cse8 .cse34 .cse32) (and (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1)) .cse30 .cse33 .cse31 .cse32) (and .cse35 .cse30 .cse33 .cse31 .cse36 .cse32) (and .cse35 .cse30 .cse31 .cse34 .cse32) (and .cse35 .cse30 .cse31 .cse36 .cse32) (and .cse35 .cse30 .cse33 .cse31 .cse34 .cse32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse29) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse29) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse29))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse13 .cse6 .cse7 .cse8 .cse10 .cse12) (and .cse14 .cse15 .cse16 .cse13 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse18 .cse19 .cse3 .cse4) (and .cse14 .cse15 .cse16 .cse20 .cse13 .cse7 .cse21) (and .cse14 .cse15 .cse16 .cse22 .cse13 .cse7) (and .cse14 .cse15 .cse5 .cse20 .cse13 .cse6 .cse7 .cse21) (and .cse14 .cse5 .cse13 .cse6 .cse7 .cse8 .cse12) (and .cse16 .cse22 .cse13 .cse7 .cse10) (and .cse0 .cse16 .cse22 .cse23 (<= |ULTIMATE.start_main_~r~0#1| (+ (- 2) .cse24)) .cse25 .cse26 .cse27 (<= |ULTIMATE.start_main_~r~0#1| .cse28)) (and .cse14 .cse15 .cse5 .cse20 .cse6 .cse7 .cse11 .cse21) (and .cse14 .cse15 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse14 .cse16 .cse22 .cse13 .cse7)))))) [2023-02-18 00:18:49,592 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse16 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse2 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse9 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse1 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse6 (<= 0 (+ (- 2) |ULTIMATE.start_main_~l~0#1|))) (.cse18 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse40 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse17 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse56 (+ (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse12 (< .cse56 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse8 (< .cse56 (+ .cse17 (- 4)))) (.cse13 (<= |ULTIMATE.start_main_~r~0#1| .cse40)) (.cse14 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse5 (< .cse56 .cse17)) (.cse11 (<= |ULTIMATE.start_main_~j~0#1| .cse40)) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse40))) (.cse15 (<= (+ (* .cse18 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse0 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse3 (let ((.cse21 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse22 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~r~0#1| .cse40)) (.cse54 (* 2 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse19 (<= .cse53 (+ 2 .cse54))) (.cse20 (<= .cse22 |ULTIMATE.start_main_~j~0#1|)) (.cse23 (let ((.cse29 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse26 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|)))) (let ((.cse30 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse25 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse22))) (.cse28 (let ((.cse31 (let ((.cse32 (let ((.cse37 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse35 (<= |ULTIMATE.start_main_~j~0#1| .cse37)) (.cse34 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (let ((.cse33 (let ((.cse36 (<= |ULTIMATE.start_main_~l~0#1| .cse37))) (let ((.cse38 (let ((.cse41 (let ((.cse42 (let ((.cse44 (<= 0 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)))) (let ((.cse45 (let ((.cse46 (<= .cse40 |ULTIMATE.start_main_~n~0#1|)) (.cse47 (let ((.cse55 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse55 (and .cse21 (not .cse55))))) (.cse48 (<= .cse53 .cse54)) (.cse49 (let ((.cse50 (or (<= (+ (* (- 1) |ULTIMATE.start_main_~l~0#1|) 1) 0) .cse6)) (.cse51 (let ((.cse52 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse52) .cse26) .cse52)))) (or (and .cse44 .cse10 .cse50 .cse51) (and .cse44 .cse50 .cse51))))) (or (and .cse36 .cse46 .cse47 .cse48 .cse49) (and .cse36 .cse46 .cse47 .cse34 .cse48 .cse49))))) (or (and .cse44 .cse45) (and .cse44 .cse29 .cse45))))) (.cse43 (<= .cse40 |ULTIMATE.start_main_~r~0#1|))) (or (and .cse42 .cse43) (and .cse42 .cse43 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)))))) (or (and .cse21 .cse41) (and .cse21 .cse41 .cse35)))) (.cse39 (<= .cse40 (+ 2 |ULTIMATE.start_main_~n~0#1|)))) (or (and .cse36 (<= |ULTIMATE.start_main_~i~0#1| .cse37) .cse38 .cse39) (and .cse36 .cse38 .cse39)))))) (or (and .cse33 .cse21) (and .cse33 .cse21 .cse34) (and .cse33 .cse21 .cse35))))))) (or (and .cse10 .cse32 .cse6) (and .cse10 .cse32 .cse29 .cse6))))) (or (and (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse9 .cse16 .cse31) (and .cse9 .cse31) (and .cse9 .cse1 .cse2 .cse31) (and .cse9 .cse1 .cse31))))) (or (and .cse25 .cse26 .cse27 .cse9 .cse28 .cse29) (and (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1)) .cse26 .cse27 .cse9 .cse28) (and .cse25 .cse26 .cse27 .cse9 .cse30 .cse28) (and .cse25 .cse26 .cse9 .cse30 .cse28) (and .cse25 .cse26 .cse9 .cse28 .cse29) (and .cse26 .cse9 (< 0 |ULTIMATE.start_main_~j~0#1|) .cse28) (and .cse26 .cse27 .cse9 .cse1 .cse28 .cse29))))) (.cse24 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse19 .cse20 .cse21 (<= .cse22 |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~n~0#1|) .cse23 .cse24) (and .cse19 .cse20 .cse21 .cse23 .cse24))))) (.cse4 (<= (+ 2 (* .cse18 2)) |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse10 .cse3 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse13 .cse4 .cse14) (and .cse10 .cse3 .cse12 .cse5 .cse6) (and .cse0 .cse15 .cse3 .cse6 .cse16) (and .cse7 .cse8 .cse9 .cse1 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse15 .cse3 .cse13 .cse16 .cse14) (and .cse0 .cse7 .cse8 .cse15 .cse9 .cse3 .cse6 .cse16) (and (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse17 (- 3))) (not .cse14)) .cse0 .cse15 .cse3 .cse13 .cse16 .cse14) (and .cse7 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse15 .cse3 .cse11 .cse13 .cse16 .cse14) (and .cse7 .cse9 .cse1 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse10 .cse3 .cse6) (and .cse0 .cse15 .cse3 .cse5 .cse6 .cse16) (and .cse10 .cse3 .cse6) (and .cse10 .cse3 .cse11 .cse6) (and .cse0 .cse7 .cse15 .cse9 .cse3 .cse6 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6)))) [2023-02-18 00:18:49,592 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-02-18 00:18:49,593 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse16 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse2 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse9 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse1 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse10 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse6 (<= 0 (+ (- 2) |ULTIMATE.start_main_~l~0#1|))) (.cse18 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse40 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse17 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse56 (+ (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse12 (< .cse56 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse8 (< .cse56 (+ .cse17 (- 4)))) (.cse13 (<= |ULTIMATE.start_main_~r~0#1| .cse40)) (.cse14 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse5 (< .cse56 .cse17)) (.cse11 (<= |ULTIMATE.start_main_~j~0#1| .cse40)) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse40))) (.cse15 (<= (+ (* .cse18 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse0 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse3 (let ((.cse21 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse22 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~r~0#1| .cse40)) (.cse54 (* 2 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse19 (<= .cse53 (+ 2 .cse54))) (.cse20 (<= .cse22 |ULTIMATE.start_main_~j~0#1|)) (.cse23 (let ((.cse29 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse26 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|)))) (let ((.cse30 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse25 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse22))) (.cse28 (let ((.cse31 (let ((.cse32 (let ((.cse37 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse35 (<= |ULTIMATE.start_main_~j~0#1| .cse37)) (.cse34 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (let ((.cse33 (let ((.cse36 (<= |ULTIMATE.start_main_~l~0#1| .cse37))) (let ((.cse38 (let ((.cse41 (let ((.cse42 (let ((.cse44 (<= 0 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)))) (let ((.cse45 (let ((.cse46 (<= .cse40 |ULTIMATE.start_main_~n~0#1|)) (.cse47 (let ((.cse55 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse55 (and .cse21 (not .cse55))))) (.cse48 (<= .cse53 .cse54)) (.cse49 (let ((.cse50 (or (<= (+ (* (- 1) |ULTIMATE.start_main_~l~0#1|) 1) 0) .cse6)) (.cse51 (let ((.cse52 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse52) .cse26) .cse52)))) (or (and .cse44 .cse10 .cse50 .cse51) (and .cse44 .cse50 .cse51))))) (or (and .cse36 .cse46 .cse47 .cse48 .cse49) (and .cse36 .cse46 .cse47 .cse34 .cse48 .cse49))))) (or (and .cse44 .cse45) (and .cse44 .cse29 .cse45))))) (.cse43 (<= .cse40 |ULTIMATE.start_main_~r~0#1|))) (or (and .cse42 .cse43) (and .cse42 .cse43 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)))))) (or (and .cse21 .cse41) (and .cse21 .cse41 .cse35)))) (.cse39 (<= .cse40 (+ 2 |ULTIMATE.start_main_~n~0#1|)))) (or (and .cse36 (<= |ULTIMATE.start_main_~i~0#1| .cse37) .cse38 .cse39) (and .cse36 .cse38 .cse39)))))) (or (and .cse33 .cse21) (and .cse33 .cse21 .cse34) (and .cse33 .cse21 .cse35))))))) (or (and .cse10 .cse32 .cse6) (and .cse10 .cse32 .cse29 .cse6))))) (or (and (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse9 .cse16 .cse31) (and .cse9 .cse31) (and .cse9 .cse1 .cse2 .cse31) (and .cse9 .cse1 .cse31))))) (or (and .cse25 .cse26 .cse27 .cse9 .cse28 .cse29) (and (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1)) .cse26 .cse27 .cse9 .cse28) (and .cse25 .cse26 .cse27 .cse9 .cse30 .cse28) (and .cse25 .cse26 .cse9 .cse30 .cse28) (and .cse25 .cse26 .cse9 .cse28 .cse29) (and .cse26 .cse9 (< 0 |ULTIMATE.start_main_~j~0#1|) .cse28) (and .cse26 .cse27 .cse9 .cse1 .cse28 .cse29))))) (.cse24 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse19 .cse20 .cse21 (<= .cse22 |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~n~0#1|) .cse23 .cse24) (and .cse19 .cse20 .cse21 .cse23 .cse24))))) (.cse4 (<= (+ 2 (* .cse18 2)) |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse10 .cse3 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse13 .cse4 .cse14) (and .cse10 .cse3 .cse12 .cse5 .cse6) (and .cse0 .cse15 .cse3 .cse6 .cse16) (and .cse7 .cse8 .cse9 .cse1 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse15 .cse3 .cse13 .cse16 .cse14) (and .cse0 .cse7 .cse8 .cse15 .cse9 .cse3 .cse6 .cse16) (and (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse17 (- 3))) (not .cse14)) .cse0 .cse15 .cse3 .cse13 .cse16 .cse14) (and .cse7 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse15 .cse3 .cse11 .cse13 .cse16 .cse14) (and .cse7 .cse9 .cse1 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse10 .cse3 .cse6) (and .cse0 .cse15 .cse3 .cse5 .cse6 .cse16) (and .cse10 .cse3 .cse6) (and .cse10 .cse3 .cse11 .cse6) (and .cse0 .cse7 .cse15 .cse9 .cse3 .cse6 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6)))) [2023-02-18 00:18:49,595 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse56 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse55 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse15 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse68 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse71 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse36 (<= .cse56 |ULTIMATE.start_main_~r~0#1|)) (.cse62 (<= .cse56 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse24 (<= 0 .cse71)) (.cse35 (<= |ULTIMATE.start_main_~l~0#1| .cse68)) (.cse25 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse39 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse63 (<= .cse71 0)) (.cse40 (<= .cse56 |ULTIMATE.start_main_~n~0#1|)) (.cse41 (let ((.cse70 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse70 (and .cse7 (not .cse70))))) (.cse43 (let ((.cse69 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse69) .cse15) .cse69))) (.cse44 (<= .cse54 .cse55))) (let ((.cse20 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse58 (or (and .cse62 .cse24 .cse35 .cse25 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse24 .cse35 .cse25 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44))) (.cse57 (or (and .cse35 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse35 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse35 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse35 .cse63 .cse40 .cse41 .cse43 .cse44))) (.cse53 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse50 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse65 (or (and .cse24 .cse35 .cse36 .cse25 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse36 .cse25 .cse39 .cse40 .cse41 .cse43 .cse44))) (.cse38 (<= .cse56 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse64 (or (and .cse35 .cse36 .cse39 .cse40 .cse41 .cse43 .cse44) (and .cse35 .cse36 .cse40 .cse41 .cse43 .cse44))) (.cse42 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (let ((.cse48 (or (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse65 .cse42) (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse64 .cse42))) (.cse61 (not .cse50)) (.cse60 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse52 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse14 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse19 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse53))) (.cse21 (or (and .cse58 .cse24 .cse35 .cse25 .cse7 .cse38 .cse42) (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse38 .cse42))) (.cse23 (< (- 1) .cse56)) (.cse18 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse59 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse67 (or (and .cse62 .cse35 .cse39 .cse63 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse35 .cse39 .cse63 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse37 (<= |ULTIMATE.start_main_~i~0#1| .cse68)) (.cse66 (or (and .cse24 .cse35 .cse25 .cse39 .cse63 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse62 .cse24 .cse35 .cse25 .cse39 .cse63 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse45 (<= |ULTIMATE.start_main_~j~0#1| .cse68))) (let ((.cse29 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse67 .cse38 .cse20 .cse45) (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse66 .cse45))) (.cse32 (< .cse59 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse51 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse66 .cse42) (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse67 .cse38 .cse20 .cse42))) (.cse30 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse64 .cse42) (and .cse24 .cse35 .cse36 .cse25 .cse7 .cse37 .cse38 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse34 (or (and .cse14 .cse15 .cse16 .cse21 .cse23 .cse20) (and .cse14 .cse15 .cse21 .cse23 .cse20) (and .cse14 .cse15 .cse16 .cse21 .cse23 .cse19) (and .cse14 .cse15 .cse21 .cse23 .cse19) (and .cse15 .cse16 .cse21 .cse23 .cse18 .cse20))) (.cse6 (<= (+ (* .cse52 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse12 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse33 (< .cse59 .cse60)) (.cse46 (or (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse64 .cse45) (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse65 .cse45))) (.cse31 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse47 (or (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse37 .cse38 .cse20 .cse42) (and .cse24 (or (and .cse62 .cse24 .cse35 .cse25 .cse63 .cse20 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse63 .cse20 .cse40 .cse41 .cse43 .cse44)) .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse42))) (.cse0 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse60 (- 3))) .cse61)) (.cse26 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse8 (or (< .cse59 (+ .cse60 (- 4))) .cse61)) (.cse17 (or (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse38 .cse45) (and .cse58 .cse24 .cse35 .cse25 .cse7 .cse38 .cse45))) (.cse4 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse56))) (.cse9 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| .cse56)) (.cse49 (<= |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse1 (<= .cse54 (+ 2 .cse55))) (.cse2 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse3 (<= .cse53 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (or (and .cse14 .cse15 .cse16 .cse23 .cse19 .cse48) (and .cse15 .cse16 .cse23 .cse18 .cse48 .cse20) (and .cse14 .cse15 .cse16 .cse23 .cse48 .cse20) (and .cse14 .cse15 .cse23 .cse48 .cse20) (and .cse14 .cse15 .cse23 .cse19 .cse48))) (.cse22 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= .cse53 |ULTIMATE.start_main_~n~0#1|)) (.cse28 (<= (+ 2 (* .cse52 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 (or (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19) (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse20)) .cse3 .cse7 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse7 .cse10 (or (and .cse14 .cse15 .cse16 .cse9 .cse21 .cse18 .cse22 .cse19) (and .cse14 .cse15 .cse16 .cse9 .cse21 .cse18 .cse22 .cse20)) .cse11 .cse13) (and (or (and .cse14 .cse15 .cse16 .cse17 .cse23 .cse20) (and .cse15 .cse16 .cse17 .cse23 .cse18 .cse20) (and .cse14 .cse15 .cse16 .cse17 .cse23 .cse19)) .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse7 .cse8 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse26 .cse15 .cse7 .cse8 .cse16 .cse9 .cse23 .cse18 .cse10 .cse27 .cse28 .cse29 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse32 .cse33 .cse11 .cse13) (and .cse1 .cse34 .cse2 .cse3 .cse24 .cse25 .cse7 .cse8 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse15 .cse7 .cse16 .cse9 .cse18 .cse10 .cse20 .cse29 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse16 .cse23 .cse10 .cse46 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse15 .cse7 .cse8 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse47 .cse13) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse24 .cse7 .cse8 .cse18 .cse22 .cse10 .cse28 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse23 .cse10 .cse27 .cse29 .cse11 .cse13) (and (or (and .cse14 .cse15 .cse16 .cse9 .cse18 .cse22 .cse19 .cse48) (and .cse14 .cse15 .cse16 .cse9 .cse18 .cse22 .cse48 .cse20)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse23 .cse10 .cse27 .cse32 .cse38 .cse39 .cse20 .cse33 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse27 .cse49 .cse11 .cse12 .cse13 .cse50) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse18 .cse22 .cse10 .cse27 .cse49 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse9 .cse23 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse30 .cse1 .cse3 .cse4 .cse15 .cse7 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse4 .cse15 .cse7 .cse8 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse37 .cse9 .cse23 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse7 .cse10 (or (and .cse14 .cse15 .cse9 .cse21 .cse18 .cse20) (and .cse14 .cse15 .cse9 .cse21 .cse18 .cse19)) .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse23 .cse10 .cse27 .cse38 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse4 .cse15 .cse7 .cse16 .cse9 .cse23 .cse18 .cse22 .cse10 .cse27 .cse49 .cse28 .cse20 .cse11 .cse13 .cse51) (and .cse1 .cse3 .cse15 .cse7 .cse16 .cse9 .cse18 .cse22 .cse10 .cse20 .cse11 .cse13 .cse51) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse48 .cse11 .cse13) (and .cse1 .cse3 .cse14 .cse15 .cse7 .cse9 .cse18 .cse10 .cse20 .cse11 .cse47 .cse13) (and .cse30 .cse1 .cse3 .cse4 .cse14 .cse15 .cse7 .cse9 .cse18 .cse10 .cse28 .cse20 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse34 .cse2 .cse3 .cse6 .cse7 .cse10 .cse27 .cse49 .cse11 .cse12 .cse13 .cse50) (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse18 .cse22 .cse10 .cse28 .cse33 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse7 .cse10 (or (and .cse15 .cse16 .cse23 .cse18 .cse20 .cse46) (and .cse14 .cse15 .cse16 .cse23 .cse20 .cse46) (and .cse14 .cse15 .cse16 .cse23 .cse19 .cse46)) .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse15 .cse7 .cse8 .cse21 .cse31 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse8 .cse31 .cse23 .cse10 .cse11 .cse47 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse17 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse23 .cse18 .cse22 .cse10 .cse27 .cse49 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44) (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse18 .cse22 .cse10 .cse28 .cse11 .cse13)))))))) [2023-02-18 00:18:49,598 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse52 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse55 (+ |ULTIMATE.start_main_~r~0#1| .cse52)) (.cse56 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse11 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse6 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse66 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse75 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse32 (<= .cse52 |ULTIMATE.start_main_~r~0#1|)) (.cse15 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse28 (<= 0 .cse75)) (.cse30 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse35 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse68 (<= .cse52 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse31 (<= |ULTIMATE.start_main_~l~0#1| .cse66)) (.cse67 (<= .cse75 0)) (.cse36 (<= .cse52 |ULTIMATE.start_main_~n~0#1|)) (.cse37 (let ((.cse74 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse74 (and .cse6 (not .cse74))))) (.cse39 (let ((.cse73 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse73) .cse11) .cse73))) (.cse40 (<= .cse55 .cse56))) (let ((.cse51 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse61 (or (and .cse31 .cse67 .cse36 .cse37 .cse39 .cse40) (and .cse31 .cse35 .cse67 .cse36 .cse37 .cse39 .cse40) (and .cse68 .cse31 .cse35 .cse67 .cse36 .cse37 .cse39 .cse40) (and .cse68 .cse31 .cse67 .cse36 .cse37 .cse39 .cse40))) (.cse60 (let ((.cse71 (and .cse28 .cse31 .cse30 .cse67 .cse36 .cse37 .cse39 .cse40)) (.cse72 (and .cse28 .cse31 .cse30 .cse67 .cse15 .cse36 .cse37 .cse39 .cse40))) (let ((.cse70 (or .cse71 .cse72))) (or (and .cse68 .cse70) (and .cse70 .cse35) .cse71 (and .cse68 .cse70 .cse35) .cse72)))) (.cse53 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse62 (let ((.cse69 (or (and .cse28 .cse31 .cse30 .cse36 .cse37 .cse39 .cse40) (and .cse28 .cse31 .cse30 .cse15 .cse36 .cse37 .cse39 .cse40)))) (or (and .cse32 .cse69 .cse35) (and .cse32 .cse69)))) (.cse34 (<= .cse52 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse63 (or (and .cse31 .cse32 .cse35 .cse36 .cse37 .cse39 .cse40) (and .cse31 .cse32 .cse36 .cse37 .cse39 .cse40))) (.cse38 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (let ((.cse16 (or (and .cse28 .cse31 .cse30 .cse6 .cse62 .cse34 .cse38) (and .cse28 .cse31 .cse30 .cse6 .cse34 .cse63 .cse38))) (.cse54 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse13 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse22 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse17 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse12 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse53))) (.cse10 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse23 (< (- 1) .cse52)) (.cse43 (or (and .cse28 .cse31 .cse30 .cse61 .cse6 .cse34 .cse38) (and .cse28 .cse31 .cse30 .cse6 .cse60 .cse34 .cse38))) (.cse59 (not .cse51)) (.cse58 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse57 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse65 (or (and .cse68 .cse31 .cse35 .cse67 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse31 .cse35 .cse67 .cse36 .cse37 .cse38 .cse39 .cse40))) (.cse33 (<= |ULTIMATE.start_main_~i~0#1| .cse66)) (.cse64 (or (and .cse28 .cse31 .cse30 .cse35 .cse67 .cse15 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse68 .cse28 .cse31 .cse30 .cse35 .cse67 .cse15 .cse36 .cse37 .cse38 .cse39 .cse40))) (.cse41 (<= |ULTIMATE.start_main_~j~0#1| .cse66))) (let ((.cse27 (or (and .cse28 .cse31 .cse30 .cse6 .cse33 .cse65 .cse34 .cse15 .cse41) (and .cse28 .cse31 .cse30 .cse6 .cse33 .cse34 .cse15 .cse64 .cse41))) (.cse25 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse49 (or (and .cse28 .cse31 .cse30 .cse6 .cse33 .cse34 .cse15 .cse64 .cse38) (and .cse28 .cse31 .cse30 .cse6 .cse33 .cse65 .cse34 .cse15 .cse38))) (.cse42 (or (and .cse28 .cse31 .cse30 .cse6 .cse62 .cse34 .cse41) (and .cse28 .cse31 .cse30 .cse6 .cse34 .cse63 .cse41))) (.cse21 (or (and .cse28 .cse31 .cse30 .cse6 .cse62 .cse33 .cse34 .cse15 .cse38) (and .cse28 .cse31 .cse30 .cse6 .cse33 .cse34 .cse15 .cse63 .cse38))) (.cse47 (< .cse57 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse46 (< .cse57 .cse58)) (.cse0 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse58 (- 3))) .cse59)) (.cse29 (or (and .cse28 .cse31 .cse30 .cse61 .cse6 .cse34 .cse41) (and .cse28 .cse31 .cse30 .cse6 .cse60 .cse34 .cse41))) (.cse44 (or (and .cse28 .cse31 .cse30 .cse6 .cse33 .cse60 .cse34 .cse15 .cse38) (and .cse28 .cse31 .cse30 .cse61 .cse6 .cse33 .cse34 .cse15 .cse38))) (.cse7 (or (< .cse57 (+ .cse58 (- 4))) .cse59)) (.cse50 (or (and .cse11 .cse12 .cse23 .cse13 .cse43 .cse15) (and .cse10 .cse11 .cse23 .cse17 .cse43) (and .cse11 .cse22 .cse23 .cse43) (and .cse10 .cse11 .cse12 .cse23 .cse17 .cse43) (and .cse10 .cse11 .cse12 .cse23 .cse43 .cse15) (and .cse10 .cse11 .cse23 .cse43 .cse15))) (.cse4 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse52))) (.cse8 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse14 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse24 (<= (+ 2 (* .cse54 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse1 (<= .cse55 (+ 2 .cse56))) (.cse2 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse3 (<= .cse53 |ULTIMATE.start_main_~j~0#1|)) (.cse45 (or (and .cse10 .cse11 .cse12 .cse23 .cse15 .cse16) (and .cse11 .cse22 .cse23 .cse16) (and .cse10 .cse11 .cse23 .cse17 .cse16) (and .cse10 .cse11 .cse23 .cse15 .cse16) (and .cse11 .cse12 .cse23 .cse13 .cse15 .cse16) (and .cse10 .cse11 .cse12 .cse23 .cse17 .cse16))) (.cse5 (<= (+ (* .cse54 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse9 (<= .cse53 |ULTIMATE.start_main_~n~0#1|)) (.cse26 (<= |ULTIMATE.start_main_~j~0#1| .cse52)) (.cse48 (<= |ULTIMATE.start_main_~r~0#1| .cse52)) (.cse18 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse19 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse20 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse15 .cse16) (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse17 .cse16)) .cse18 .cse19 .cse20) (and .cse1 .cse3 .cse4 .cse21 .cse11 .cse6 .cse8 .cse22 .cse23 .cse13 .cse9 .cse24 .cse18 .cse20) (and .cse1 .cse3 .cse4 .cse25 .cse11 .cse6 .cse7 .cse12 .cse8 .cse23 .cse13 .cse9 .cse26 .cse24 .cse27 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse29 .cse30 .cse25 .cse11 .cse6 .cse7 .cse12 .cse23 .cse9 .cse18 .cse20) (and .cse1 .cse3 .cse28 .cse4 .cse31 .cse32 .cse30 .cse11 .cse6 .cse12 .cse33 .cse8 .cse13 .cse9 .cse26 .cse34 .cse24 .cse35 .cse15 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40 .cse41) (and .cse1 .cse3 .cse4 .cse21 .cse11 .cse6 .cse7 .cse8 .cse22 .cse23 .cse13 .cse9 .cse24 .cse18 .cse20) (and .cse1 .cse3 .cse11 .cse6 .cse12 .cse8 .cse13 .cse9 .cse15 .cse27 .cse18 .cse20) (and .cse1 .cse3 .cse4 .cse21 .cse10 .cse11 .cse6 .cse8 .cse13 .cse9 .cse24 .cse15 .cse18 .cse20) (and .cse1 .cse2 .cse3 .cse28 .cse30 .cse42 .cse25 .cse11 .cse6 .cse12 .cse23 .cse9 .cse18 .cse20) (and .cse1 .cse3 .cse28 .cse30 .cse21 .cse11 .cse6 .cse22 .cse23 .cse9 .cse18 .cse20) (and .cse1 .cse3 .cse28 .cse30 .cse25 .cse11 .cse6 .cse7 .cse12 .cse23 .cse9 .cse26 .cse27 .cse18 .cse20) (and .cse1 .cse3 .cse6 (or (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse43 .cse15) (and .cse10 .cse11 .cse12 .cse8 .cse13 .cse14 .cse17 .cse43)) .cse9 .cse18 .cse20) (and .cse1 .cse3 .cse28 .cse30 .cse11 .cse6 .cse7 .cse44 .cse22 .cse23 .cse9 .cse18 .cse20) (and .cse1 .cse2 .cse3 .cse28 .cse45 .cse6 .cse13 .cse14 .cse9 .cse24 .cse46 .cse18 .cse20) (and .cse1 .cse3 .cse28 .cse31 .cse32 .cse30 .cse25 .cse11 .cse6 .cse12 .cse33 .cse23 .cse9 .cse26 .cse47 .cse34 .cse35 .cse15 .cse46 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40 .cse41) (and .cse1 .cse3 .cse28 .cse4 .cse31 .cse32 .cse30 .cse11 .cse6 .cse12 .cse33 .cse8 .cse13 .cse14 .cse9 .cse26 .cse48 .cse34 .cse24 .cse35 .cse15 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40) (and .cse1 .cse3 .cse28 .cse4 .cse31 .cse32 .cse30 .cse25 .cse11 .cse6 .cse12 .cse33 .cse8 .cse23 .cse13 .cse9 .cse26 .cse34 .cse24 .cse35 .cse15 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40 .cse41) (and .cse1 .cse3 .cse28 .cse4 .cse31 .cse32 .cse30 .cse25 .cse11 .cse6 .cse7 .cse12 .cse33 .cse8 .cse23 .cse13 .cse9 .cse26 .cse34 .cse24 .cse35 .cse15 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40 .cse41) (and .cse1 .cse3 .cse28 .cse31 .cse32 .cse30 .cse25 .cse11 .cse6 .cse12 .cse33 .cse23 .cse9 .cse26 .cse34 .cse35 .cse15 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40 .cse41) (and .cse1 .cse3 .cse4 .cse11 .cse6 .cse12 .cse8 .cse23 .cse13 .cse14 .cse9 .cse26 .cse48 .cse24 .cse15 .cse18 .cse20 .cse49) (and .cse1 .cse3 .cse11 .cse6 .cse12 .cse8 .cse13 .cse14 .cse9 .cse15 .cse18 .cse20 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse45 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse19 .cse20) (and (or (and .cse29 .cse10 .cse11 .cse12 .cse8 .cse13 .cse15) (and .cse29 .cse10 .cse11 .cse12 .cse8 .cse13 .cse17)) .cse1 .cse3 .cse6 .cse9 .cse18 .cse20) (and (or (and .cse10 .cse11 .cse8 .cse13 .cse43 .cse15) (and .cse10 .cse11 .cse8 .cse13 .cse17 .cse43)) .cse1 .cse3 .cse6 .cse9 .cse18 .cse20) (and .cse1 .cse2 .cse3 .cse28 .cse30 (or (and .cse10 .cse42 .cse11 .cse12 .cse23 .cse17) (and .cse10 .cse42 .cse11 .cse12 .cse23 .cse15) (and .cse42 .cse11 .cse12 .cse23 .cse13 .cse15)) .cse6 .cse9 .cse18 .cse20) (and .cse1 .cse3 .cse4 .cse11 .cse6 .cse7 .cse44 .cse8 .cse22 .cse23 .cse13 .cse9 .cse24 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse19 .cse50 .cse20) (and .cse1 .cse2 .cse3 .cse28 .cse45 .cse6 .cse13 .cse14 .cse9 .cse24 .cse18 .cse20) (and .cse1 .cse3 .cse28 .cse30 .cse21 .cse11 .cse6 .cse22 .cse23 .cse9 .cse47 .cse46 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse6 .cse7 .cse13 .cse14 .cse9 .cse24 .cse18 .cse50 .cse20) (and .cse1 .cse2 .cse3 .cse28 .cse45 .cse30 .cse6 .cse9 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse28 (or (and .cse29 .cse10 .cse11 .cse12 .cse23 .cse15) (and .cse29 .cse10 .cse11 .cse12 .cse23 .cse17) (and .cse29 .cse11 .cse12 .cse23 .cse13 .cse15)) .cse30 .cse6 .cse7 .cse9 .cse18 .cse20) (and .cse1 .cse3 .cse10 .cse11 .cse6 .cse44 .cse8 .cse13 .cse9 .cse15 .cse18 .cse20) (and .cse1 .cse2 .cse3 .cse28 .cse30 .cse6 .cse7 .cse9 .cse18 .cse50 .cse20) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse26 .cse48 .cse18 .cse19 .cse50 .cse20 .cse51) (and .cse1 .cse3 .cse28 .cse4 .cse31 .cse32 .cse30 .cse11 .cse6 .cse12 .cse33 .cse8 .cse23 .cse13 .cse14 .cse9 .cse26 .cse48 .cse34 .cse24 .cse35 .cse15 .cse18 .cse36 .cse37 .cse20 .cse38 .cse39 .cse40) (and .cse1 .cse2 .cse3 .cse45 .cse5 .cse6 .cse9 .cse26 .cse48 .cse18 .cse19 .cse20 .cse51)))))))) [2023-02-18 00:18:49,598 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-02-18 00:18:49,599 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2023-02-18 00:18:49,599 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 70) the Hoare annotation is: true [2023-02-18 00:18:49,600 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse39 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse43 (+ |ULTIMATE.start_main_~r~0#1| .cse39)) (.cse44 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse48 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)) (.cse45 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse34 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse38 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse35 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse42 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse25 (<= |ULTIMATE.start_main_~i~0#1| .cse45)) (.cse26 (<= .cse39 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse41 (<= .cse39 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse21 (<= 0 .cse48)) (.cse22 (<= |ULTIMATE.start_main_~l~0#1| .cse45)) (.cse24 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse40 (<= .cse48 0)) (.cse9 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse28 (<= .cse39 |ULTIMATE.start_main_~n~0#1|)) (.cse29 (let ((.cse47 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse47 (and .cse10 (not .cse47))))) (.cse30 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse31 (let ((.cse46 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse46) .cse3) .cse46))) (.cse32 (<= .cse43 .cse44)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| .cse45))) (let ((.cse20 (or (and .cse21 .cse22 .cse24 .cse10 .cse25 (or (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse26 .cse9 .cse33) (and .cse21 .cse22 .cse24 .cse10 .cse25 .cse26 .cse9 (or (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse33))) (.cse14 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse39))) (.cse5 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse19 (<= (+ 2 (* (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2) 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~j~0#1| .cse39)) (.cse7 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse8 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse23 (<= .cse39 |ULTIMATE.start_main_~r~0#1|)) (.cse2 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse37 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse35 (- 3))) .cse42)) (.cse0 (<= .cse43 (+ 2 .cse44))) (.cse36 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse1 (<= .cse38 |ULTIMATE.start_main_~j~0#1|)) (.cse15 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse16 (or (< .cse34 (+ .cse35 (- 4))) .cse42)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse38))) (.cse6 (or (and .cse21 .cse22 .cse24 .cse10 .cse26 (or (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse33) (and .cse21 .cse22 .cse24 .cse10 (or (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse26 .cse33))) (.cse17 (< (- 1) .cse39)) (.cse11 (<= .cse38 |ULTIMATE.start_main_~n~0#1|)) (.cse12 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse10 .cse16 .cse4 .cse5 .cse17 .cse7 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse25 .cse5 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse7 .cse11 .cse9 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse17 .cse11 .cse18 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 (< .cse34 (* 2 |ULTIMATE.start_main_~j~0#1|)) .cse26 .cse27 .cse9 (< .cse34 .cse35) .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse17 .cse11 .cse26 .cse27 .cse12 .cse28 .cse29 .cse13 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 (or (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse9) (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse8) (and .cse3 .cse4 .cse6 .cse17 .cse7 .cse9)) .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 .cse26 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse24 .cse10 (or (and .cse21 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse17 .cse7 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse8 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33)) .cse11 .cse12 .cse13) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse6 .cse17 .cse11 .cse12 .cse13)))))) [2023-02-18 00:18:49,601 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse39 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse43 (+ |ULTIMATE.start_main_~r~0#1| .cse39)) (.cse44 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse48 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)) (.cse45 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse34 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse38 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse35 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse42 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse25 (<= |ULTIMATE.start_main_~i~0#1| .cse45)) (.cse26 (<= .cse39 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse41 (<= .cse39 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse21 (<= 0 .cse48)) (.cse22 (<= |ULTIMATE.start_main_~l~0#1| .cse45)) (.cse24 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse40 (<= .cse48 0)) (.cse9 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse28 (<= .cse39 |ULTIMATE.start_main_~n~0#1|)) (.cse29 (let ((.cse47 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse47 (and .cse10 (not .cse47))))) (.cse30 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse31 (let ((.cse46 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse46) .cse3) .cse46))) (.cse32 (<= .cse43 .cse44)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| .cse45))) (let ((.cse20 (or (and .cse21 .cse22 .cse24 .cse10 .cse25 (or (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse26 .cse9 .cse33) (and .cse21 .cse22 .cse24 .cse10 .cse25 .cse26 .cse9 (or (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse33))) (.cse14 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse39))) (.cse5 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse19 (<= (+ 2 (* (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2) 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~j~0#1| .cse39)) (.cse7 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse8 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse23 (<= .cse39 |ULTIMATE.start_main_~r~0#1|)) (.cse2 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse37 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse35 (- 3))) .cse42)) (.cse0 (<= .cse43 (+ 2 .cse44))) (.cse36 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse1 (<= .cse38 |ULTIMATE.start_main_~j~0#1|)) (.cse15 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse16 (or (< .cse34 (+ .cse35 (- 4))) .cse42)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse38))) (.cse6 (or (and .cse21 .cse22 .cse24 .cse10 .cse26 (or (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse33) (and .cse21 .cse22 .cse24 .cse10 (or (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse26 .cse33))) (.cse17 (< (- 1) .cse39)) (.cse11 (<= .cse38 |ULTIMATE.start_main_~n~0#1|)) (.cse12 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse10 .cse16 .cse4 .cse5 .cse17 .cse7 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse25 .cse5 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse7 .cse11 .cse9 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse17 .cse11 .cse18 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 (< .cse34 (* 2 |ULTIMATE.start_main_~j~0#1|)) .cse26 .cse27 .cse9 (< .cse34 .cse35) .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse17 .cse11 .cse26 .cse27 .cse12 .cse28 .cse29 .cse13 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 (or (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse9) (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse8) (and .cse3 .cse4 .cse6 .cse17 .cse7 .cse9)) .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 .cse26 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse24 .cse10 (or (and .cse21 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse17 .cse7 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse8 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33)) .cse11 .cse12 .cse13) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse6 .cse17 .cse11 .cse12 .cse13)))))) [2023-02-18 00:18:49,601 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-02-18 00:18:49,601 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 00:18:49,601 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-02-18 00:18:49,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 00:18:49,602 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse56 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse55 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse17 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse64 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse77 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse32 (<= .cse56 |ULTIMATE.start_main_~r~0#1|)) (.cse21 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse27 (<= 0 .cse77)) (.cse28 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse35 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse66 (<= .cse56 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse31 (<= |ULTIMATE.start_main_~l~0#1| .cse64)) (.cse65 (<= .cse77 0)) (.cse36 (<= .cse56 |ULTIMATE.start_main_~n~0#1|)) (.cse37 (let ((.cse76 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse76 (and .cse3 (not .cse76))))) (.cse39 (let ((.cse75 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse75) .cse17) .cse75))) (.cse40 (<= .cse54 .cse55))) (let ((.cse58 (or (and .cse31 .cse65 .cse36 .cse37 .cse39 .cse40) (and .cse31 .cse35 .cse65 .cse36 .cse37 .cse39 .cse40) (and .cse66 .cse31 .cse35 .cse65 .cse36 .cse37 .cse39 .cse40) (and .cse66 .cse31 .cse65 .cse36 .cse37 .cse39 .cse40))) (.cse59 (let ((.cse73 (and .cse27 .cse31 .cse28 .cse65 .cse36 .cse37 .cse39 .cse40)) (.cse74 (and .cse27 .cse31 .cse28 .cse65 .cse21 .cse36 .cse37 .cse39 .cse40))) (let ((.cse72 (or .cse73 .cse74))) (or (and .cse66 .cse72) (and .cse72 .cse35) .cse73 (and .cse66 .cse72 .cse35) .cse74)))) (.cse52 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse44 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse38 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse61 (or (and .cse31 .cse32 .cse35 .cse36 .cse37 .cse39 .cse40) (and .cse31 .cse32 .cse36 .cse37 .cse39 .cse40))) (.cse33 (<= |ULTIMATE.start_main_~i~0#1| .cse64)) (.cse60 (let ((.cse71 (or (and .cse27 .cse31 .cse28 .cse36 .cse37 .cse39 .cse40) (and .cse27 .cse31 .cse28 .cse21 .cse36 .cse37 .cse39 .cse40)))) (or (and .cse32 .cse71 .cse35) (and .cse32 .cse71)))) (.cse34 (<= .cse56 (+ 2 |ULTIMATE.start_main_~n~0#1|)))) (let ((.cse15 (let ((.cse69 (or (and .cse31 .cse3 .cse60 .cse33 .cse34) (and .cse31 .cse3 .cse60 .cse34))) (.cse70 (or (and .cse31 .cse3 .cse33 .cse34 .cse61) (and .cse31 .cse3 .cse34 .cse61)))) (or (and .cse27 .cse69 .cse28 .cse3 .cse21 .cse38) (and .cse27 .cse28 .cse3 .cse21 .cse70 .cse38) (and .cse27 .cse69 .cse28 .cse3 .cse38) (and .cse27 .cse28 .cse3 .cse70 .cse38)))) (.cse49 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse50 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse57 (not .cse44)) (.cse51 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse5 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse53 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse52))) (.cse16 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse24 (< (- 1) .cse56)) (.cse20 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse42 (let ((.cse67 (or (and .cse31 .cse3 .cse33 .cse59 .cse34) (and .cse31 .cse3 .cse59 .cse34))) (.cse68 (or (and .cse31 .cse58 .cse3 .cse33 .cse34) (and .cse31 .cse58 .cse3 .cse34)))) (or (and .cse67 .cse27 .cse28 .cse3 .cse38) (and .cse27 .cse28 .cse3 .cse21 .cse68 .cse38) (and .cse67 .cse27 .cse28 .cse3 .cse21 .cse38) (and .cse27 .cse28 .cse3 .cse68 .cse38)))) (.cse63 (or (and .cse66 .cse31 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse31 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40))) (.cse62 (or (and .cse27 .cse31 .cse28 .cse35 .cse65 .cse21 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse66 .cse27 .cse31 .cse28 .cse35 .cse65 .cse21 .cse36 .cse37 .cse38 .cse39 .cse40))) (.cse41 (<= |ULTIMATE.start_main_~j~0#1| .cse64))) (let ((.cse26 (or (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse63 .cse34 .cse21 .cse41) (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse34 .cse21 .cse62 .cse41))) (.cse23 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse48 (or (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse34 .cse21 .cse62 .cse38) (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse63 .cse34 .cse21 .cse38))) (.cse45 (or (and .cse27 .cse31 .cse28 .cse3 .cse60 .cse34 .cse41) (and .cse27 .cse31 .cse28 .cse3 .cse34 .cse61 .cse41))) (.cse29 (or (and .cse16 .cse17 .cse18 .cse24 .cse20 .cse42) (and .cse17 .cse18 .cse24 .cse5 .cse42 .cse21) (and .cse16 .cse17 .cse24 .cse42 .cse21) (and .cse17 .cse53 .cse24 .cse42) (and .cse16 .cse17 .cse18 .cse24 .cse42 .cse21) (and .cse16 .cse17 .cse24 .cse20 .cse42))) (.cse13 (<= (+ (* .cse51 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse22 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse50 (- 3))) .cse57)) (.cse30 (or (and .cse27 .cse31 .cse28 .cse58 .cse3 .cse34 .cse41) (and .cse27 .cse31 .cse28 .cse3 .cse59 .cse34 .cse41))) (.cse14 (or (< .cse49 (+ .cse50 (- 4))) .cse57)) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse56))) (.cse4 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse25 (<= |ULTIMATE.start_main_~j~0#1| .cse56)) (.cse43 (<= |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse46 (< .cse49 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse0 (<= .cse54 (+ 2 .cse55))) (.cse12 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse1 (<= .cse52 |ULTIMATE.start_main_~j~0#1|)) (.cse19 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse6 (or (and .cse15 .cse16 .cse17 .cse18 .cse24 .cse20) (and .cse15 .cse17 .cse18 .cse24 .cse5 .cse21) (and .cse15 .cse17 .cse53 .cse24) (and .cse15 .cse16 .cse17 .cse18 .cse24 .cse21) (and .cse15 .cse16 .cse17 .cse24 .cse20) (and .cse15 .cse16 .cse17 .cse24 .cse21))) (.cse7 (<= .cse52 |ULTIMATE.start_main_~n~0#1|)) (.cse8 (<= (+ 2 (* .cse51 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse47 (< .cse49 .cse50)) (.cse9 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse10 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse7 (or (and .cse15 .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse20) (and .cse15 .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse21)) .cse9 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (or (and .cse15 .cse16 .cse17 .cse4 .cse5 .cse21) (and .cse15 .cse16 .cse17 .cse4 .cse5 .cse20))) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse6 .cse7 .cse9 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse23 .cse17 .cse3 .cse14 .cse18 .cse4 .cse24 .cse5 .cse7 .cse25 .cse8 .cse26 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 .cse29 .cse3 .cse14 .cse7 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse13 .cse29 .cse3 .cse14 .cse4 .cse7 .cse9 .cse22 .cse10) (and .cse11 .cse0 .cse12 .cse1 .cse27 .cse30 .cse28 .cse23 .cse17 .cse3 .cse14 .cse18 .cse24 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse17 .cse3 .cse18 .cse33 .cse4 .cse5 .cse7 .cse25 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and (or (and .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse20 .cse42) (and .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse42 .cse21)) .cse0 .cse1 .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse29 .cse3 .cse7 .cse25 .cse43 .cse9 .cse22 .cse10 .cse44) (and .cse0 .cse1 .cse17 .cse3 .cse18 .cse4 .cse5 .cse7 .cse21 .cse26 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 .cse45 .cse23 .cse17 .cse3 .cse18 .cse24 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse28 .cse23 .cse17 .cse3 .cse14 .cse18 .cse24 .cse7 .cse25 .cse26 .cse9 .cse10) (and .cse0 .cse1 (or (and .cse16 .cse17 .cse4 .cse5 .cse42 .cse21) (and .cse16 .cse17 .cse4 .cse5 .cse20 .cse42)) .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse18 .cse33 .cse24 .cse7 .cse25 .cse46 .cse34 .cse35 .cse21 .cse47 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse17 .cse3 .cse18 .cse33 .cse4 .cse5 .cse19 .cse7 .cse25 .cse43 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse27 .cse28 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse18 .cse33 .cse4 .cse24 .cse5 .cse7 .cse25 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse14 .cse18 .cse33 .cse4 .cse24 .cse5 .cse7 .cse25 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse11 .cse0 .cse12 .cse1 .cse27 .cse29 .cse3 .cse14 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse18 .cse33 .cse24 .cse7 .cse25 .cse34 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse18 .cse4 .cse24 .cse5 .cse19 .cse7 .cse25 .cse43 .cse8 .cse21 .cse9 .cse10 .cse48) (and .cse0 .cse1 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse7 .cse21 .cse9 .cse10 .cse48) (and .cse0 .cse1 .cse2 .cse29 .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and (or (and .cse30 .cse16 .cse17 .cse18 .cse4 .cse5 .cse21) (and .cse30 .cse16 .cse17 .cse18 .cse4 .cse5 .cse20)) .cse0 .cse1 .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 (or (and .cse16 .cse45 .cse17 .cse18 .cse24 .cse20) (and .cse16 .cse45 .cse17 .cse18 .cse24 .cse21) (and .cse45 .cse17 .cse18 .cse24 .cse5 .cse21)) .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse28 .cse29 .cse3 .cse14 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse6 .cse7 .cse25 .cse43 .cse9 .cse22 .cse10 .cse44) (and .cse11 .cse0 .cse12 .cse1 .cse27 (or (and .cse30 .cse16 .cse17 .cse18 .cse24 .cse21) (and .cse30 .cse16 .cse17 .cse18 .cse24 .cse20) (and .cse30 .cse17 .cse18 .cse24 .cse5 .cse21)) .cse28 .cse3 .cse14 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse17 .cse3 .cse18 .cse33 .cse4 .cse24 .cse5 .cse19 .cse7 .cse25 .cse43 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse27 .cse28 .cse3 .cse6 .cse7 .cse46 .cse47 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse47 .cse9 .cse10)))))))) [2023-02-18 00:18:49,603 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-02-18 00:18:49,603 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse39 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse43 (+ |ULTIMATE.start_main_~r~0#1| .cse39)) (.cse44 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse48 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)) (.cse45 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse34 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse38 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse35 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse42 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse25 (<= |ULTIMATE.start_main_~i~0#1| .cse45)) (.cse26 (<= .cse39 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse41 (<= .cse39 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse21 (<= 0 .cse48)) (.cse22 (<= |ULTIMATE.start_main_~l~0#1| .cse45)) (.cse24 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse40 (<= .cse48 0)) (.cse9 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse28 (<= .cse39 |ULTIMATE.start_main_~n~0#1|)) (.cse29 (let ((.cse47 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse47 (and .cse10 (not .cse47))))) (.cse30 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse31 (let ((.cse46 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse46) .cse3) .cse46))) (.cse32 (<= .cse43 .cse44)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| .cse45))) (let ((.cse20 (or (and .cse21 .cse22 .cse24 .cse10 .cse25 (or (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse26 .cse9 .cse33) (and .cse21 .cse22 .cse24 .cse10 .cse25 .cse26 .cse9 (or (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse33))) (.cse14 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse39))) (.cse5 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse19 (<= (+ 2 (* (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2) 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~j~0#1| .cse39)) (.cse7 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse8 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse23 (<= .cse39 |ULTIMATE.start_main_~r~0#1|)) (.cse2 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse37 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse35 (- 3))) .cse42)) (.cse0 (<= .cse43 (+ 2 .cse44))) (.cse36 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse1 (<= .cse38 |ULTIMATE.start_main_~j~0#1|)) (.cse15 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse16 (or (< .cse34 (+ .cse35 (- 4))) .cse42)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse38))) (.cse6 (or (and .cse21 .cse22 .cse24 .cse10 .cse26 (or (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse33) (and .cse21 .cse22 .cse24 .cse10 (or (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse26 .cse33))) (.cse17 (< (- 1) .cse39)) (.cse11 (<= .cse38 |ULTIMATE.start_main_~n~0#1|)) (.cse12 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse10 .cse16 .cse4 .cse5 .cse17 .cse7 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse25 .cse5 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse7 .cse11 .cse9 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse17 .cse11 .cse18 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 (< .cse34 (* 2 |ULTIMATE.start_main_~j~0#1|)) .cse26 .cse27 .cse9 (< .cse34 .cse35) .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse17 .cse11 .cse26 .cse27 .cse12 .cse28 .cse29 .cse13 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 (or (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse9) (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse8) (and .cse3 .cse4 .cse6 .cse17 .cse7 .cse9)) .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 .cse26 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse24 .cse10 (or (and .cse21 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse17 .cse7 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse8 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33)) .cse11 .cse12 .cse13) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse6 .cse17 .cse11 .cse12 .cse13)))))) [2023-02-18 00:18:49,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 00:18:49,605 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse56 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse55 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse17 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse64 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse77 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse32 (<= .cse56 |ULTIMATE.start_main_~r~0#1|)) (.cse21 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse27 (<= 0 .cse77)) (.cse28 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse35 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse66 (<= .cse56 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse31 (<= |ULTIMATE.start_main_~l~0#1| .cse64)) (.cse65 (<= .cse77 0)) (.cse36 (<= .cse56 |ULTIMATE.start_main_~n~0#1|)) (.cse37 (let ((.cse76 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse76 (and .cse3 (not .cse76))))) (.cse39 (let ((.cse75 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse75) .cse17) .cse75))) (.cse40 (<= .cse54 .cse55))) (let ((.cse58 (or (and .cse31 .cse65 .cse36 .cse37 .cse39 .cse40) (and .cse31 .cse35 .cse65 .cse36 .cse37 .cse39 .cse40) (and .cse66 .cse31 .cse35 .cse65 .cse36 .cse37 .cse39 .cse40) (and .cse66 .cse31 .cse65 .cse36 .cse37 .cse39 .cse40))) (.cse59 (let ((.cse73 (and .cse27 .cse31 .cse28 .cse65 .cse36 .cse37 .cse39 .cse40)) (.cse74 (and .cse27 .cse31 .cse28 .cse65 .cse21 .cse36 .cse37 .cse39 .cse40))) (let ((.cse72 (or .cse73 .cse74))) (or (and .cse66 .cse72) (and .cse72 .cse35) .cse73 (and .cse66 .cse72 .cse35) .cse74)))) (.cse52 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse44 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse38 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse61 (or (and .cse31 .cse32 .cse35 .cse36 .cse37 .cse39 .cse40) (and .cse31 .cse32 .cse36 .cse37 .cse39 .cse40))) (.cse33 (<= |ULTIMATE.start_main_~i~0#1| .cse64)) (.cse60 (let ((.cse71 (or (and .cse27 .cse31 .cse28 .cse36 .cse37 .cse39 .cse40) (and .cse27 .cse31 .cse28 .cse21 .cse36 .cse37 .cse39 .cse40)))) (or (and .cse32 .cse71 .cse35) (and .cse32 .cse71)))) (.cse34 (<= .cse56 (+ 2 |ULTIMATE.start_main_~n~0#1|)))) (let ((.cse15 (let ((.cse69 (or (and .cse31 .cse3 .cse60 .cse33 .cse34) (and .cse31 .cse3 .cse60 .cse34))) (.cse70 (or (and .cse31 .cse3 .cse33 .cse34 .cse61) (and .cse31 .cse3 .cse34 .cse61)))) (or (and .cse27 .cse69 .cse28 .cse3 .cse21 .cse38) (and .cse27 .cse28 .cse3 .cse21 .cse70 .cse38) (and .cse27 .cse69 .cse28 .cse3 .cse38) (and .cse27 .cse28 .cse3 .cse70 .cse38)))) (.cse49 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse50 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse57 (not .cse44)) (.cse51 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse5 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse53 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse52))) (.cse16 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse24 (< (- 1) .cse56)) (.cse20 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse42 (let ((.cse67 (or (and .cse31 .cse3 .cse33 .cse59 .cse34) (and .cse31 .cse3 .cse59 .cse34))) (.cse68 (or (and .cse31 .cse58 .cse3 .cse33 .cse34) (and .cse31 .cse58 .cse3 .cse34)))) (or (and .cse67 .cse27 .cse28 .cse3 .cse38) (and .cse27 .cse28 .cse3 .cse21 .cse68 .cse38) (and .cse67 .cse27 .cse28 .cse3 .cse21 .cse38) (and .cse27 .cse28 .cse3 .cse68 .cse38)))) (.cse63 (or (and .cse66 .cse31 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse31 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40))) (.cse62 (or (and .cse27 .cse31 .cse28 .cse35 .cse65 .cse21 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse66 .cse27 .cse31 .cse28 .cse35 .cse65 .cse21 .cse36 .cse37 .cse38 .cse39 .cse40))) (.cse41 (<= |ULTIMATE.start_main_~j~0#1| .cse64))) (let ((.cse26 (or (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse63 .cse34 .cse21 .cse41) (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse34 .cse21 .cse62 .cse41))) (.cse23 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse48 (or (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse34 .cse21 .cse62 .cse38) (and .cse27 .cse31 .cse28 .cse3 .cse33 .cse63 .cse34 .cse21 .cse38))) (.cse45 (or (and .cse27 .cse31 .cse28 .cse3 .cse60 .cse34 .cse41) (and .cse27 .cse31 .cse28 .cse3 .cse34 .cse61 .cse41))) (.cse29 (or (and .cse16 .cse17 .cse18 .cse24 .cse20 .cse42) (and .cse17 .cse18 .cse24 .cse5 .cse42 .cse21) (and .cse16 .cse17 .cse24 .cse42 .cse21) (and .cse17 .cse53 .cse24 .cse42) (and .cse16 .cse17 .cse18 .cse24 .cse42 .cse21) (and .cse16 .cse17 .cse24 .cse20 .cse42))) (.cse13 (<= (+ (* .cse51 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse22 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse50 (- 3))) .cse57)) (.cse30 (or (and .cse27 .cse31 .cse28 .cse58 .cse3 .cse34 .cse41) (and .cse27 .cse31 .cse28 .cse3 .cse59 .cse34 .cse41))) (.cse14 (or (< .cse49 (+ .cse50 (- 4))) .cse57)) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse56))) (.cse4 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse25 (<= |ULTIMATE.start_main_~j~0#1| .cse56)) (.cse43 (<= |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse46 (< .cse49 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse0 (<= .cse54 (+ 2 .cse55))) (.cse12 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse1 (<= .cse52 |ULTIMATE.start_main_~j~0#1|)) (.cse19 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse6 (or (and .cse15 .cse16 .cse17 .cse18 .cse24 .cse20) (and .cse15 .cse17 .cse18 .cse24 .cse5 .cse21) (and .cse15 .cse17 .cse53 .cse24) (and .cse15 .cse16 .cse17 .cse18 .cse24 .cse21) (and .cse15 .cse16 .cse17 .cse24 .cse20) (and .cse15 .cse16 .cse17 .cse24 .cse21))) (.cse7 (<= .cse52 |ULTIMATE.start_main_~n~0#1|)) (.cse8 (<= (+ 2 (* .cse51 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse47 (< .cse49 .cse50)) (.cse9 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse10 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse7 (or (and .cse15 .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse20) (and .cse15 .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse21)) .cse9 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (or (and .cse15 .cse16 .cse17 .cse4 .cse5 .cse21) (and .cse15 .cse16 .cse17 .cse4 .cse5 .cse20))) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse6 .cse7 .cse9 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse23 .cse17 .cse3 .cse14 .cse18 .cse4 .cse24 .cse5 .cse7 .cse25 .cse8 .cse26 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 .cse29 .cse3 .cse14 .cse7 .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse13 .cse29 .cse3 .cse14 .cse4 .cse7 .cse9 .cse22 .cse10) (and .cse11 .cse0 .cse12 .cse1 .cse27 .cse30 .cse28 .cse23 .cse17 .cse3 .cse14 .cse18 .cse24 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse17 .cse3 .cse18 .cse33 .cse4 .cse5 .cse7 .cse25 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and (or (and .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse20 .cse42) (and .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse42 .cse21)) .cse0 .cse1 .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse29 .cse3 .cse7 .cse25 .cse43 .cse9 .cse22 .cse10 .cse44) (and .cse0 .cse1 .cse17 .cse3 .cse18 .cse4 .cse5 .cse7 .cse21 .cse26 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 .cse45 .cse23 .cse17 .cse3 .cse18 .cse24 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse28 .cse23 .cse17 .cse3 .cse14 .cse18 .cse24 .cse7 .cse25 .cse26 .cse9 .cse10) (and .cse0 .cse1 (or (and .cse16 .cse17 .cse4 .cse5 .cse42 .cse21) (and .cse16 .cse17 .cse4 .cse5 .cse20 .cse42)) .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse18 .cse33 .cse24 .cse7 .cse25 .cse46 .cse34 .cse35 .cse21 .cse47 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse17 .cse3 .cse18 .cse33 .cse4 .cse5 .cse19 .cse7 .cse25 .cse43 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse27 .cse28 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse18 .cse33 .cse4 .cse24 .cse5 .cse7 .cse25 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse14 .cse18 .cse33 .cse4 .cse24 .cse5 .cse7 .cse25 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse11 .cse0 .cse12 .cse1 .cse27 .cse29 .cse3 .cse14 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse31 .cse32 .cse28 .cse23 .cse17 .cse3 .cse18 .cse33 .cse24 .cse7 .cse25 .cse34 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse18 .cse4 .cse24 .cse5 .cse19 .cse7 .cse25 .cse43 .cse8 .cse21 .cse9 .cse10 .cse48) (and .cse0 .cse1 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse7 .cse21 .cse9 .cse10 .cse48) (and .cse0 .cse1 .cse2 .cse29 .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and (or (and .cse30 .cse16 .cse17 .cse18 .cse4 .cse5 .cse21) (and .cse30 .cse16 .cse17 .cse18 .cse4 .cse5 .cse20)) .cse0 .cse1 .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 (or (and .cse16 .cse45 .cse17 .cse18 .cse24 .cse20) (and .cse16 .cse45 .cse17 .cse18 .cse24 .cse21) (and .cse45 .cse17 .cse18 .cse24 .cse5 .cse21)) .cse3 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse28 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse28 .cse29 .cse3 .cse14 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse6 .cse7 .cse25 .cse43 .cse9 .cse22 .cse10 .cse44) (and .cse11 .cse0 .cse12 .cse1 .cse27 (or (and .cse30 .cse16 .cse17 .cse18 .cse24 .cse21) (and .cse30 .cse16 .cse17 .cse18 .cse24 .cse20) (and .cse30 .cse17 .cse18 .cse24 .cse5 .cse21)) .cse28 .cse3 .cse14 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse27 .cse2 .cse31 .cse32 .cse28 .cse17 .cse3 .cse18 .cse33 .cse4 .cse24 .cse5 .cse19 .cse7 .cse25 .cse43 .cse34 .cse8 .cse35 .cse21 .cse9 .cse36 .cse37 .cse10 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse27 .cse28 .cse3 .cse6 .cse7 .cse46 .cse47 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse47 .cse9 .cse10)))))))) [2023-02-18 00:18:49,606 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse39 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse43 (+ |ULTIMATE.start_main_~r~0#1| .cse39)) (.cse44 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse48 (+ (- 1) |ULTIMATE.start_main_~l~0#1|)) (.cse45 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse34 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse38 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse35 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse42 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse25 (<= |ULTIMATE.start_main_~i~0#1| .cse45)) (.cse26 (<= .cse39 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse41 (<= .cse39 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse21 (<= 0 .cse48)) (.cse22 (<= |ULTIMATE.start_main_~l~0#1| .cse45)) (.cse24 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse40 (<= .cse48 0)) (.cse9 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse28 (<= .cse39 |ULTIMATE.start_main_~n~0#1|)) (.cse29 (let ((.cse47 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse47 (and .cse10 (not .cse47))))) (.cse30 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse31 (let ((.cse46 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse46) .cse3) .cse46))) (.cse32 (<= .cse43 .cse44)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| .cse45))) (let ((.cse20 (or (and .cse21 .cse22 .cse24 .cse10 .cse25 (or (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse26 .cse9 .cse33) (and .cse21 .cse22 .cse24 .cse10 .cse25 .cse26 .cse9 (or (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse9 .cse28 .cse29 .cse30 .cse31 .cse32)) .cse33))) (.cse14 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse39))) (.cse5 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse19 (<= (+ 2 (* (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2) 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~j~0#1| .cse39)) (.cse7 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse8 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse23 (<= .cse39 |ULTIMATE.start_main_~r~0#1|)) (.cse2 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse37 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse35 (- 3))) .cse42)) (.cse0 (<= .cse43 (+ 2 .cse44))) (.cse36 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse1 (<= .cse38 |ULTIMATE.start_main_~j~0#1|)) (.cse15 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse16 (or (< .cse34 (+ .cse35 (- 4))) .cse42)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse38))) (.cse6 (or (and .cse21 .cse22 .cse24 .cse10 .cse26 (or (and .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse41 .cse22 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse33) (and .cse21 .cse22 .cse24 .cse10 (or (and .cse41 .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32) (and .cse21 .cse22 .cse24 .cse27 .cse40 .cse28 .cse29 .cse31 .cse32)) .cse26 .cse33))) (.cse17 (< (- 1) .cse39)) (.cse11 (<= .cse38 |ULTIMATE.start_main_~n~0#1|)) (.cse12 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse15 .cse3 .cse10 .cse16 .cse4 .cse5 .cse17 .cse7 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse25 .cse5 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse7 .cse11 .cse9 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse17 .cse11 .cse18 .cse20 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 (< .cse34 (* 2 |ULTIMATE.start_main_~j~0#1|)) .cse26 .cse27 .cse9 (< .cse34 .cse35) .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse17 .cse11 .cse26 .cse27 .cse12 .cse28 .cse29 .cse13 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 (or (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse9) (and .cse2 .cse3 .cse4 .cse6 .cse17 .cse8) (and .cse3 .cse4 .cse6 .cse17 .cse7 .cse9)) .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse21 .cse14 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse25 .cse5 .cse17 .cse7 .cse11 .cse18 .cse26 .cse19 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse21 .cse22 .cse23 .cse24 .cse15 .cse3 .cse10 .cse4 .cse25 .cse17 .cse11 .cse18 .cse26 .cse27 .cse9 .cse12 .cse28 .cse29 .cse13 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse36 .cse1 .cse21 .cse24 .cse10 (or (and .cse21 .cse22 .cse23 .cse24 .cse3 .cse10 .cse4 .cse17 .cse7 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse8 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33) (and .cse21 .cse22 .cse23 .cse24 .cse2 .cse3 .cse10 .cse4 .cse17 .cse26 .cse27 .cse9 .cse28 .cse29 .cse31 .cse32 .cse33)) .cse11 .cse12 .cse13) (and .cse37 .cse0 .cse36 .cse1 .cse21 .cse24 .cse15 .cse3 .cse10 .cse16 .cse4 .cse6 .cse17 .cse11 .cse12 .cse13)))))) [2023-02-18 00:18:49,606 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 00:18:49,607 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse43 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse50 (+ |ULTIMATE.start_main_~r~0#1| .cse43)) (.cse51 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse45 (+ (- 2) |ULTIMATE.start_main_~j~0#1|)) (.cse53 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse56 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse49 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse52 (<= .cse43 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse22 (<= 0 .cse56)) (.cse23 (<= |ULTIMATE.start_main_~l~0#1| .cse53)) (.cse25 (<= 0 .cse45)) (.cse44 (<= .cse56 0)) (.cse30 (<= .cse43 |ULTIMATE.start_main_~n~0#1|)) (.cse31 (let ((.cse55 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse55 (and .cse7 (not .cse55))))) (.cse33 (let ((.cse54 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse54) .cse6) .cse54))) (.cse34 (<= .cse50 .cse51)) (.cse27 (<= .cse43 (+ 2 |ULTIMATE.start_main_~n~0#1|)))) (let ((.cse11 (< (- 1) .cse43)) (.cse12 (or (and .cse22 .cse23 .cse25 .cse7 (or (and .cse23 .cse44 .cse30 .cse31 .cse33 .cse34) (and .cse52 .cse23 .cse44 .cse30 .cse31 .cse33 .cse34)) .cse27) (and .cse22 .cse23 .cse25 .cse7 (or (and .cse22 .cse23 .cse25 .cse44 .cse30 .cse31 .cse33 .cse34) (and .cse52 .cse22 .cse23 .cse25 .cse44 .cse30 .cse31 .cse33 .cse34)) .cse27))) (.cse15 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse42 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse47 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse41 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse48 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse32 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse26 (<= |ULTIMATE.start_main_~i~0#1| .cse53)) (.cse38 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse46 (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse24 (<= .cse43 |ULTIMATE.start_main_~r~0#1|)) (.cse37 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse9 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse49))) (.cse10 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse29 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse13 (<= 4 |ULTIMATE.start_main_~j~0#1|))) (let ((.cse39 (or (and .cse46 .cse22 .cse23 .cse24 .cse25 .cse37 .cse6 .cse7 .cse9 .cse10 .cse38 .cse27 .cse30 .cse13 .cse31 .cse33 .cse34) (and .cse46 .cse22 .cse23 .cse24 .cse25 .cse37 .cse6 .cse7 .cse9 .cse10 .cse27 .cse29 .cse30 .cse13 .cse31 .cse33 .cse34))) (.cse28 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse19 (<= |ULTIMATE.start_main_~r~0#1| .cse43)) (.cse17 (<= |ULTIMATE.start_main_~j~0#1| .cse43)) (.cse18 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse21 (or (and .cse22 .cse23 .cse25 (or (and .cse52 .cse22 .cse23 .cse25 .cse44 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse22 .cse23 .cse25 .cse44 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) .cse7 .cse26 .cse27 .cse29) (and .cse22 .cse23 .cse25 .cse7 (or (and .cse23 .cse44 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse52 .cse23 .cse44 .cse30 .cse31 .cse32 .cse33 .cse34)) .cse26 .cse27 .cse29))) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse43))) (.cse4 (<= (+ (* .cse48 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse8 (or (< .cse42 (+ .cse47 (- 4))) (not .cse41))) (.cse40 (or (and .cse37 .cse6 .cse9 .cse11 .cse12 .cse29) (and .cse37 .cse6 .cse9 .cse11 .cse12 .cse38) (and .cse6 .cse9 .cse11 .cse12 .cse15 .cse29))) (.cse5 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse36 (or (and .cse22 .cse23 .cse24 .cse25 .cse37 .cse6 .cse7 .cse9 .cse11 .cse38 .cse27 .cse30 .cse31 .cse33 .cse34) (and .cse22 .cse23 .cse24 .cse25 .cse37 .cse6 .cse7 .cse9 .cse11 .cse27 .cse29 .cse30 .cse31 .cse33 .cse34) (and .cse22 .cse23 .cse24 .cse25 .cse6 .cse7 .cse9 .cse11 .cse15 .cse27 .cse29 .cse30 .cse31 .cse33 .cse34))) (.cse0 (<= .cse50 (+ 2 .cse51))) (.cse1 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse2 (<= .cse49 |ULTIMATE.start_main_~j~0#1|)) (.cse16 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse20 (<= (+ 2 (* .cse48 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse35 (< .cse42 .cse47)) (.cse14 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse14) (and .cse0 .cse2 .cse22 .cse3 .cse23 .cse24 .cse25 .cse6 .cse7 .cse9 .cse26 .cse10 .cse15 .cse17 .cse18 .cse27 .cse20 .cse28 .cse29 .cse30 .cse31 .cse14 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse22 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse9 .cse11 .cse15 .cse16 .cse27 .cse20 .cse35 .cse30 .cse31 .cse14 .cse33 .cse34) (and .cse36 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse10 .cse19 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (or (and .cse22 .cse23 .cse24 .cse25 .cse37 .cse6 .cse7 .cse9 .cse10 .cse15 .cse27 .cse29 .cse30 .cse31 .cse33 .cse34) (and .cse22 .cse23 .cse24 .cse25 .cse37 .cse6 .cse7 .cse9 .cse10 .cse15 .cse38 .cse27 .cse30 .cse31 .cse33 .cse34)) .cse4 .cse7 .cse10 .cse13 .cse14) (and .cse0 .cse2 .cse22 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse9 .cse26 .cse11 .cse17 .cse18 .cse27 .cse28 .cse29 .cse30 .cse31 .cse14 .cse32 .cse33 .cse34) (and .cse36 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse39 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse10 .cse19 .cse39 .cse13 .cse14) (and .cse0 .cse2 .cse22 .cse3 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse15 .cse17 .cse18 .cse27 .cse20 .cse28 .cse29 .cse30 .cse31 .cse14 .cse32 .cse33 .cse34) (and .cse0 .cse2 .cse6 .cse7 .cse9 .cse10 .cse15 .cse18 .cse29 .cse21 .cse14) (and .cse36 .cse0 .cse1 .cse2 .cse22 .cse25 .cse7 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse40 .cse19 .cse13 .cse14 .cse41) (and .cse36 .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse13 .cse14) (and .cse0 .cse2 .cse22 .cse3 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse15 .cse17 .cse18 .cse27 .cse20 .cse28 .cse29 .cse30 .cse31 .cse14 .cse32 .cse33 .cse34) (and .cse0 .cse2 .cse22 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse17 .cse18 .cse21 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse8 .cse40 .cse13 .cse14) (and .cse0 .cse2 .cse22 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse9 .cse26 .cse11 .cse17 .cse18 (< .cse42 (* 2 |ULTIMATE.start_main_~j~0#1|)) .cse27 .cse28 .cse29 .cse35 .cse30 .cse31 .cse14 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse23 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse27 .cse30 .cse13 .cse31 .cse14 .cse33 .cse34) (and .cse36 .cse0 .cse1 .cse2 .cse4 .cse7 .cse19 .cse13 .cse14 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse10 .cse40 .cse19 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse23 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse30 .cse13 .cse31 .cse14 .cse33 .cse34) (and .cse36 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse10 .cse13 .cse14) (and .cse0 .cse22 .cse25 .cse27 (<= |ULTIMATE.start_main_~r~0#1| (+ (- 2) .cse43)) .cse44 .cse31 .cse33 (<= |ULTIMATE.start_main_~r~0#1| .cse45)) (and .cse36 .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse35 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse17 .cse18 .cse20 .cse21 .cse14) (and .cse0 .cse2 (or (and .cse37 .cse6 .cse9 .cse10 .cse12 .cse15 .cse29) (and .cse37 .cse6 .cse9 .cse10 .cse12 .cse15 .cse38)) .cse7 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse25 .cse7 .cse8 .cse40 .cse14) (and .cse0 .cse2 .cse7 (or (and .cse46 .cse37 .cse6 .cse9 .cse10 .cse12 .cse38 .cse13) (and .cse46 .cse37 .cse6 .cse9 .cse10 .cse12 .cse29 .cse13)) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse40 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse23 .cse24 .cse25 .cse5 .cse6 .cse7 .cse9 .cse11 .cse27 .cse30 .cse31 .cse14 .cse33 .cse34) (and .cse36 .cse0 .cse1 .cse2 .cse22 .cse7 .cse15 .cse16 .cse20 .cse35 .cse14))))))) [2023-02-18 00:18:49,607 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2023-02-18 00:18:49,607 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-02-18 00:18:49,608 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 35 68) the Hoare annotation is: (let ((.cse52 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse75 (+ |ULTIMATE.start_main_~r~0#1| .cse52)) (.cse74 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse88 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse17 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse63 (<= |ULTIMATE.start_main_~l~0#1| .cse88)) (.cse87 (<= .cse75 .cse74))) (let ((.cse60 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse89 (or (and .cse63 .cse87) .cse87)) (.cse86 (<= .cse52 |ULTIMATE.start_main_~n~0#1|)) (.cse26 (let ((.cse90 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse90 (and .cse17 (not .cse90))))) (.cse31 (+ (- 2) |ULTIMATE.start_main_~j~0#1|)) (.cse78 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse10 (<= 0 .cse78)) (.cse14 (<= 0 .cse31)) (.cse83 (and .cse89 .cse86 .cse26)) (.cse84 (and .cse89 .cse86 .cse26 .cse60))) (let ((.cse64 (<= |ULTIMATE.start_main_~i~0#1| .cse88)) (.cse23 (<= .cse52 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse61 (<= |ULTIMATE.start_main_~j~0#1| .cse88)) (.cse76 (<= .cse52 |ULTIMATE.start_main_~r~0#1|)) (.cse66 (or .cse83 .cse84)) (.cse40 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse27 (or .cse10 (and .cse10 .cse14)))) (let ((.cse73 (let ((.cse85 (or (and .cse63 .cse27 .cse87) (and .cse27 .cse87)))) (or (and .cse85 .cse86 .cse26) (and .cse85 .cse86 .cse26 .cse60)))) (.cse77 (let ((.cse79 (let ((.cse80 (let ((.cse81 (let ((.cse82 (or .cse83 (and .cse66 .cse40) .cse84))) (or (and .cse76 .cse82) (and .cse76 .cse82 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)))))) (or (and .cse81 .cse17 .cse61) (and .cse81 .cse17))))) (or (and .cse63 .cse80 .cse23) (and .cse63 .cse64 .cse80 .cse23))))) (or (and .cse17 .cse79 .cse61) (and .cse17 .cse79) (and .cse17 .cse79 .cse60))))) (let ((.cse25 (<= .cse78 0)) (.cse49 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse45 (and .cse10 .cse14 .cse77)) (.cse46 (and .cse10 .cse14 .cse77 .cse40)) (.cse48 (and .cse10 .cse63 .cse76 .cse17 .cse73 .cse23))) (let ((.cse22 (or .cse45 .cse46 .cse48)) (.cse51 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse28 (<= .cse49 |ULTIMATE.start_main_~n~0#1|)) (.cse29 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse19 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse16 (<= .cse75 (+ 2 .cse74))) (.cse18 (<= |ULTIMATE.start_main_~r~0#1| (+ (- 2) .cse74))) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| .cse49) (+ (- 2) .cse74 |ULTIMATE.start_main_~j~0#1|))) (.cse42 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse44 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse38 (< (- 1) .cse52)) (.cse30 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse50 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse55 (not (> |ULTIMATE.start_main_~l~0#1| 1))) (.cse41 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse36 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse3 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse47 (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse13 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse54 (let ((.cse67 (<= .cse52 (+ 2 |ULTIMATE.start_main_~r~0#1|)))) (let ((.cse57 (let ((.cse68 (let ((.cse69 (let ((.cse70 (let ((.cse71 (and .cse10 .cse73 .cse25 .cse40)) (.cse72 (and .cse10 .cse73 .cse25))) (or (and .cse67 (or .cse71 .cse72)) .cse71 .cse72)))) (or (and .cse17 .cse70) (and .cse17 .cse70 .cse61))))) (or (and .cse63 .cse64 .cse69 .cse23) (and .cse63 .cse69 .cse23))))) (or (and .cse68 .cse17 .cse60) (and .cse68 .cse17 .cse61) (and .cse68 .cse17)))) (.cse58 (let ((.cse59 (let ((.cse62 (let ((.cse65 (or (and .cse66 .cse25) (and .cse67 .cse66 .cse25)))) (or (and .cse65 .cse17) (and .cse65 .cse17 .cse61))))) (or (and .cse62 .cse63 .cse64 .cse23) (and .cse62 .cse63 .cse23))))) (or (and .cse59 .cse17 .cse60) (and .cse59 .cse17 .cse61) (and .cse59 .cse17))))) (or (and .cse10 .cse14 .cse57) (and .cse10 .cse14 .cse58 .cse40) (and .cse10 .cse14 .cse40 .cse57) (and .cse10 .cse14 .cse58))))) (.cse1 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse2 (<= 2 |ULTIMATE.start_main_~j~0#1|))) (let ((.cse4 (<= |ULTIMATE.start_main_~j~0#1| .cse52)) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| .cse52)) (.cse20 (let ((.cse56 (or (and .cse54 .cse1 .cse2 .cse3) (and .cse47 .cse54 .cse1 .cse13) (and .cse54 .cse1 .cse2)))) (or (and .cse1 .cse2 .cse40 .cse56) (and .cse36 .cse1 .cse41 .cse56) (and .cse36 .cse1 .cse40 .cse56)))) (.cse8 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse50 (- 3))) .cse55)) (.cse12 (or (< .cse30 (+ .cse50 (- 4))) .cse55)) (.cse7 (let ((.cse53 (or (and .cse54 .cse36 .cse38 .cse41) (and .cse54 .cse38 .cse2 .cse40) (and .cse54 .cse36 .cse38 .cse40) (and .cse54 .cse42 .cse38) (and .cse54 .cse44 .cse38)))) (or (and .cse16 .cse53 .cse17 .cse18 .cse28 .cse29 .cse21) (and .cse16 .cse53 .cse17 .cse18 .cse19 .cse21) (and .cse16 .cse53 .cse17 .cse18 .cse21)))) (.cse24 (<= |ULTIMATE.start_main_~r~0#1| (+ (- 2) .cse52))) (.cse11 (<= (+ (* .cse51 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse9 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse0 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse52))) (.cse6 (<= (+ 2 (* .cse51 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse32 (< .cse30 .cse50)) (.cse15 (let ((.cse33 (<= .cse49 |ULTIMATE.start_main_~j~0#1|)) (.cse34 (let ((.cse37 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse43 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse49))) (.cse39 (or .cse45 .cse46 (and .cse2 .cse22) (and .cse2 .cse3 .cse22) (and .cse47 .cse22 .cse13) .cse48))) (or (and .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse36 .cse37 .cse38 .cse41 .cse39) (and .cse37 .cse42 .cse38 .cse39) (and .cse36 .cse37 .cse43 .cse38 .cse39 .cse40) (and .cse44 .cse37 .cse43 .cse38 .cse39) (and .cse36 .cse37 .cse43 .cse38 .cse41 .cse39) (and .cse37 .cse43 .cse38 .cse2 .cse39 .cse40)))) (.cse35 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse16 .cse33 .cse34 .cse17 .cse35) (and .cse16 .cse33 .cse34 .cse17 .cse28 .cse29 .cse35))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse7) (and .cse8 .cse0 .cse12 .cse1 .cse2 .cse6 .cse7) (and .cse10 .cse14 .cse12 .cse4 .cse7) (and .cse10 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse8 .cse10 .cse14 .cse12 .cse7) (and .cse16 .cse17 .cse18 .cse20 .cse21) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse6 .cse7) (and .cse10 .cse2 .cse6 .cse15) (and .cse8 .cse9 .cse0 .cse11 .cse12 .cse1 .cse13 .cse7) (and .cse8 .cse9 .cse0 .cse12 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse16 .cse0 .cse17 .cse1 .cse18 .cse22) (and .cse9 .cse0 .cse11 .cse12 .cse1 .cse15 .cse13) (and .cse8 .cse9 .cse0 .cse11 .cse1 .cse5 .cse13 .cse7) (and .cse8 .cse9 .cse10 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse9 .cse10 .cse2 .cse3 .cse6 .cse15) (and .cse16 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse16 .cse17 .cse18 .cse28 .cse20 .cse29 .cse21) (and .cse9 .cse0 .cse11 .cse1 .cse15 .cse13) (and .cse9 .cse10 .cse11 .cse15 .cse13) (and .cse10 .cse14 (< .cse30 (* 2 |ULTIMATE.start_main_~j~0#1|)) .cse15) (and .cse8 .cse9 .cse10 .cse14 .cse12 .cse7) (and .cse16 .cse23 .cse24 .cse25 .cse26 (<= |ULTIMATE.start_main_~r~0#1| .cse31) .cse27) (and .cse9 .cse10 .cse11 .cse32 .cse15 .cse13) (and .cse9 .cse10 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse15) (and .cse10 .cse2 .cse6 .cse32 .cse15)))))))))))) [2023-02-18 00:18:49,608 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-02-18 00:18:49,609 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse56 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse55 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse15 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse68 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse71 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse36 (<= .cse56 |ULTIMATE.start_main_~r~0#1|)) (.cse62 (<= .cse56 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse24 (<= 0 .cse71)) (.cse35 (<= |ULTIMATE.start_main_~l~0#1| .cse68)) (.cse25 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse39 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse63 (<= .cse71 0)) (.cse40 (<= .cse56 |ULTIMATE.start_main_~n~0#1|)) (.cse41 (let ((.cse70 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse70 (and .cse7 (not .cse70))))) (.cse43 (let ((.cse69 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse69) .cse15) .cse69))) (.cse44 (<= .cse54 .cse55))) (let ((.cse20 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse58 (or (and .cse62 .cse24 .cse35 .cse25 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse24 .cse35 .cse25 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44))) (.cse57 (or (and .cse35 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse35 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse35 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse35 .cse63 .cse40 .cse41 .cse43 .cse44))) (.cse53 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse50 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse65 (or (and .cse24 .cse35 .cse36 .cse25 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse36 .cse25 .cse39 .cse40 .cse41 .cse43 .cse44))) (.cse38 (<= .cse56 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse64 (or (and .cse35 .cse36 .cse39 .cse40 .cse41 .cse43 .cse44) (and .cse35 .cse36 .cse40 .cse41 .cse43 .cse44))) (.cse42 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (let ((.cse48 (or (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse65 .cse42) (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse64 .cse42))) (.cse61 (not .cse50)) (.cse60 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse52 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse14 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse19 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse53))) (.cse21 (or (and .cse58 .cse24 .cse35 .cse25 .cse7 .cse38 .cse42) (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse38 .cse42))) (.cse23 (< (- 1) .cse56)) (.cse18 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse59 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse67 (or (and .cse62 .cse35 .cse39 .cse63 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse35 .cse39 .cse63 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse37 (<= |ULTIMATE.start_main_~i~0#1| .cse68)) (.cse66 (or (and .cse24 .cse35 .cse25 .cse39 .cse63 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse62 .cse24 .cse35 .cse25 .cse39 .cse63 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse45 (<= |ULTIMATE.start_main_~j~0#1| .cse68))) (let ((.cse29 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse67 .cse38 .cse20 .cse45) (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse66 .cse45))) (.cse32 (< .cse59 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse51 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse66 .cse42) (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse67 .cse38 .cse20 .cse42))) (.cse30 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse64 .cse42) (and .cse24 .cse35 .cse36 .cse25 .cse7 .cse37 .cse38 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse34 (or (and .cse14 .cse15 .cse16 .cse21 .cse23 .cse20) (and .cse14 .cse15 .cse21 .cse23 .cse20) (and .cse14 .cse15 .cse16 .cse21 .cse23 .cse19) (and .cse14 .cse15 .cse21 .cse23 .cse19) (and .cse15 .cse16 .cse21 .cse23 .cse18 .cse20))) (.cse6 (<= (+ (* .cse52 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse12 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse33 (< .cse59 .cse60)) (.cse46 (or (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse64 .cse45) (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse65 .cse45))) (.cse31 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse47 (or (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse37 .cse38 .cse20 .cse42) (and .cse24 (or (and .cse62 .cse24 .cse35 .cse25 .cse63 .cse20 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse63 .cse20 .cse40 .cse41 .cse43 .cse44)) .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse42))) (.cse0 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse60 (- 3))) .cse61)) (.cse26 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse8 (or (< .cse59 (+ .cse60 (- 4))) .cse61)) (.cse17 (or (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse38 .cse45) (and .cse58 .cse24 .cse35 .cse25 .cse7 .cse38 .cse45))) (.cse4 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse56))) (.cse9 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| .cse56)) (.cse49 (<= |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse1 (<= .cse54 (+ 2 .cse55))) (.cse2 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse3 (<= .cse53 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (or (and .cse14 .cse15 .cse16 .cse23 .cse19 .cse48) (and .cse15 .cse16 .cse23 .cse18 .cse48 .cse20) (and .cse14 .cse15 .cse16 .cse23 .cse48 .cse20) (and .cse14 .cse15 .cse23 .cse48 .cse20) (and .cse14 .cse15 .cse23 .cse19 .cse48))) (.cse22 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= .cse53 |ULTIMATE.start_main_~n~0#1|)) (.cse28 (<= (+ 2 (* .cse52 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 (or (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19) (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse20)) .cse3 .cse7 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse7 .cse10 (or (and .cse14 .cse15 .cse16 .cse9 .cse21 .cse18 .cse22 .cse19) (and .cse14 .cse15 .cse16 .cse9 .cse21 .cse18 .cse22 .cse20)) .cse11 .cse13) (and (or (and .cse14 .cse15 .cse16 .cse17 .cse23 .cse20) (and .cse15 .cse16 .cse17 .cse23 .cse18 .cse20) (and .cse14 .cse15 .cse16 .cse17 .cse23 .cse19)) .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse7 .cse8 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse26 .cse15 .cse7 .cse8 .cse16 .cse9 .cse23 .cse18 .cse10 .cse27 .cse28 .cse29 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse32 .cse33 .cse11 .cse13) (and .cse1 .cse34 .cse2 .cse3 .cse24 .cse25 .cse7 .cse8 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse15 .cse7 .cse16 .cse9 .cse18 .cse10 .cse20 .cse29 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse16 .cse23 .cse10 .cse46 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse15 .cse7 .cse8 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse47 .cse13) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse24 .cse7 .cse8 .cse18 .cse22 .cse10 .cse28 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse23 .cse10 .cse27 .cse29 .cse11 .cse13) (and (or (and .cse14 .cse15 .cse16 .cse9 .cse18 .cse22 .cse19 .cse48) (and .cse14 .cse15 .cse16 .cse9 .cse18 .cse22 .cse48 .cse20)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse23 .cse10 .cse27 .cse32 .cse38 .cse39 .cse20 .cse33 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse27 .cse49 .cse11 .cse12 .cse13 .cse50) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse18 .cse22 .cse10 .cse27 .cse49 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse9 .cse23 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse30 .cse1 .cse3 .cse4 .cse15 .cse7 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse4 .cse15 .cse7 .cse8 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse37 .cse9 .cse23 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse7 .cse10 (or (and .cse14 .cse15 .cse9 .cse21 .cse18 .cse20) (and .cse14 .cse15 .cse9 .cse21 .cse18 .cse19)) .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse23 .cse10 .cse27 .cse38 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse4 .cse15 .cse7 .cse16 .cse9 .cse23 .cse18 .cse22 .cse10 .cse27 .cse49 .cse28 .cse20 .cse11 .cse13 .cse51) (and .cse1 .cse3 .cse15 .cse7 .cse16 .cse9 .cse18 .cse22 .cse10 .cse20 .cse11 .cse13 .cse51) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse48 .cse11 .cse13) (and .cse1 .cse3 .cse14 .cse15 .cse7 .cse9 .cse18 .cse10 .cse20 .cse11 .cse47 .cse13) (and .cse30 .cse1 .cse3 .cse4 .cse14 .cse15 .cse7 .cse9 .cse18 .cse10 .cse28 .cse20 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse34 .cse2 .cse3 .cse6 .cse7 .cse10 .cse27 .cse49 .cse11 .cse12 .cse13 .cse50) (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse18 .cse22 .cse10 .cse28 .cse33 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse7 .cse10 (or (and .cse15 .cse16 .cse23 .cse18 .cse20 .cse46) (and .cse14 .cse15 .cse16 .cse23 .cse20 .cse46) (and .cse14 .cse15 .cse16 .cse23 .cse19 .cse46)) .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse15 .cse7 .cse8 .cse21 .cse31 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse8 .cse31 .cse23 .cse10 .cse11 .cse47 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse17 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse23 .cse18 .cse22 .cse10 .cse27 .cse49 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44) (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse18 .cse22 .cse10 .cse28 .cse11 .cse13)))))))) [2023-02-18 00:18:49,611 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-02-18 00:18:49,611 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2023-02-18 00:18:49,612 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (let ((.cse56 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse54 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse55 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse15 (<= 0 (+ (- 2) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse68 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse71 (+ (- 1) |ULTIMATE.start_main_~l~0#1|))) (let ((.cse36 (<= .cse56 |ULTIMATE.start_main_~r~0#1|)) (.cse62 (<= .cse56 (+ 2 |ULTIMATE.start_main_~r~0#1|))) (.cse24 (<= 0 .cse71)) (.cse35 (<= |ULTIMATE.start_main_~l~0#1| .cse68)) (.cse25 (<= 0 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))) (.cse39 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse63 (<= .cse71 0)) (.cse40 (<= .cse56 |ULTIMATE.start_main_~n~0#1|)) (.cse41 (let ((.cse70 (<= (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))) (or .cse70 (and .cse7 (not .cse70))))) (.cse43 (let ((.cse69 (<= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) 1) 0))) (or (and (not .cse69) .cse15) .cse69))) (.cse44 (<= .cse54 .cse55))) (let ((.cse20 (<= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (.cse58 (or (and .cse62 .cse24 .cse35 .cse25 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse24 .cse35 .cse25 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44))) (.cse57 (or (and .cse35 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse35 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse35 .cse39 .cse63 .cse40 .cse41 .cse43 .cse44) (and .cse62 .cse35 .cse63 .cse40 .cse41 .cse43 .cse44))) (.cse53 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse50 (> |ULTIMATE.start_main_~l~0#1| 1)) (.cse65 (or (and .cse24 .cse35 .cse36 .cse25 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse36 .cse25 .cse39 .cse40 .cse41 .cse43 .cse44))) (.cse38 (<= .cse56 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse64 (or (and .cse35 .cse36 .cse39 .cse40 .cse41 .cse43 .cse44) (and .cse35 .cse36 .cse40 .cse41 .cse43 .cse44))) (.cse42 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (let ((.cse48 (or (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse65 .cse42) (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse64 .cse42))) (.cse61 (not .cse50)) (.cse60 (* |ULTIMATE.start_main_~l~0#1| 4)) (.cse52 (div (+ (- 3) |ULTIMATE.start_main_~r~0#1|) 2)) (.cse14 (<= 2 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) (.cse19 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~j~0#1| (+ (- 2) |ULTIMATE.start_main_~r~0#1| .cse53))) (.cse21 (or (and .cse58 .cse24 .cse35 .cse25 .cse7 .cse38 .cse42) (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse38 .cse42))) (.cse23 (< (- 1) .cse56)) (.cse18 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse59 (+ (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse67 (or (and .cse62 .cse35 .cse39 .cse63 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse35 .cse39 .cse63 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse37 (<= |ULTIMATE.start_main_~i~0#1| .cse68)) (.cse66 (or (and .cse24 .cse35 .cse25 .cse39 .cse63 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse62 .cse24 .cse35 .cse25 .cse39 .cse63 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse45 (<= |ULTIMATE.start_main_~j~0#1| .cse68))) (let ((.cse29 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse67 .cse38 .cse20 .cse45) (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse66 .cse45))) (.cse32 (< .cse59 (* 2 |ULTIMATE.start_main_~j~0#1|))) (.cse51 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse66 .cse42) (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse67 .cse38 .cse20 .cse42))) (.cse30 (or (and .cse24 .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse64 .cse42) (and .cse24 .cse35 .cse36 .cse25 .cse7 .cse37 .cse38 .cse20 .cse40 .cse41 .cse42 .cse43 .cse44))) (.cse34 (or (and .cse14 .cse15 .cse16 .cse21 .cse23 .cse20) (and .cse14 .cse15 .cse21 .cse23 .cse20) (and .cse14 .cse15 .cse16 .cse21 .cse23 .cse19) (and .cse14 .cse15 .cse21 .cse23 .cse19) (and .cse15 .cse16 .cse21 .cse23 .cse18 .cse20))) (.cse6 (<= (+ (* .cse52 4) 4) |ULTIMATE.start_main_~j~0#1|)) (.cse12 (<= 4 |ULTIMATE.start_main_~j~0#1|)) (.cse33 (< .cse59 .cse60)) (.cse46 (or (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse64 .cse45) (and .cse24 .cse35 .cse25 .cse7 .cse38 .cse65 .cse45))) (.cse31 (< 0 |ULTIMATE.start_main_~j~0#1|)) (.cse47 (or (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse37 .cse38 .cse20 .cse42) (and .cse24 (or (and .cse62 .cse24 .cse35 .cse25 .cse63 .cse20 .cse40 .cse41 .cse43 .cse44) (and .cse24 .cse35 .cse25 .cse63 .cse20 .cse40 .cse41 .cse43 .cse44)) .cse35 .cse25 .cse7 .cse37 .cse38 .cse20 .cse42))) (.cse0 (or (< |ULTIMATE.start_main_~j~0#1| (+ .cse60 (- 3))) .cse61)) (.cse26 (< 0 (+ |ULTIMATE.start_main_~j~0#1| 1))) (.cse8 (or (< .cse59 (+ .cse60 (- 4))) .cse61)) (.cse17 (or (and .cse24 .cse35 .cse25 .cse57 .cse7 .cse38 .cse45) (and .cse58 .cse24 .cse35 .cse25 .cse7 .cse38 .cse45))) (.cse4 (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse56))) (.cse9 (<= 2 (+ |ULTIMATE.start_main_~l~0#1| 1))) (.cse27 (<= |ULTIMATE.start_main_~j~0#1| .cse56)) (.cse49 (<= |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse1 (<= .cse54 (+ 2 .cse55))) (.cse2 (<= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|))) (.cse3 (<= .cse53 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (or (and .cse14 .cse15 .cse16 .cse23 .cse19 .cse48) (and .cse15 .cse16 .cse23 .cse18 .cse48 .cse20) (and .cse14 .cse15 .cse16 .cse23 .cse48 .cse20) (and .cse14 .cse15 .cse23 .cse48 .cse20) (and .cse14 .cse15 .cse23 .cse19 .cse48))) (.cse22 (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|))) (.cse10 (<= .cse53 |ULTIMATE.start_main_~n~0#1|)) (.cse28 (<= (+ 2 (* .cse52 2)) |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= 2 |ULTIMATE.start_main_~n~0#1|)) (.cse13 (> |ULTIMATE.start_main_~r~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 (or (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19) (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse20)) .cse3 .cse7 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse7 .cse10 (or (and .cse14 .cse15 .cse16 .cse9 .cse21 .cse18 .cse22 .cse19) (and .cse14 .cse15 .cse16 .cse9 .cse21 .cse18 .cse22 .cse20)) .cse11 .cse13) (and (or (and .cse14 .cse15 .cse16 .cse17 .cse23 .cse20) (and .cse15 .cse16 .cse17 .cse23 .cse18 .cse20) (and .cse14 .cse15 .cse16 .cse17 .cse23 .cse19)) .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse7 .cse8 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse26 .cse15 .cse7 .cse8 .cse16 .cse9 .cse23 .cse18 .cse10 .cse27 .cse28 .cse29 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse32 .cse33 .cse11 .cse13) (and .cse1 .cse34 .cse2 .cse3 .cse24 .cse25 .cse7 .cse8 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse15 .cse7 .cse16 .cse9 .cse18 .cse10 .cse20 .cse29 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse16 .cse23 .cse10 .cse46 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse15 .cse7 .cse8 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse47 .cse13) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse24 .cse7 .cse8 .cse18 .cse22 .cse10 .cse28 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse23 .cse10 .cse27 .cse29 .cse11 .cse13) (and (or (and .cse14 .cse15 .cse16 .cse9 .cse18 .cse22 .cse19 .cse48) (and .cse14 .cse15 .cse16 .cse9 .cse18 .cse22 .cse48 .cse20)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse23 .cse10 .cse27 .cse32 .cse38 .cse39 .cse20 .cse33 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse27 .cse49 .cse11 .cse12 .cse13 .cse50) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse18 .cse22 .cse10 .cse27 .cse49 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse9 .cse23 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse30 .cse1 .cse3 .cse4 .cse15 .cse7 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse4 .cse15 .cse7 .cse8 .cse9 .cse31 .cse23 .cse18 .cse10 .cse28 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse37 .cse9 .cse23 .cse18 .cse10 .cse27 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse7 .cse10 (or (and .cse14 .cse15 .cse9 .cse21 .cse18 .cse20) (and .cse14 .cse15 .cse9 .cse21 .cse18 .cse19)) .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse35 .cse36 .cse25 .cse26 .cse15 .cse7 .cse16 .cse37 .cse23 .cse10 .cse27 .cse38 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44 .cse45) (and .cse1 .cse3 .cse4 .cse15 .cse7 .cse16 .cse9 .cse23 .cse18 .cse22 .cse10 .cse27 .cse49 .cse28 .cse20 .cse11 .cse13 .cse51) (and .cse1 .cse3 .cse15 .cse7 .cse16 .cse9 .cse18 .cse22 .cse10 .cse20 .cse11 .cse13 .cse51) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse48 .cse11 .cse13) (and .cse1 .cse3 .cse14 .cse15 .cse7 .cse9 .cse18 .cse10 .cse20 .cse11 .cse47 .cse13) (and .cse30 .cse1 .cse3 .cse4 .cse14 .cse15 .cse7 .cse9 .cse18 .cse10 .cse28 .cse20 .cse11 .cse13) (and .cse30 .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse31 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse34 .cse2 .cse3 .cse6 .cse7 .cse10 .cse27 .cse49 .cse11 .cse12 .cse13 .cse50) (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse18 .cse22 .cse10 .cse28 .cse33 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse7 .cse10 (or (and .cse15 .cse16 .cse23 .cse18 .cse20 .cse46) (and .cse14 .cse15 .cse16 .cse23 .cse20 .cse46) (and .cse14 .cse15 .cse16 .cse23 .cse19 .cse46)) .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse15 .cse7 .cse8 .cse21 .cse31 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse25 .cse15 .cse7 .cse8 .cse31 .cse23 .cse10 .cse11 .cse47 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse15 .cse7 .cse8 .cse16 .cse17 .cse23 .cse10 .cse11 .cse13) (and .cse1 .cse3 .cse24 .cse4 .cse35 .cse36 .cse25 .cse15 .cse7 .cse16 .cse37 .cse9 .cse23 .cse18 .cse22 .cse10 .cse27 .cse49 .cse38 .cse28 .cse39 .cse20 .cse11 .cse40 .cse41 .cse13 .cse42 .cse43 .cse44) (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse7 .cse18 .cse22 .cse10 .cse28 .cse11 .cse13)))))))) [2023-02-18 00:18:49,612 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2023-02-18 00:18:49,612 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-02-18 00:18:49,612 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-02-18 00:18:49,612 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-02-18 00:18:49,613 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-02-18 00:18:49,613 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-02-18 00:18:49,613 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-02-18 00:18:49,616 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:18:49,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 00:18:59,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 12:18:59 BoogieIcfgContainer [2023-02-18 00:18:59,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 00:18:59,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 00:18:59,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 00:18:59,397 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 00:18:59,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:18:38" (3/4) ... [2023-02-18 00:18:59,400 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 00:18:59,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 00:18:59,409 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 00:18:59,409 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 00:18:59,409 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 00:18:59,409 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 00:18:59,410 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 00:19:01,041 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 00:19:01,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 00:19:01,042 INFO L158 Benchmark]: Toolchain (without parser) took 22844.91ms. Allocated memory was 142.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 96.7MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 4.0GB. Max. memory is 16.1GB. [2023-02-18 00:19:01,042 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:19:01,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.65ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 85.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 00:19:01,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.83ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:19:01,043 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:19:01,043 INFO L158 Benchmark]: RCFGBuilder took 344.85ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 71.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 00:19:01,043 INFO L158 Benchmark]: TraceAbstraction took 20562.70ms. Allocated memory was 142.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 70.8MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2023-02-18 00:19:01,044 INFO L158 Benchmark]: Witness Printer took 1644.40ms. Allocated memory is still 10.8GB. Free memory was 7.7GB in the beginning and 6.8GB in the end (delta: 898.1MB). Peak memory consumption was 899.7MB. Max. memory is 16.1GB. [2023-02-18 00:19:01,045 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.20ms. Allocated memory is still 142.6MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.65ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 85.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.83ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.85ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 71.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20562.70ms. Allocated memory was 142.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 70.8MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Witness Printer took 1644.40ms. Allocated memory is still 10.8GB. Free memory was 7.7GB in the beginning and 6.8GB in the end (delta: 898.1MB). Peak memory consumption was 899.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1480 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 4521 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3159 mSDsCounter, 2394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6233 IncrementalHoareTripleChecker+Invalid, 8627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2394 mSolverCounterUnsat, 1362 mSDtfsCounter, 6233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 831 SyntacticMatches, 1 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=17, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 813 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 684 PreInvPairs, 1094 NumberOfFragments, 107265940 HoareAnnotationTreeSize, 684 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1313 ConstructedInterpolants, 0 QuantifiedInterpolants, 3495 SizeOfPredicates, 19 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 4823/4899 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant