./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/cohencu-ll.c --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/nla-digbench/cohencu-ll.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf57d72e341b105161cbeacf29e58db93d2b67f8e0e097e4dbed74551cbdcfff --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:59:01,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:59:01,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:59:01,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:59:01,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:59:01,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:59:01,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:59:01,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:59:01,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:59:01,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:59:01,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:59:01,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:59:01,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:59:01,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:59:01,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:59:01,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:59:01,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:59:01,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:59:01,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:59:01,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:59:01,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:59:01,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:59:01,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:59:01,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:59:01,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:59:01,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:59:01,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:59:01,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:59:01,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:59:01,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:59:01,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:59:01,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:59:01,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:59:01,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:59:01,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:59:01,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:59:01,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:59:01,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:59:01,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:59:01,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:59:01,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:59:01,110 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:59:01,132 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:59:01,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:59:01,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:59:01,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:59:01,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:59:01,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:59:01,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:59:01,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:59:01,134 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:59:01,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:59:01,135 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:59:01,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:59:01,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:59:01,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:59:01,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:59:01,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:59:01,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:59:01,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:59:01,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:59:01,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:59:01,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:59:01,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:59:01,138 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:59:01,139 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 -> bf57d72e341b105161cbeacf29e58db93d2b67f8e0e097e4dbed74551cbdcfff [2023-02-18 00:59:01,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:59:01,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:59:01,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:59:01,349 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:59:01,349 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:59:01,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/cohencu-ll.c [2023-02-18 00:59:02,413 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:59:02,520 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:59:02,521 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu-ll.c [2023-02-18 00:59:02,526 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d1b60f5/6d8bacc2c8964eefa5b2a2e9c25d07b6/FLAGf7f9dfd65 [2023-02-18 00:59:02,539 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d1b60f5/6d8bacc2c8964eefa5b2a2e9c25d07b6 [2023-02-18 00:59:02,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:59:02,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:59:02,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:59:02,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:59:02,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:59:02,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cf8719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02, skipping insertion in model container [2023-02-18 00:59:02,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:59:02,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:59:02,654 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/nla-digbench/cohencu-ll.c[588,601] [2023-02-18 00:59:02,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:59:02,681 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:59:02,689 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/nla-digbench/cohencu-ll.c[588,601] [2023-02-18 00:59:02,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:59:02,709 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:59:02,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02 WrapperNode [2023-02-18 00:59:02,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:59:02,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:59:02,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:59:02,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:59:02,720 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:59:02" (1/1) ... [2023-02-18 00:59:02,728 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:59:02" (1/1) ... [2023-02-18 00:59:02,739 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-02-18 00:59:02,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:59:02,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:59:02,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:59:02,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:59:02,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,751 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:59:02,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:59:02,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:59:02,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:59:02,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (1/1) ... [2023-02-18 00:59:02,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:59:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:02,794 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:59:02,796 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:59:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:59:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:59:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:59:02,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:59:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 00:59:02,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 00:59:02,903 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:59:02,905 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:59:03,020 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:59:03,024 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:59:03,024 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 00:59:03,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:59:03 BoogieIcfgContainer [2023-02-18 00:59:03,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:59:03,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:59:03,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:59:03,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:59:03,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:59:02" (1/3) ... [2023-02-18 00:59:03,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e3c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:59:03, skipping insertion in model container [2023-02-18 00:59:03,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:59:02" (2/3) ... [2023-02-18 00:59:03,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e3c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:59:03, skipping insertion in model container [2023-02-18 00:59:03,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:59:03" (3/3) ... [2023-02-18 00:59:03,053 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2023-02-18 00:59:03,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:59:03,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:59:03,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:59:03,150 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;@2d4df2b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:59:03,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:59:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 00:59:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 00:59:03,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:03,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:03,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1823012769, now seen corresponding path program 1 times [2023-02-18 00:59:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:03,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075674006] [2023-02-18 00:59:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:03,299 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:59:03,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:03,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075674006] [2023-02-18 00:59:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075674006] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:59:03,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:59:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 00:59:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107023026] [2023-02-18 00:59:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:59:03,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 00:59:03,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 00:59:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 00:59:03,328 INFO L87 Difference]: Start difference. First operand has 25 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:59:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:03,345 INFO L93 Difference]: Finished difference Result 48 states and 85 transitions. [2023-02-18 00:59:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 00:59:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2023-02-18 00:59:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:03,354 INFO L225 Difference]: With dead ends: 48 [2023-02-18 00:59:03,354 INFO L226 Difference]: Without dead ends: 21 [2023-02-18 00:59:03,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 00:59:03,358 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:03,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:59:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-18 00:59:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-18 00:59:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 00:59:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2023-02-18 00:59:03,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2023-02-18 00:59:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:03,387 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2023-02-18 00:59:03,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:59:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2023-02-18 00:59:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 00:59:03,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:03,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:03,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:59:03,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:03,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1811632607, now seen corresponding path program 1 times [2023-02-18 00:59:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:03,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001612336] [2023-02-18 00:59:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:03,554 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:59:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:03,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001612336] [2023-02-18 00:59:03,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001612336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:59:03,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:59:03,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:59:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690037874] [2023-02-18 00:59:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:59:03,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:59:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:59:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:59:03,557 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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:59:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:03,683 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2023-02-18 00:59:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:59:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2023-02-18 00:59:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:03,684 INFO L225 Difference]: With dead ends: 27 [2023-02-18 00:59:03,684 INFO L226 Difference]: Without dead ends: 25 [2023-02-18 00:59:03,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:59:03,685 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:03,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:59:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-18 00:59:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-18 00:59:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 00:59:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-02-18 00:59:03,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2023-02-18 00:59:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:03,701 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-02-18 00:59:03,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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:59:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-02-18 00:59:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 00:59:03,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:03,702 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:03,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 00:59:03,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1582559355, now seen corresponding path program 1 times [2023-02-18 00:59:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:03,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779038342] [2023-02-18 00:59:03,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:03,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:03,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948628310] [2023-02-18 00:59:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:03,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:03,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:03,743 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:59:03,760 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:59:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:03,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 00:59:03,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:59:03,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:59:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779038342] [2023-02-18 00:59:03,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948628310] [2023-02-18 00:59:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948628310] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:03,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:03,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 00:59:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781541787] [2023-02-18 00:59:03,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:03,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 00:59:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 00:59:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 00:59:03,945 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 00:59:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:04,260 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2023-02-18 00:59:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 00:59:04,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 12 [2023-02-18 00:59:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:04,262 INFO L225 Difference]: With dead ends: 50 [2023-02-18 00:59:04,262 INFO L226 Difference]: Without dead ends: 48 [2023-02-18 00:59:04,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:59:04,263 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:04,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 45 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 00:59:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-18 00:59:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-02-18 00:59:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 00:59:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-02-18 00:59:04,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 12 [2023-02-18 00:59:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:04,278 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-02-18 00:59:04,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 00:59:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-02-18 00:59:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 00:59:04,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:04,279 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:04,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 00:59:04,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:04,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 424345951, now seen corresponding path program 1 times [2023-02-18 00:59:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:04,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607173486] [2023-02-18 00:59:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:04,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:04,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511596307] [2023-02-18 00:59:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:04,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:04,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:04,508 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:59:04,511 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:59:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:04,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 00:59:04,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 00:59:04,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 00:59:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607173486] [2023-02-18 00:59:04,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511596307] [2023-02-18 00:59:04,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511596307] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:04,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:04,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 00:59:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539758984] [2023-02-18 00:59:04,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:04,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 00:59:04,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 00:59:04,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 00:59:04,667 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 00:59:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:04,864 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2023-02-18 00:59:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:59:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-02-18 00:59:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:04,865 INFO L225 Difference]: With dead ends: 52 [2023-02-18 00:59:04,865 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 00:59:04,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:59:04,866 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:04,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:59:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 00:59:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-02-18 00:59:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 00:59:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-02-18 00:59:04,878 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 17 [2023-02-18 00:59:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:04,879 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-02-18 00:59:04,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 00:59:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-02-18 00:59:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 00:59:04,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:04,880 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:04,900 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:59:05,084 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,SelfDestructingSolverStorable3 [2023-02-18 00:59:05,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1752711045, now seen corresponding path program 1 times [2023-02-18 00:59:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:05,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348757767] [2023-02-18 00:59:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:05,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:05,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874376140] [2023-02-18 00:59:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:05,114 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:59:05,115 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:59:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:05,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 00:59:05,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 00:59:05,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 00:59:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:05,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348757767] [2023-02-18 00:59:05,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874376140] [2023-02-18 00:59:05,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874376140] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:05,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:05,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 00:59:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314229574] [2023-02-18 00:59:05,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:05,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 00:59:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:05,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 00:59:05,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 00:59:05,302 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 00:59:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:05,826 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-18 00:59:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:59:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2023-02-18 00:59:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:05,827 INFO L225 Difference]: With dead ends: 65 [2023-02-18 00:59:05,828 INFO L226 Difference]: Without dead ends: 56 [2023-02-18 00:59:05,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:59:05,828 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:05,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 00:59:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-18 00:59:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-18 00:59:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 00:59:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-02-18 00:59:05,840 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2023-02-18 00:59:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:05,840 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-02-18 00:59:05,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 00:59:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-02-18 00:59:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 00:59:05,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:05,841 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:05,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 00:59:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:06,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 190158181, now seen corresponding path program 1 times [2023-02-18 00:59:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437404154] [2023-02-18 00:59:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:06,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:06,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506645909] [2023-02-18 00:59:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:06,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:06,055 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:59:06,089 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:59:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:06,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 00:59:06,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 00:59:06,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 00:59:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:06,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437404154] [2023-02-18 00:59:06,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506645909] [2023-02-18 00:59:06,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506645909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:06,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:06,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 00:59:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422043768] [2023-02-18 00:59:06,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:06,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 00:59:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 00:59:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:59:06,182 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 00:59:08,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:08,832 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2023-02-18 00:59:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 00:59:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 44 [2023-02-18 00:59:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:08,833 INFO L225 Difference]: With dead ends: 80 [2023-02-18 00:59:08,833 INFO L226 Difference]: Without dead ends: 78 [2023-02-18 00:59:08,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-18 00:59:08,834 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:08,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 52 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 277 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-02-18 00:59:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-18 00:59:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-02-18 00:59:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.075) internal successors, (43), 43 states have internal predecessors, (43), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 00:59:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-02-18 00:59:08,849 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 44 [2023-02-18 00:59:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:08,849 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-02-18 00:59:08,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 00:59:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-02-18 00:59:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 00:59:08,850 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:08,850 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:08,868 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:59:09,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:09,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1122712219, now seen corresponding path program 2 times [2023-02-18 00:59:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757544362] [2023-02-18 00:59:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:09,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:09,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334513444] [2023-02-18 00:59:09,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:59:09,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:09,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:09,064 INFO L229 MonitoredProcess]: Starting monitored process 6 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:59:09,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 00:59:09,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:59:09,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:59:09,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 00:59:09,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 00:59:09,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 00:59:09,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:09,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757544362] [2023-02-18 00:59:09,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:09,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334513444] [2023-02-18 00:59:09,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334513444] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:09,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:09,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2023-02-18 00:59:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328786823] [2023-02-18 00:59:09,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:09,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 00:59:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:09,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 00:59:09,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:59:09,208 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 00:59:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:09,774 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2023-02-18 00:59:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 00:59:09,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 54 [2023-02-18 00:59:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:09,776 INFO L225 Difference]: With dead ends: 84 [2023-02-18 00:59:09,776 INFO L226 Difference]: Without dead ends: 79 [2023-02-18 00:59:09,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-18 00:59:09,776 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:09,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 00:59:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-18 00:59:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-18 00:59:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 00:59:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2023-02-18 00:59:09,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 54 [2023-02-18 00:59:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:09,795 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2023-02-18 00:59:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 00:59:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2023-02-18 00:59:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 00:59:09,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:09,800 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 00:59:10,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:10,005 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1898506858, now seen corresponding path program 1 times [2023-02-18 00:59:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:10,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503025007] [2023-02-18 00:59:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:10,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:10,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951526312] [2023-02-18 00:59:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:10,031 INFO L229 MonitoredProcess]: Starting monitored process 7 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:59:10,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 00:59:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:10,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 00:59:10,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 00:59:10,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 00:59:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:10,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503025007] [2023-02-18 00:59:10,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:10,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951526312] [2023-02-18 00:59:10,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951526312] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:10,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:10,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 00:59:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051134176] [2023-02-18 00:59:10,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:10,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 00:59:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 00:59:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 00:59:10,423 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 00:59:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:10,854 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-02-18 00:59:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 00:59:10,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 65 [2023-02-18 00:59:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:10,855 INFO L225 Difference]: With dead ends: 85 [2023-02-18 00:59:10,855 INFO L226 Difference]: Without dead ends: 83 [2023-02-18 00:59:10,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-02-18 00:59:10,856 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:10,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 65 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 00:59:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-18 00:59:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-18 00:59:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.065217391304348) internal successors, (49), 49 states have internal predecessors, (49), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 00:59:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-02-18 00:59:10,876 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 65 [2023-02-18 00:59:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:10,877 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-02-18 00:59:10,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 00:59:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-02-18 00:59:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-18 00:59:10,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:10,878 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:10,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 00:59:11,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:11,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 161977518, now seen corresponding path program 1 times [2023-02-18 00:59:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:11,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616046111] [2023-02-18 00:59:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:11,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:11,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267205877] [2023-02-18 00:59:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:11,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:11,098 INFO L229 MonitoredProcess]: Starting monitored process 8 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:59:11,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 00:59:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:11,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 00:59:11,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-18 00:59:11,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-18 00:59:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:11,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616046111] [2023-02-18 00:59:11,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:11,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267205877] [2023-02-18 00:59:11,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267205877] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:11,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:11,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 00:59:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831726098] [2023-02-18 00:59:11,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:11,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 00:59:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:11,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 00:59:11,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-18 00:59:11,415 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 00:59:13,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:13,847 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2023-02-18 00:59:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 00:59:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 70 [2023-02-18 00:59:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:13,848 INFO L225 Difference]: With dead ends: 119 [2023-02-18 00:59:13,848 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 00:59:13,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2023-02-18 00:59:13,849 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:13,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 66 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-18 00:59:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 00:59:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-18 00:59:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 63 states have internal predecessors, (65), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-18 00:59:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2023-02-18 00:59:13,880 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 70 [2023-02-18 00:59:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:13,880 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2023-02-18 00:59:13,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 00:59:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2023-02-18 00:59:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-18 00:59:13,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:13,884 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-18 00:59:13,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 00:59:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:14,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1175438523, now seen corresponding path program 3 times [2023-02-18 00:59:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156226067] [2023-02-18 00:59:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:14,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:14,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417057317] [2023-02-18 00:59:14,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 00:59:14,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:14,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:14,106 INFO L229 MonitoredProcess]: Starting monitored process 9 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:59:14,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 00:59:14,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 00:59:14,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:59:14,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 00:59:14,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 00:59:14,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 00:59:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:14,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156226067] [2023-02-18 00:59:14,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:14,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417057317] [2023-02-18 00:59:14,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417057317] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:14,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:14,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 00:59:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094193718] [2023-02-18 00:59:14,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:14,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 00:59:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:14,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 00:59:14,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 00:59:14,413 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 00:59:17,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:17,983 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2023-02-18 00:59:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 00:59:17,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 76 [2023-02-18 00:59:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:17,993 INFO L225 Difference]: With dead ends: 132 [2023-02-18 00:59:17,993 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 00:59:17,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-18 00:59:17,994 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:17,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 63 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 334 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-02-18 00:59:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 00:59:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-18 00:59:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-18 00:59:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2023-02-18 00:59:18,030 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 76 [2023-02-18 00:59:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:18,030 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2023-02-18 00:59:18,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 00:59:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2023-02-18 00:59:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-02-18 00:59:18,036 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:18,036 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:18,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 00:59:18,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 00:59:18,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:18,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1712175254, now seen corresponding path program 1 times [2023-02-18 00:59:18,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:18,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800568348] [2023-02-18 00:59:18,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:18,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:18,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:18,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469970515] [2023-02-18 00:59:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:18,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:18,258 INFO L229 MonitoredProcess]: Starting monitored process 10 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:59:18,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 00:59:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:59:18,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 00:59:18,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 45 proven. 109 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-02-18 00:59:18,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 45 proven. 109 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-02-18 00:59:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:20,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800568348] [2023-02-18 00:59:20,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:20,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469970515] [2023-02-18 00:59:20,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469970515] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:20,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:20,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-18 00:59:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515095678] [2023-02-18 00:59:20,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:20,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 00:59:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 00:59:20,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-02-18 00:59:20,307 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 10 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 10 states have call successors, (46) [2023-02-18 00:59:25,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:27,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:29,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:31,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:34,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:36,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:38,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:43,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:45,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:47,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:49,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:51,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:53,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:53,847 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-18 00:59:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 00:59:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 10 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 10 states have call successors, (46) Word has length 129 [2023-02-18 00:59:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:53,848 INFO L225 Difference]: With dead ends: 133 [2023-02-18 00:59:53,848 INFO L226 Difference]: Without dead ends: 116 [2023-02-18 00:59:53,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=92, Invalid=327, Unknown=1, NotChecked=0, Total=420 [2023-02-18 00:59:53,849 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 29 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:53,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 127 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 735 Invalid, 13 Unknown, 0 Unchecked, 29.0s Time] [2023-02-18 00:59:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-18 00:59:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-18 00:59:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 19 states have call predecessors, (28), 18 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 00:59:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2023-02-18 00:59:53,874 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 129 [2023-02-18 00:59:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:53,875 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2023-02-18 00:59:53,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 10 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 10 states have call successors, (46) [2023-02-18 00:59:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2023-02-18 00:59:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-02-18 00:59:53,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:53,876 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:53,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 00:59:54,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:54,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1019061416, now seen corresponding path program 2 times [2023-02-18 00:59:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:54,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500270554] [2023-02-18 00:59:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:54,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 00:59:54,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357688098] [2023-02-18 00:59:54,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:59:54,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:59:54,109 INFO L229 MonitoredProcess]: Starting monitored process 11 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:59:54,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 00:59:54,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:59:54,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:59:54,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-18 00:59:54,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:59:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 128 proven. 74 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-02-18 00:59:54,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:59:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 128 proven. 74 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-02-18 00:59:55,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:59:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500270554] [2023-02-18 00:59:55,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 00:59:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357688098] [2023-02-18 00:59:55,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357688098] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:59:55,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:59:55,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-18 00:59:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469589298] [2023-02-18 00:59:55,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 00:59:55,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 00:59:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:59:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 00:59:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-02-18 00:59:55,155 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 14 states have call successors, (56), 3 states have call predecessors, (56), 2 states have return successors, (54), 12 states have call predecessors, (54), 14 states have call successors, (54) [2023-02-18 00:59:58,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 00:59:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:58,931 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2023-02-18 00:59:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 00:59:58,932 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 14 states have call successors, (56), 3 states have call predecessors, (56), 2 states have return successors, (54), 12 states have call predecessors, (54), 14 states have call successors, (54) Word has length 151 [2023-02-18 00:59:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:58,932 INFO L225 Difference]: With dead ends: 145 [2023-02-18 00:59:58,932 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 00:59:58,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2023-02-18 00:59:58,933 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:58,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 103 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 705 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2023-02-18 00:59:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 00:59:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 00:59:58,934 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:59:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 00:59:58,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 151 [2023-02-18 00:59:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:58,934 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 00:59:58,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 14 states have call successors, (56), 3 states have call predecessors, (56), 2 states have return successors, (54), 12 states have call predecessors, (54), 14 states have call successors, (54) [2023-02-18 00:59:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 00:59:58,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 00:59:58,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 00:59:58,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 00:59:59,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 00:59:59,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 00:59:59,203 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse20 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse93 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse34 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse80 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6))) (.cse82 (+ .cse20 6)) (.cse78 (+ .cse20 .cse59)) (.cse32 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse33 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse96 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse85 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse36 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse89 (< .cse96 65536)) (.cse90 (<= 0 .cse96)) (.cse91 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse76 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse19 (- .cse33)) (.cse79 (+ .cse32 .cse59)) (.cse66 (* 2 .cse59)) (.cse63 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse48 (+ .cse82 .cse78)) (.cse72 (+ .cse80 1)) (.cse71 (+ .cse34 1)) (.cse12 (not .cse93)) (.cse1 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse27 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse58 (+ 6 (* .cse34 6))) (.cse64 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse75 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse92 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse31 (= (+ (- 6) (+ (+ .cse64 (+ .cse75 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse92)) 0)) (.cse22 (* 2 .cse20)) (.cse60 (not (= .cse58 .cse20))) (.cse65 (- (* .cse32 18))) (.cse26 (or .cse93 (let ((.cse95 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse94 (<= (+ .cse95 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse12 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse94) (or (not .cse94) (not (<= (+ .cse95 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse1)) .cse27))))) (.cse52 (+ .cse71 1)) (.cse53 (+ .cse72 1)) (.cse24 (<= .cse34 |ULTIMATE.start_main_~a~0#1|)) (.cse70 (* .cse48 2)) (.cse49 (+ .cse82 6)) (.cse51 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse23 (not .cse63)) (.cse21 (- .cse66)) (.cse74 (* 2 .cse78)) (.cse57 (- (* 18 .cse79))) (.cse16 (+ 0 1)) (.cse62 (= (+ (+ (+ (- .cse76) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse19)) .cse92) (- 10)) 0)) (.cse84 (and .cse89 .cse90 (not .cse91))) (.cse83 (and .cse85 .cse91 .cse36)) (.cse87 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse88 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (let ((.cse13 (= .cse32 (* .cse34 (* .cse34 .cse34)))) (.cse28 (or .cse83 (and .cse89 .cse90 (<= (+ (- 32768) .cse87) .cse88) (<= (+ (- 65536) .cse87) .cse88)))) (.cse29 (or (let ((.cse86 (+ 65536 .cse88))) (and .cse85 (<= .cse86 (+ 32767 .cse87)) .cse36 (<= .cse86 (+ 65535 .cse87)))) .cse84)) (.cse39 (+ 6 18)) (.cse3 (or .cse62 .cse63)) (.cse25 (* (- 1) 12)) (.cse14 (or .cse83 .cse84)) (.cse7 (+ 6 12)) (.cse10 (+ .cse16 1)) (.cse15 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse37 (= (+ (- 10) (+ (* .cse82 3) (+ (+ (+ (- (* .cse82 (* 3 .cse79))) (* .cse74 .cse78)) .cse57) (- (* .cse78 10))))) 0)) (.cse44 (or .cse51 (not (>= .cse34 .cse80)) .cse23 (<= .cse80 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse81 (+ (* .cse80 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse81) .cse19) .cse21) (* 2 .cse81)))) 0))) (.cse38 (= (+ (+ (+ (- (* .cse48 10)) (let ((.cse77 (+ .cse78 .cse79))) (+ (- (* .cse77 18)) (+ (- (* .cse49 (* .cse77 3))) (* .cse48 .cse70))))) (* .cse49 3)) (- 10)) 0)) (.cse40 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse75 (+ (* .cse76 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse45 (or (<= .cse72 |ULTIMATE.start_main_~a~0#1|) .cse51 (= 0 (+ (let ((.cse73 (+ 6 (* .cse72 6)))) (+ (* .cse73 2) (+ (- .cse74) (+ (* .cse73 |ULTIMATE.start_main_~a~0#1|) .cse19)))) (- 10))) (not .cse24) (not (>= .cse71 .cse72)))) (.cse8 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse33) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse63)) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse46 (or .cse51 (= (+ (- 10) (let ((.cse69 (+ (* .cse53 6) 6))) (+ (* .cse69 2) (+ (- .cse70) (+ (* .cse69 |ULTIMATE.start_main_~a~0#1|) .cse19))))) 0) (not (<= .cse71 |ULTIMATE.start_main_~a~0#1|)) (<= .cse53 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse52 .cse53)))) (.cse11 (let ((.cse67 (= (+ (let ((.cse68 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse68 (* .cse68 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse26 .cse67) (and .cse26 (or .cse12 .cse67))))) (.cse41 (= (+ (+ (+ (+ (+ (- (* .cse20 (* 3 .cse32))) (* .cse66 .cse59)) .cse65) (- (* .cse59 10))) (* .cse20 3)) (- 10)) 0)) (.cse42 (or (= (+ (- 6) (+ (+ (- (* .cse59 12)) (+ .cse65 (* .cse20 .cse59))) .cse22)) 0) .cse60)) (.cse17 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse64 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse43 (or .cse12 .cse31)) (.cse18 (or .cse62 .cse12 .cse63))) (or (let ((.cse4 (+ .cse25 |ULTIMATE.start_main_~y~0#1|)) (.cse2 (+ .cse1 (- 6)))) (let ((.cse0 (+ .cse2 1)) (.cse5 (+ .cse4 (- 6))) (.cse6 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and (= .cse0 (+ (* (- 1) .cse1) |ULTIMATE.start_main_~y~0#1|)) (= .cse2 6) .cse3 (= (+ .cse4 .cse5) |ULTIMATE.start_main_~x~0#1|) (= .cse0 .cse6) (= |ULTIMATE.start_main_~z~0#1| .cse7) .cse8 (= (+ .cse4 (* (- 1) (+ (+ 6 (* (- 1) .cse4) .cse5) .cse4 (* (- 1) .cse5)))) 1) .cse9 (= .cse10 |ULTIMATE.start_main_~n~0#1|) .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 .cse6)) (or .cse12 .cse13) .cse14 (= .cse15 .cse16) .cse17 .cse18 (or (= (+ (+ (+ (+ .cse19 (* .cse20 |ULTIMATE.start_main_~a~0#1|)) .cse21) .cse22) (- 10)) 0) .cse23 .cse24)))) (and .cse26 (= |ULTIMATE.start_main_~y~0#1| 1) .cse27 .cse14 (= |ULTIMATE.start_main_~x~0#1| 0) .cse28 .cse29 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse35 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) .cse35))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse30)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse15 0) (= |ULTIMATE.start_main_~x~0#1| .cse16) (= |ULTIMATE.start_main_~n~0#1| .cse16) .cse31 (or .cse23 (= (+ (+ (- (* .cse20 .cse32)) (* .cse32 .cse33)) (* .cse32 12)) 0) (< .cse34 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 1)) .cse13 (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse30)) 1) .cse11 (= .cse35 0) .cse14 .cse36 (= .cse1 6) .cse28 (<= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse29 (>= .cse16 |ULTIMATE.start_main_~n~0#1|) .cse18 (= (+ 6 (* 6 0)) .cse1)))) (and .cse37 .cse38 (= (+ .cse39 37) |ULTIMATE.start_main_~y~0#1|) (= (+ .cse39 6) |ULTIMATE.start_main_~z~0#1|) .cse40 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse8 .cse9 .cse11 .cse14 (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse41 .cse42 .cse17 .cse43) (and .cse37 .cse44 .cse38 .cse40 .cse45 .cse8 .cse9 .cse46 .cse11 .cse41 .cse42 .cse17 (let ((.cse50 (+ .cse53 1))) (or (= (+ (let ((.cse47 (+ (* 6 .cse50) 6))) (+ (* .cse47 2) (+ (- (* 2 (+ .cse48 .cse49))) (+ (* .cse47 |ULTIMATE.start_main_~a~0#1|) .cse19)))) (- 10)) 0) .cse51 (not (>= (+ .cse52 1) .cse50)) (not (<= .cse52 |ULTIMATE.start_main_~a~0#1|)) (<= .cse50 |ULTIMATE.start_main_~a~0#1|))) .cse43 .cse18) (and (= .cse39 |ULTIMATE.start_main_~z~0#1|) .cse31 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse54 (+ 19 .cse25))) (+ (+ (- 6) .cse54) .cse54)))) .cse8 (or (= (+ (- 6) (let ((.cse56 (+ .cse58 6))) (+ (let ((.cse55 (+ .cse58 .cse59))) (+ (- (* .cse55 12)) (+ (* .cse56 .cse55) .cse57))) (* .cse56 2)))) 0) .cse60) .cse9 .cse11 .cse14 (let ((.cse61 (+ (- 6) 18))) (= (+ (+ (- 6) .cse61) 1) (+ (* (- 1) .cse61) (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18))))) .cse42 .cse17 (= (+ 6 .cse7) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse7)) (= .cse10 .cse15) .cse18) (and .cse37 .cse44 .cse38 .cse40 .cse45 .cse8 .cse9 .cse46 .cse11 .cse41 .cse42 .cse17 .cse43 .cse18))))))) [2023-02-18 00:59:59,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 00:59:59,205 INFO L895 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse57 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse28 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse84 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6))) (.cse73 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse86 (+ .cse28 6)) (.cse82 (+ .cse28 .cse57)) (.cse60 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse69 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse96 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse89 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse14 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse93 (< .cse96 65536)) (.cse94 (<= 0 .cse96)) (.cse95 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse75 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse27 (- .cse69)) (.cse80 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse83 (+ .cse60 .cse57)) (.cse61 (* 2 .cse57)) (.cse55 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse44 (+ .cse86 .cse82)) (.cse77 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse68 (+ 6 (* .cse73 6))) (.cse70 (+ .cse84 1)) (.cse64 (+ .cse73 1))) (let ((.cse30 (* 2 .cse28)) (.cse58 (- (* .cse60 18))) (.cse48 (+ .cse64 1)) (.cse49 (+ .cse70 1)) (.cse59 (not (= .cse68 .cse28))) (.cse32 (<= .cse73 |ULTIMATE.start_main_~a~0#1|)) (.cse54 (not .cse77)) (.cse11 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse56 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse74 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse63 (* .cse44 2)) (.cse45 (+ .cse86 6)) (.cse47 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse31 (not .cse55)) (.cse29 (- .cse61)) (.cse72 (* 2 .cse82)) (.cse67 (- (* 18 .cse83))) (.cse7 (+ 0 1)) (.cse53 (= (+ (+ (+ (- .cse75) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse27)) .cse80) (- 10)) 0)) (.cse88 (and .cse93 .cse94 (not .cse95))) (.cse87 (and .cse89 .cse95 .cse14)) (.cse91 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse92 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (let ((.cse3 (or .cse87 (and .cse93 .cse94 (<= (+ (- 32768) .cse91) .cse92) (<= (+ (- 65536) .cse91) .cse92)))) (.cse4 (or (let ((.cse90 (+ 65536 .cse92))) (and .cse89 (<= .cse90 (+ 32767 .cse91)) .cse14 (<= .cse90 (+ 65535 .cse91)))) .cse88)) (.cse12 (= .cse60 (* .cse73 (* .cse73 .cse73)))) (.cse18 (or .cse53 .cse55)) (.cse33 (* (- 1) 12)) (.cse22 (+ 6 12)) (.cse25 (+ .cse7 1)) (.cse6 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse50 (+ 6 18)) (.cse2 (or .cse87 .cse88)) (.cse34 (= (+ (- 10) (+ (* .cse86 3) (+ (+ (+ (- (* .cse86 (* 3 .cse83))) (* .cse72 .cse82)) .cse67) (- (* .cse82 10))))) 0)) (.cse35 (or .cse47 (not (>= .cse73 .cse84)) .cse31 (<= .cse84 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse85 (+ (* .cse84 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse85) .cse27) .cse29) (* 2 .cse85)))) 0))) (.cse36 (= (+ (+ (+ (- (* .cse44 10)) (let ((.cse81 (+ .cse82 .cse83))) (+ (- (* .cse81 18)) (+ (- (* .cse45 (* .cse81 3))) (* .cse44 .cse63))))) (* .cse45 3)) (- 10)) 0)) (.cse8 (= (+ (- 6) (+ (+ .cse56 (+ .cse74 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse80)) 0)) (.cse0 (or .cse77 (let ((.cse79 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse78 (<= (+ .cse79 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse54 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse78) (or (not .cse78) (not (<= (+ .cse79 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse11)) .cse1))))) (.cse9 (= (+ (let ((.cse76 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse76 (* .cse76 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse37 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse74 (+ (* .cse75 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse10 (or .cse31 (= (+ (+ (- (* .cse28 .cse60)) (* .cse60 .cse69)) (* .cse60 12)) 0) (< .cse73 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse38 (or (<= .cse70 |ULTIMATE.start_main_~a~0#1|) .cse47 (= 0 (+ (let ((.cse71 (+ 6 (* .cse70 6)))) (+ (* .cse71 2) (+ (- .cse72) (+ (* .cse71 |ULTIMATE.start_main_~a~0#1|) .cse27)))) (- 10))) (not .cse32) (not (>= .cse64 .cse70)))) (.cse23 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse69) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse55)) (.cse39 (or (= (+ (- 6) (let ((.cse66 (+ .cse68 6))) (+ (let ((.cse65 (+ .cse68 .cse57))) (+ (- (* .cse65 12)) (+ (* .cse66 .cse65) .cse67))) (* .cse66 2)))) 0) .cse59)) (.cse24 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse40 (or .cse47 (= (+ (- 10) (let ((.cse62 (+ (* .cse49 6) 6))) (+ (* .cse62 2) (+ (- .cse63) (+ (* .cse62 |ULTIMATE.start_main_~a~0#1|) .cse27))))) 0) (not (<= .cse64 |ULTIMATE.start_main_~a~0#1|)) (<= .cse49 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse48 .cse49)))) (.cse41 (= (+ (+ (+ (+ (+ (- (* .cse28 (* 3 .cse60))) (* .cse61 .cse57)) .cse58) (- (* .cse57 10))) (* .cse28 3)) (- 10)) 0)) (.cse42 (or (= (+ (- 6) (+ (+ (- (* .cse57 12)) (+ .cse58 (* .cse28 .cse57))) .cse30)) 0) .cse59)) (.cse26 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse56 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse15 (or .cse53 .cse54 .cse55))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse3 .cse4 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse13 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse5 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) .cse13))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse5)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse6 0) (= |ULTIMATE.start_main_~x~0#1| .cse7) (= |ULTIMATE.start_main_~n~0#1| .cse7) .cse8 .cse0 .cse9 .cse10 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse11 1)) .cse12 (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse5)) 1) (= .cse13 0) .cse2 .cse14 (= .cse11 6) .cse3 (<= .cse6 |ULTIMATE.start_main_~a~0#1|) .cse4 (>= .cse7 |ULTIMATE.start_main_~n~0#1|) .cse15 (= (+ 6 (* 6 0)) .cse11)))) (let ((.cse19 (+ .cse33 |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ .cse11 (- 6)))) (let ((.cse16 (+ .cse17 1)) (.cse20 (+ .cse19 (- 6))) (.cse21 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and (= .cse16 (+ (* (- 1) .cse11) |ULTIMATE.start_main_~y~0#1|)) (= .cse17 6) .cse18 .cse0 .cse9 .cse10 (= (+ .cse19 .cse20) |ULTIMATE.start_main_~x~0#1|) (= .cse16 .cse21) (= |ULTIMATE.start_main_~z~0#1| .cse22) .cse23 .cse12 (= (+ .cse19 (* (- 1) (+ (+ 6 (* (- 1) .cse19) .cse20) .cse19 (* (- 1) .cse20)))) 1) .cse24 (= .cse25 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse11 .cse21)) .cse2 (= .cse6 .cse7) .cse26 .cse15 (or (= (+ (+ (+ (+ .cse27 (* .cse28 |ULTIMATE.start_main_~a~0#1|)) .cse29) .cse30) (- 10)) 0) .cse31 .cse32)))) (and .cse34 .cse35 .cse36 .cse8 .cse0 .cse9 .cse37 .cse10 .cse38 .cse23 .cse39 .cse24 .cse40 .cse41 .cse42 .cse26 (let ((.cse46 (+ .cse49 1))) (or (= (+ (let ((.cse43 (+ (* 6 .cse46) 6))) (+ (* .cse43 2) (+ (- (* 2 (+ .cse44 .cse45))) (+ (* .cse43 |ULTIMATE.start_main_~a~0#1|) .cse27)))) (- 10)) 0) .cse47 (not (>= (+ .cse48 1) .cse46)) (not (<= .cse48 |ULTIMATE.start_main_~a~0#1|)) (<= .cse46 |ULTIMATE.start_main_~a~0#1|))) .cse15) (and (= .cse50 |ULTIMATE.start_main_~z~0#1|) .cse8 .cse18 .cse0 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse51 (+ 19 .cse33))) (+ (+ (- 6) .cse51) .cse51)))) .cse9 .cse10 .cse23 .cse39 .cse24 .cse2 (let ((.cse52 (+ (- 6) 18))) (= (+ (+ (- 6) .cse52) 1) (+ (* (- 1) .cse52) (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18))))) .cse42 .cse26 (= (+ 6 .cse22) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse22)) (= .cse25 .cse6) .cse15) (and .cse34 .cse36 .cse8 .cse0 (= (+ .cse50 37) |ULTIMATE.start_main_~y~0#1|) .cse9 (= (+ .cse50 6) |ULTIMATE.start_main_~z~0#1|) .cse37 .cse10 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse23 .cse39 .cse24 .cse2 (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse41 .cse42 .cse26) (and .cse34 .cse35 .cse36 .cse8 .cse0 .cse9 .cse37 .cse10 .cse38 .cse23 .cse39 .cse24 .cse40 .cse41 .cse42 .cse26 .cse15))))))) [2023-02-18 00:59:59,205 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-02-18 00:59:59,205 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (let ((.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse12 (let ((.cse14 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse13 (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse13) (or (not .cse13) (not (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse3)))))) (.cse1 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse0 (let ((.cse6 (= (+ (- 6) (+ (+ .cse1 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse7 (= (+ (let ((.cse11 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse11 (* .cse11 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ |ULTIMATE.start_main_~n~0#1| 1))) (* .cse10 (* .cse10 .cse10))))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse5 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse5) (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse6 .cse2 .cse7 .cse8 .cse9)) (and .cse6 .cse2 .cse7 .cse8 .cse9))))) (or (and .cse0 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse1 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) (= .cse4 6) (= (+ 6 (* 6 0)) .cse4)))))) [2023-02-18 00:59:59,206 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse67 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse55 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse22 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse79 (+ .cse55 6)) (.cse77 (+ .cse55 .cse67)) (.cse58 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse78 (+ .cse58 .cse67)) (.cse45 (+ .cse79 .cse77)) (.cse75 (+ 6 (* .cse22 6))) (.cse80 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (.cse59 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse70 (* 2 .cse67))) (let ((.cse27 (- .cse70)) (.cse34 (<= .cse22 |ULTIMATE.start_main_~a~0#1|)) (.cse24 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse8 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse57 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse26 (- .cse59)) (.cse65 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse56 (* 2 .cse55)) (.cse68 (- (* .cse58 18))) (.cse12 (< .cse80 65536)) (.cse13 (<= 0 .cse80)) (.cse16 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse71 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse10 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse69 (not (= .cse75 .cse55))) (.cse64 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse66 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse38 (* .cse45 2)) (.cse46 (+ .cse79 6)) (.cse33 (* 2 .cse77)) (.cse74 (- (* 18 .cse78)))) (let ((.cse20 (= (+ (- 10) (+ (* .cse79 3) (+ (+ (+ (- (* .cse79 (* 3 .cse78))) (* .cse33 .cse77)) .cse74) (- (* .cse77 10))))) 0)) (.cse29 (= (+ (+ (+ (- (* .cse45 10)) (let ((.cse76 (+ .cse77 .cse78))) (+ (- (* .cse76 18)) (+ (- (* .cse46 (* .cse76 3))) (* .cse45 .cse38))))) (* .cse46 3)) (- 10)) 0)) (.cse30 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse64 (+ (* .cse66 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse36 (or (= (+ (- 6) (let ((.cse73 (+ .cse75 6))) (+ (let ((.cse72 (+ .cse75 .cse67))) (+ (- (* .cse72 12)) (+ (* .cse73 .cse72) .cse74))) (* .cse73 2)))) 0) .cse69)) (.cse11 (and .cse16 .cse71 .cse10)) (.cse18 (and .cse12 .cse13 (not .cse71))) (.cse41 (= (+ (+ (+ (+ (+ (- (* .cse55 (* 3 .cse58))) (* .cse70 .cse67)) .cse68) (- (* .cse67 10))) (* .cse55 3)) (- 10)) 0)) (.cse42 (or (= (+ (- 6) (+ (+ (- (* .cse67 12)) (+ .cse68 (* .cse55 .cse67))) .cse56)) 0) .cse69)) (.cse19 (= (+ (+ (+ (- .cse66) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse26)) .cse65) (- 10)) 0)) (.cse28 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse59) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse2 (= (+ (- 6) (+ (+ .cse57 (+ .cse64 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse65)) 0)) (.cse3 (let ((.cse61 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse61 (let ((.cse63 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse62 (<= (+ .cse63 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse61) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse62) (or (not .cse62) (not (<= (+ .cse63 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse6)) .cse49)))))) (.cse4 (= (+ (let ((.cse60 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse60 (* .cse60 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (or .cse24 (= (+ (+ (- (* .cse55 .cse58)) (* .cse58 .cse59)) (* .cse58 12)) 0) (< .cse22 .cse8))) (.cse7 (= .cse58 (* .cse22 (* .cse22 .cse22)))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse1 (+ 0 1)) (.cse43 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse57 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse48 (or (= (+ (+ (+ (+ .cse26 (* .cse55 |ULTIMATE.start_main_~a~0#1|)) .cse27) .cse56) (- 10)) 0) .cse24 .cse34))) (or (let ((.cse14 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse15 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (and (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse1) (= |ULTIMATE.start_main_~n~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 1)) (<= (+ (- 1) 1) |ULTIMATE.start_main_~a~0#1|) .cse7 (<= .cse8 1) .cse9 .cse10 (= .cse6 6) (not (<= 1 |ULTIMATE.start_main_~a~0#1|)) (or .cse11 (and .cse12 .cse13 (<= (+ (- 32768) .cse14) .cse15) (<= (+ (- 65536) .cse14) .cse15))) (<= .cse0 |ULTIMATE.start_main_~a~0#1|) (or (let ((.cse17 (+ 65536 .cse15))) (and .cse16 (<= .cse17 (+ 32767 .cse14)) .cse10 (<= .cse17 (+ 65535 .cse14)))) .cse18) (>= .cse1 |ULTIMATE.start_main_~n~0#1|) (= (+ 6 (* 6 0)) .cse6))) (let ((.cse23 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse31 (+ .cse23 1)) (.cse35 (+ .cse22 1))) (let ((.cse21 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse40 (+ .cse35 1)) (.cse39 (+ .cse31 1))) (and .cse19 .cse20 (or .cse21 (not (>= .cse22 .cse23)) .cse24 (<= .cse23 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse25 (+ (* .cse23 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse25) .cse26) .cse27) (* 2 .cse25)))) 0)) .cse28 .cse29 .cse2 .cse3 .cse4 .cse30 .cse5 (or (<= .cse31 |ULTIMATE.start_main_~a~0#1|) .cse21 (= 0 (+ (let ((.cse32 (+ 6 (* .cse31 6)))) (+ (* .cse32 2) (+ (- .cse33) (+ (* .cse32 |ULTIMATE.start_main_~a~0#1|) .cse26)))) (- 10))) (not .cse34) (not (>= .cse35 .cse31))) .cse7 .cse36 .cse9 (or .cse21 (= (+ (- 10) (let ((.cse37 (+ (* .cse39 6) 6))) (+ (* .cse37 2) (+ (- .cse38) (+ (* .cse37 |ULTIMATE.start_main_~a~0#1|) .cse26))))) 0) (not (<= .cse35 |ULTIMATE.start_main_~a~0#1|)) (<= .cse39 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse40 .cse39))) .cse41 .cse42 .cse43 (let ((.cse47 (+ .cse39 1))) (or (= (+ (let ((.cse44 (+ (* 6 .cse47) 6))) (+ (* .cse44 2) (+ (- (* 2 (+ .cse45 .cse46))) (+ (* .cse44 |ULTIMATE.start_main_~a~0#1|) .cse26)))) (- 10)) 0) .cse21 (not (>= (+ .cse40 1) .cse47)) (not (<= .cse40 |ULTIMATE.start_main_~a~0#1|)) (<= .cse47 |ULTIMATE.start_main_~a~0#1|))) .cse48)))) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse49 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse51 (+ 6 12))) (and .cse19 .cse28 .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse50 (+ 19 (* (- 1) 12)))) (+ (+ (- 6) .cse50) .cse50)))) .cse4 .cse5 .cse7 .cse36 .cse9 .cse42 .cse43 (= (+ 6 .cse51) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse51)) .cse48)) (let ((.cse52 (+ 6 18))) (and .cse20 .cse28 .cse29 .cse2 .cse3 (= (+ .cse52 37) |ULTIMATE.start_main_~y~0#1|) .cse4 (= (+ .cse52 6) |ULTIMATE.start_main_~z~0#1|) .cse30 .cse5 .cse24 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse7 .cse36 .cse9 (or .cse11 .cse18) (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse41 .cse42 .cse43 .cse48)) (let ((.cse53 (+ .cse6 (- 6))) (.cse54 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and .cse19 .cse28 (= .cse53 6) .cse2 .cse3 .cse4 .cse5 (= (+ .cse53 1) .cse54) .cse7 .cse9 (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 .cse54)) (= .cse0 .cse1) .cse43 .cse48)))))))) [2023-02-18 00:59:59,206 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 00:59:59,206 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 55) the Hoare annotation is: true [2023-02-18 00:59:59,207 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse65 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse42 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse69 (* 2 .cse63)) (.cse74 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse85 (+ .cse65 6)) (.cse83 (+ .cse65 .cse63)) (.cse68 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse95 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse76 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse81 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse92 (< .cse95 65536)) (.cse93 (<= 0 .cse95)) (.cse86 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse94 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse40 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse84 (+ .cse68 .cse63)) (.cse56 (+ .cse85 .cse83)) (.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse61 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse45 (- .cse74)) (.cse46 (- .cse69)) (.cse66 (* 2 .cse65)) (.cse73 (+ 6 (* .cse42 6)))) (let ((.cse64 (- (* .cse68 18))) (.cse67 (not (= .cse73 .cse65))) (.cse29 (= (+ (+ (+ (+ .cse45 (* .cse65 |ULTIMATE.start_main_~a~0#1|)) .cse46) .cse66) (- 10)) 0)) (.cse31 (<= .cse42 |ULTIMATE.start_main_~a~0#1|)) (.cse30 (not .cse61)) (.cse60 (not .cse78)) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse35 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse62 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse75 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse52 (* .cse56 2)) (.cse57 (+ .cse85 6)) (.cse49 (* 2 .cse83)) (.cse72 (- (* 18 .cse84))) (.cse88 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse89 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536))) (.cse91 (and .cse86 .cse94 .cse40)) (.cse90 (and .cse92 .cse93 (not .cse94))) (.cse27 (+ 0 1)) (.cse59 (= (+ (+ (+ (- .cse76) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse45)) .cse81) (- 10)) 0))) (let ((.cse4 (+ 6 18)) (.cse20 (or .cse59 .cse61)) (.cse32 (* (- 1) 12)) (.cse24 (+ 6 12)) (.cse25 (+ .cse27 1)) (.cse13 (or .cse91 .cse90)) (.cse36 (or .cse91 (and .cse92 .cse93 (<= (+ (- 32768) .cse88) .cse89) (<= (+ (- 65536) .cse88) .cse89)))) (.cse26 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse37 (or (let ((.cse87 (+ 65536 .cse89))) (and .cse86 (<= .cse87 (+ 32767 .cse88)) .cse40 (<= .cse87 (+ 65535 .cse88)))) .cse90)) (.cse0 (= (+ (- 10) (+ (* .cse85 3) (+ (+ (+ (- (* .cse85 (* 3 .cse84))) (* .cse49 .cse83)) .cse72) (- (* .cse83 10))))) 0)) (.cse1 (= (+ (+ (+ (- (* .cse56 10)) (let ((.cse82 (+ .cse83 .cse84))) (+ (- (* .cse82 18)) (+ (- (* .cse57 (* .cse82 3))) (* .cse56 .cse52))))) (* .cse57 3)) (- 10)) 0)) (.cse2 (= (+ (- 6) (+ (+ .cse62 (+ .cse75 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse81)) 0)) (.cse3 (or .cse78 (let ((.cse80 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse79 (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse60 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse79) (or (not .cse79) (not (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse35))))) (.cse5 (= (+ (let ((.cse77 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse77 (* .cse77 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse75 (+ (* .cse76 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse7 (or .cse30 (= (+ (+ (- (* .cse65 .cse68)) (* .cse68 .cse74)) (* .cse68 12)) 0) (< .cse42 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse8 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse74) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse61)) (.cse9 (= .cse68 (* .cse42 (* .cse42 .cse42)))) (.cse10 (or .cse60 .cse29 .cse30 .cse31)) (.cse11 (or (= (+ (- 6) (let ((.cse71 (+ .cse73 6))) (+ (let ((.cse70 (+ .cse73 .cse63))) (+ (- (* .cse70 12)) (+ (* .cse71 .cse70) .cse72))) (* .cse71 2)))) 0) .cse67)) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse14 (= (+ (+ (+ (+ (+ (- (* .cse65 (* 3 .cse68))) (* .cse69 .cse63)) .cse64) (- (* .cse63 10))) (* .cse65 3)) (- 10)) 0)) (.cse15 (or (= (+ (- 6) (+ (+ (- (* .cse63 12)) (+ .cse64 (* .cse65 .cse63))) .cse66)) 0) .cse67)) (.cse16 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse62 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse28 (or .cse59 .cse60 .cse61))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ .cse4 37) |ULTIMATE.start_main_~y~0#1|) .cse5 (= (+ .cse4 6) |ULTIMATE.start_main_~z~0#1|) .cse6 .cse7 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse14 .cse15 .cse16) (let ((.cse21 (+ .cse32 |ULTIMATE.start_main_~y~0#1|)) (.cse19 (+ .cse18 (- 6)))) (let ((.cse17 (+ .cse19 1)) (.cse22 (+ .cse21 (- 6))) (.cse23 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and (= .cse17 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (= .cse19 6) .cse2 .cse20 .cse3 .cse5 .cse7 (= (+ .cse21 .cse22) |ULTIMATE.start_main_~x~0#1|) (= .cse17 .cse23) (= |ULTIMATE.start_main_~z~0#1| .cse24) .cse8 .cse9 (= (+ .cse21 (* (- 1) (+ (+ 6 (* (- 1) .cse21) .cse22) .cse21 (* (- 1) .cse22)))) 1) .cse12 (= .cse25 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 .cse23)) .cse13 (= .cse26 .cse27) .cse16 .cse28 (or .cse29 .cse30 .cse31)))) (and (= .cse4 |ULTIMATE.start_main_~z~0#1|) .cse2 .cse20 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse33 (+ 19 .cse32))) (+ (+ (- 6) .cse33) .cse33)))) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (let ((.cse34 (+ (- 6) 18))) (= (+ (+ (- 6) .cse34) 1) (+ (* (- 1) .cse34) (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18))))) .cse15 .cse16 (= (+ 6 .cse24) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse24)) (= .cse25 .cse26) .cse28) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse35 .cse13 (= |ULTIMATE.start_main_~x~0#1| 0) .cse36 .cse37 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse39 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse38 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) .cse39))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse38)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse26 0) (= |ULTIMATE.start_main_~x~0#1| .cse27) (= |ULTIMATE.start_main_~n~0#1| .cse27) .cse2 .cse3 .cse5 .cse7 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse9 (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse38)) 1) .cse12 (= .cse39 0) .cse13 .cse40 (= .cse18 6) .cse36 (<= .cse26 |ULTIMATE.start_main_~a~0#1|) .cse37 (>= .cse27 |ULTIMATE.start_main_~n~0#1|) .cse28 (= (+ 6 (* 6 0)) .cse18)))) (let ((.cse43 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse47 (+ .cse43 1)) (.cse50 (+ .cse42 1))) (let ((.cse41 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse54 (+ .cse50 1)) (.cse53 (+ .cse47 1))) (and .cse0 (or .cse41 (not (>= .cse42 .cse43)) .cse30 (<= .cse43 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse44 (+ (* .cse43 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse44) .cse45) .cse46) (* 2 .cse44)))) 0)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (or (<= .cse47 |ULTIMATE.start_main_~a~0#1|) .cse41 (= 0 (+ (let ((.cse48 (+ 6 (* .cse47 6)))) (+ (* .cse48 2) (+ (- .cse49) (+ (* .cse48 |ULTIMATE.start_main_~a~0#1|) .cse45)))) (- 10))) (not .cse31) (not (>= .cse50 .cse47))) .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse41 (= (+ (- 10) (let ((.cse51 (+ (* .cse53 6) 6))) (+ (* .cse51 2) (+ (- .cse52) (+ (* .cse51 |ULTIMATE.start_main_~a~0#1|) .cse45))))) 0) (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|)) (<= .cse53 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse54 .cse53))) .cse14 .cse15 .cse16 (let ((.cse58 (+ .cse53 1))) (or (= (+ (let ((.cse55 (+ (* 6 .cse58) 6))) (+ (* .cse55 2) (+ (- (* 2 (+ .cse56 .cse57))) (+ (* .cse55 |ULTIMATE.start_main_~a~0#1|) .cse45)))) (- 10)) 0) .cse41 (not (>= (+ .cse54 1) .cse58)) (not (<= .cse54 |ULTIMATE.start_main_~a~0#1|)) (<= .cse58 |ULTIMATE.start_main_~a~0#1|))) .cse28)))))))))) [2023-02-18 00:59:59,208 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse65 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse42 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse69 (* 2 .cse63)) (.cse74 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse85 (+ .cse65 6)) (.cse83 (+ .cse65 .cse63)) (.cse68 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse95 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse88 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse32 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse92 (< .cse95 65536)) (.cse93 (<= 0 .cse95)) (.cse94 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse76 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse81 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse84 (+ .cse68 .cse63)) (.cse56 (+ .cse85 .cse83)) (.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse61 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse45 (- .cse74)) (.cse46 (- .cse69)) (.cse66 (* 2 .cse65)) (.cse73 (+ 6 (* .cse42 6)))) (let ((.cse64 (- (* .cse68 18))) (.cse67 (not (= .cse73 .cse65))) (.cse38 (= (+ (+ (+ (+ .cse45 (* .cse65 |ULTIMATE.start_main_~a~0#1|)) .cse46) .cse66) (- 10)) 0)) (.cse40 (<= .cse42 |ULTIMATE.start_main_~a~0#1|)) (.cse39 (not .cse61)) (.cse60 (not .cse78)) (.cse30 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse25 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse62 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse75 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse52 (* .cse56 2)) (.cse57 (+ .cse85 6)) (.cse49 (* 2 .cse83)) (.cse72 (- (* 18 .cse84))) (.cse29 (+ 0 1)) (.cse59 (= (+ (+ (+ (- .cse76) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse45)) .cse81) (- 10)) 0)) (.cse87 (and .cse92 .cse93 (not .cse94))) (.cse86 (and .cse88 .cse94 .cse32)) (.cse90 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse91 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (let ((.cse4 (+ 6 18)) (.cse26 (or .cse86 (and .cse92 .cse93 (<= (+ (- 32768) .cse90) .cse91) (<= (+ (- 65536) .cse90) .cse91)))) (.cse27 (or (let ((.cse89 (+ 65536 .cse91))) (and .cse88 (<= .cse89 (+ 32767 .cse90)) .cse32 (<= .cse89 (+ 65535 .cse90)))) .cse87)) (.cse17 (or .cse59 .cse61)) (.cse21 (+ 6 12)) (.cse22 (+ .cse29 1)) (.cse13 (or .cse86 .cse87)) (.cse23 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse19 (* (- 1) 12)) (.cse0 (= (+ (- 10) (+ (* .cse85 3) (+ (+ (+ (- (* .cse85 (* 3 .cse84))) (* .cse49 .cse83)) .cse72) (- (* .cse83 10))))) 0)) (.cse1 (= (+ (+ (+ (- (* .cse56 10)) (let ((.cse82 (+ .cse83 .cse84))) (+ (- (* .cse82 18)) (+ (- (* .cse57 (* .cse82 3))) (* .cse56 .cse52))))) (* .cse57 3)) (- 10)) 0)) (.cse2 (= (+ (- 6) (+ (+ .cse62 (+ .cse75 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse81)) 0)) (.cse3 (or .cse78 (let ((.cse80 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse79 (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse60 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse79) (or (not .cse79) (not (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse30)) .cse25))))) (.cse5 (= (+ (let ((.cse77 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse77 (* .cse77 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse75 (+ (* .cse76 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse7 (or .cse39 (= (+ (+ (- (* .cse65 .cse68)) (* .cse68 .cse74)) (* .cse68 12)) 0) (< .cse42 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse8 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse74) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse61)) (.cse9 (= .cse68 (* .cse42 (* .cse42 .cse42)))) (.cse10 (or .cse60 .cse38 .cse39 .cse40)) (.cse11 (or (= (+ (- 6) (let ((.cse71 (+ .cse73 6))) (+ (let ((.cse70 (+ .cse73 .cse63))) (+ (- (* .cse70 12)) (+ (* .cse71 .cse70) .cse72))) (* .cse71 2)))) 0) .cse67)) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse14 (= (+ (+ (+ (+ (+ (- (* .cse65 (* 3 .cse68))) (* .cse69 .cse63)) .cse64) (- (* .cse63 10))) (* .cse65 3)) (- 10)) 0)) (.cse15 (or (= (+ (- 6) (+ (+ (- (* .cse63 12)) (+ .cse64 (* .cse65 .cse63))) .cse66)) 0) .cse67)) (.cse16 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse62 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse24 (or .cse59 .cse60 .cse61))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ .cse4 37) |ULTIMATE.start_main_~y~0#1|) .cse5 (= (+ .cse4 6) |ULTIMATE.start_main_~z~0#1|) .cse6 .cse7 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse14 .cse15 .cse16) (and (= .cse4 |ULTIMATE.start_main_~z~0#1|) .cse2 .cse17 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse18 (+ 19 .cse19))) (+ (+ (- 6) .cse18) .cse18)))) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (let ((.cse20 (+ (- 6) 18))) (= (+ (+ (- 6) .cse20) 1) (+ (* (- 1) .cse20) (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18))))) .cse15 .cse16 (= (+ 6 .cse21) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse21)) (= .cse22 .cse23) .cse24) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse25 .cse13 (= |ULTIMATE.start_main_~x~0#1| 0) .cse26 .cse27 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse28 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) .cse31))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse28)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse23 0) (= |ULTIMATE.start_main_~x~0#1| .cse29) (= |ULTIMATE.start_main_~n~0#1| .cse29) .cse2 .cse3 .cse5 .cse7 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse30 1)) .cse9 (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse28)) 1) (= .cse31 0) .cse13 .cse32 (= .cse30 6) .cse26 (<= .cse23 |ULTIMATE.start_main_~a~0#1|) .cse27 (>= .cse29 |ULTIMATE.start_main_~n~0#1|) .cse24 (= (+ 6 (* 6 0)) .cse30)))) (let ((.cse35 (+ .cse19 |ULTIMATE.start_main_~y~0#1|)) (.cse34 (+ .cse30 (- 6)))) (let ((.cse33 (+ .cse34 1)) (.cse36 (+ .cse35 (- 6))) (.cse37 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and (= .cse33 (+ (* (- 1) .cse30) |ULTIMATE.start_main_~y~0#1|)) (= .cse34 6) .cse17 .cse3 .cse5 .cse7 (= (+ .cse35 .cse36) |ULTIMATE.start_main_~x~0#1|) (= .cse33 .cse37) (= |ULTIMATE.start_main_~z~0#1| .cse21) .cse8 .cse9 (= (+ .cse35 (* (- 1) (+ (+ 6 (* (- 1) .cse35) .cse36) .cse35 (* (- 1) .cse36)))) 1) .cse12 (= .cse22 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse30 .cse37)) .cse13 (= .cse23 .cse29) .cse16 .cse24 (or .cse38 .cse39 .cse40)))) (let ((.cse43 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse47 (+ .cse43 1)) (.cse50 (+ .cse42 1))) (let ((.cse41 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse54 (+ .cse50 1)) (.cse53 (+ .cse47 1))) (and .cse0 (or .cse41 (not (>= .cse42 .cse43)) .cse39 (<= .cse43 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse44 (+ (* .cse43 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse44) .cse45) .cse46) (* 2 .cse44)))) 0)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (or (<= .cse47 |ULTIMATE.start_main_~a~0#1|) .cse41 (= 0 (+ (let ((.cse48 (+ 6 (* .cse47 6)))) (+ (* .cse48 2) (+ (- .cse49) (+ (* .cse48 |ULTIMATE.start_main_~a~0#1|) .cse45)))) (- 10))) (not .cse40) (not (>= .cse50 .cse47))) .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse41 (= (+ (- 10) (let ((.cse51 (+ (* .cse53 6) 6))) (+ (* .cse51 2) (+ (- .cse52) (+ (* .cse51 |ULTIMATE.start_main_~a~0#1|) .cse45))))) 0) (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|)) (<= .cse53 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse54 .cse53))) .cse14 .cse15 .cse16 (let ((.cse58 (+ .cse53 1))) (or (= (+ (let ((.cse55 (+ (* 6 .cse58) 6))) (+ (* .cse55 2) (+ (- (* 2 (+ .cse56 .cse57))) (+ (* .cse55 |ULTIMATE.start_main_~a~0#1|) .cse45)))) (- 10)) 0) .cse41 (not (>= (+ .cse54 1) .cse58)) (not (<= .cse54 |ULTIMATE.start_main_~a~0#1|)) (<= .cse58 |ULTIMATE.start_main_~a~0#1|))) .cse24)))))))))) [2023-02-18 00:59:59,208 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 00:59:59,209 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 45) the Hoare annotation is: (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse20 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse93 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse34 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse80 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6))) (.cse82 (+ .cse20 6)) (.cse78 (+ .cse20 .cse59)) (.cse32 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse33 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse96 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse85 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse36 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse89 (< .cse96 65536)) (.cse90 (<= 0 .cse96)) (.cse91 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse76 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse19 (- .cse33)) (.cse79 (+ .cse32 .cse59)) (.cse66 (* 2 .cse59)) (.cse63 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse48 (+ .cse82 .cse78)) (.cse72 (+ .cse80 1)) (.cse71 (+ .cse34 1)) (.cse12 (not .cse93)) (.cse1 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse27 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse58 (+ 6 (* .cse34 6))) (.cse64 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse75 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse92 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse31 (= (+ (- 6) (+ (+ .cse64 (+ .cse75 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse92)) 0)) (.cse22 (* 2 .cse20)) (.cse60 (not (= .cse58 .cse20))) (.cse65 (- (* .cse32 18))) (.cse26 (or .cse93 (let ((.cse95 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse94 (<= (+ .cse95 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse12 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse94) (or (not .cse94) (not (<= (+ .cse95 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse1)) .cse27))))) (.cse52 (+ .cse71 1)) (.cse53 (+ .cse72 1)) (.cse24 (<= .cse34 |ULTIMATE.start_main_~a~0#1|)) (.cse70 (* .cse48 2)) (.cse49 (+ .cse82 6)) (.cse51 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse23 (not .cse63)) (.cse21 (- .cse66)) (.cse74 (* 2 .cse78)) (.cse57 (- (* 18 .cse79))) (.cse16 (+ 0 1)) (.cse62 (= (+ (+ (+ (- .cse76) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse19)) .cse92) (- 10)) 0)) (.cse84 (and .cse89 .cse90 (not .cse91))) (.cse83 (and .cse85 .cse91 .cse36)) (.cse87 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse88 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (let ((.cse13 (= .cse32 (* .cse34 (* .cse34 .cse34)))) (.cse28 (or .cse83 (and .cse89 .cse90 (<= (+ (- 32768) .cse87) .cse88) (<= (+ (- 65536) .cse87) .cse88)))) (.cse29 (or (let ((.cse86 (+ 65536 .cse88))) (and .cse85 (<= .cse86 (+ 32767 .cse87)) .cse36 (<= .cse86 (+ 65535 .cse87)))) .cse84)) (.cse39 (+ 6 18)) (.cse3 (or .cse62 .cse63)) (.cse25 (* (- 1) 12)) (.cse14 (or .cse83 .cse84)) (.cse7 (+ 6 12)) (.cse10 (+ .cse16 1)) (.cse15 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse37 (= (+ (- 10) (+ (* .cse82 3) (+ (+ (+ (- (* .cse82 (* 3 .cse79))) (* .cse74 .cse78)) .cse57) (- (* .cse78 10))))) 0)) (.cse44 (or .cse51 (not (>= .cse34 .cse80)) .cse23 (<= .cse80 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse81 (+ (* .cse80 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse81) .cse19) .cse21) (* 2 .cse81)))) 0))) (.cse38 (= (+ (+ (+ (- (* .cse48 10)) (let ((.cse77 (+ .cse78 .cse79))) (+ (- (* .cse77 18)) (+ (- (* .cse49 (* .cse77 3))) (* .cse48 .cse70))))) (* .cse49 3)) (- 10)) 0)) (.cse40 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse75 (+ (* .cse76 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse45 (or (<= .cse72 |ULTIMATE.start_main_~a~0#1|) .cse51 (= 0 (+ (let ((.cse73 (+ 6 (* .cse72 6)))) (+ (* .cse73 2) (+ (- .cse74) (+ (* .cse73 |ULTIMATE.start_main_~a~0#1|) .cse19)))) (- 10))) (not .cse24) (not (>= .cse71 .cse72)))) (.cse8 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse33) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse63)) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse46 (or .cse51 (= (+ (- 10) (let ((.cse69 (+ (* .cse53 6) 6))) (+ (* .cse69 2) (+ (- .cse70) (+ (* .cse69 |ULTIMATE.start_main_~a~0#1|) .cse19))))) 0) (not (<= .cse71 |ULTIMATE.start_main_~a~0#1|)) (<= .cse53 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse52 .cse53)))) (.cse11 (let ((.cse67 (= (+ (let ((.cse68 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse68 (* .cse68 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse26 .cse67) (and .cse26 (or .cse12 .cse67))))) (.cse41 (= (+ (+ (+ (+ (+ (- (* .cse20 (* 3 .cse32))) (* .cse66 .cse59)) .cse65) (- (* .cse59 10))) (* .cse20 3)) (- 10)) 0)) (.cse42 (or (= (+ (- 6) (+ (+ (- (* .cse59 12)) (+ .cse65 (* .cse20 .cse59))) .cse22)) 0) .cse60)) (.cse17 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse64 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse43 (or .cse12 .cse31)) (.cse18 (or .cse62 .cse12 .cse63))) (or (let ((.cse4 (+ .cse25 |ULTIMATE.start_main_~y~0#1|)) (.cse2 (+ .cse1 (- 6)))) (let ((.cse0 (+ .cse2 1)) (.cse5 (+ .cse4 (- 6))) (.cse6 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and (= .cse0 (+ (* (- 1) .cse1) |ULTIMATE.start_main_~y~0#1|)) (= .cse2 6) .cse3 (= (+ .cse4 .cse5) |ULTIMATE.start_main_~x~0#1|) (= .cse0 .cse6) (= |ULTIMATE.start_main_~z~0#1| .cse7) .cse8 (= (+ .cse4 (* (- 1) (+ (+ 6 (* (- 1) .cse4) .cse5) .cse4 (* (- 1) .cse5)))) 1) .cse9 (= .cse10 |ULTIMATE.start_main_~n~0#1|) .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 .cse6)) (or .cse12 .cse13) .cse14 (= .cse15 .cse16) .cse17 .cse18 (or (= (+ (+ (+ (+ .cse19 (* .cse20 |ULTIMATE.start_main_~a~0#1|)) .cse21) .cse22) (- 10)) 0) .cse23 .cse24)))) (and .cse26 (= |ULTIMATE.start_main_~y~0#1| 1) .cse27 .cse14 (= |ULTIMATE.start_main_~x~0#1| 0) .cse28 .cse29 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse35 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) .cse35))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse30)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse15 0) (= |ULTIMATE.start_main_~x~0#1| .cse16) (= |ULTIMATE.start_main_~n~0#1| .cse16) .cse31 (or .cse23 (= (+ (+ (- (* .cse20 .cse32)) (* .cse32 .cse33)) (* .cse32 12)) 0) (< .cse34 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 1)) .cse13 (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse30)) 1) .cse11 (= .cse35 0) .cse14 .cse36 (= .cse1 6) .cse28 (<= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse29 (>= .cse16 |ULTIMATE.start_main_~n~0#1|) .cse18 (= (+ 6 (* 6 0)) .cse1)))) (and .cse37 .cse38 (= (+ .cse39 37) |ULTIMATE.start_main_~y~0#1|) (= (+ .cse39 6) |ULTIMATE.start_main_~z~0#1|) .cse40 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse8 .cse9 .cse11 .cse14 (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse41 .cse42 .cse17 .cse43) (and .cse37 .cse44 .cse38 .cse40 .cse45 .cse8 .cse9 .cse46 .cse11 .cse41 .cse42 .cse17 (let ((.cse50 (+ .cse53 1))) (or (= (+ (let ((.cse47 (+ (* 6 .cse50) 6))) (+ (* .cse47 2) (+ (- (* 2 (+ .cse48 .cse49))) (+ (* .cse47 |ULTIMATE.start_main_~a~0#1|) .cse19)))) (- 10)) 0) .cse51 (not (>= (+ .cse52 1) .cse50)) (not (<= .cse52 |ULTIMATE.start_main_~a~0#1|)) (<= .cse50 |ULTIMATE.start_main_~a~0#1|))) .cse43 .cse18) (and (= .cse39 |ULTIMATE.start_main_~z~0#1|) .cse31 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse54 (+ 19 .cse25))) (+ (+ (- 6) .cse54) .cse54)))) .cse8 (or (= (+ (- 6) (let ((.cse56 (+ .cse58 6))) (+ (let ((.cse55 (+ .cse58 .cse59))) (+ (- (* .cse55 12)) (+ (* .cse56 .cse55) .cse57))) (* .cse56 2)))) 0) .cse60) .cse9 .cse11 .cse14 (let ((.cse61 (+ (- 6) 18))) (= (+ (+ (- 6) .cse61) 1) (+ (* (- 1) .cse61) (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18))))) .cse42 .cse17 (= (+ 6 .cse7) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse7)) (= .cse10 .cse15) .cse18) (and .cse37 .cse44 .cse38 .cse40 .cse45 .cse8 .cse9 .cse46 .cse11 .cse41 .cse42 .cse17 .cse43 .cse18))))))) [2023-02-18 00:59:59,210 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 45) the Hoare annotation is: (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse56 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse37 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse79 (+ .cse56 6)) (.cse77 (+ .cse56 .cse59)) (.cse62 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse81 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (.cse78 (+ .cse62 .cse59)) (.cse53 (+ .cse79 .cse77)) (.cse73 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse69 (+ 6 (* .cse37 6))) (.cse70 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse63 (* 2 .cse59))) (let ((.cse41 (- .cse63)) (.cse45 (<= .cse37 |ULTIMATE.start_main_~a~0#1|)) (.cse57 (* 2 .cse56)) (.cse60 (- (* .cse62 18))) (.cse40 (- .cse70)) (.cse61 (not (= .cse69 .cse56))) (.cse32 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse8 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse64 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse51 (not .cse73)) (.cse6 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse19 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse58 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse71 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse65 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse48 (* .cse53 2)) (.cse54 (+ .cse79 6)) (.cse44 (* 2 .cse77)) (.cse68 (- (* 18 .cse78))) (.cse12 (< .cse81 65536)) (.cse13 (<= 0 .cse81)) (.cse16 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse80 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse10 (<= 0 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse11 (and .cse16 .cse80 .cse10)) (.cse18 (and .cse12 .cse13 (not .cse80))) (.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse1 (+ 0 1)) (.cse28 (= (+ (- 10) (+ (* .cse79 3) (+ (+ (+ (- (* .cse79 (* 3 .cse78))) (* .cse44 .cse77)) .cse68) (- (* .cse77 10))))) 0)) (.cse21 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse70) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse29 (= (+ (+ (+ (- (* .cse53 10)) (let ((.cse76 (+ .cse77 .cse78))) (+ (- (* .cse76 18)) (+ (- (* .cse54 (* .cse76 3))) (* .cse53 .cse48))))) (* .cse54 3)) (- 10)) 0)) (.cse2 (= (+ (- 6) (+ (+ .cse58 (+ .cse71 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse65)) 0)) (.cse3 (or .cse73 (let ((.cse75 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse74 (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse51 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse74) (or (not .cse74) (not (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse6)) .cse19))))) (.cse4 (= (+ (let ((.cse72 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse72 (* .cse72 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse31 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse71 (+ (* .cse64 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse5 (or .cse32 (= (+ (+ (- (* .cse56 .cse62)) (* .cse62 .cse70)) (* .cse62 12)) 0) (< .cse37 .cse8))) (.cse7 (= .cse62 (* .cse37 (* .cse37 .cse37)))) (.cse23 (or (= (+ (- 6) (let ((.cse67 (+ .cse69 6))) (+ (let ((.cse66 (+ .cse69 .cse59))) (+ (- (* .cse66 12)) (+ (* .cse67 .cse66) .cse68))) (* .cse67 2)))) 0) .cse61)) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse20 (= (+ (+ (+ (- .cse64) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse40)) .cse65) (- 10)) 0)) (.cse33 (= (+ (+ (+ (+ (+ (- (* .cse56 (* 3 .cse62))) (* .cse63 .cse59)) .cse60) (- (* .cse59 10))) (* .cse56 3)) (- 10)) 0)) (.cse24 (or (= (+ (- 6) (+ (+ (- (* .cse59 12)) (+ .cse60 (* .cse56 .cse59))) .cse57)) 0) .cse61)) (.cse25 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse58 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse27 (or (= (+ (+ (+ (+ .cse40 (* .cse56 |ULTIMATE.start_main_~a~0#1|)) .cse41) .cse57) (- 10)) 0) .cse32 .cse45))) (or (let ((.cse14 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse15 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (and (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse1) (= |ULTIMATE.start_main_~n~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 1)) (<= (+ (- 1) 1) |ULTIMATE.start_main_~a~0#1|) .cse7 (<= .cse8 1) .cse9 .cse10 (= .cse6 6) (not (<= 1 |ULTIMATE.start_main_~a~0#1|)) (or .cse11 (and .cse12 .cse13 (<= (+ (- 32768) .cse14) .cse15) (<= (+ (- 65536) .cse14) .cse15))) (<= .cse0 |ULTIMATE.start_main_~a~0#1|) (or (let ((.cse17 (+ 65536 .cse15))) (and .cse16 (<= .cse17 (+ 32767 .cse14)) .cse10 (<= .cse17 (+ 65535 .cse14)))) .cse18) (>= .cse1 |ULTIMATE.start_main_~n~0#1|) (= (+ 6 (* 6 0)) .cse6))) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse19 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse26 (+ 6 12))) (and .cse20 .cse21 .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse22 (+ 19 (* (- 1) 12)))) (+ (+ (- 6) .cse22) .cse22)))) .cse4 .cse5 .cse7 .cse23 .cse9 .cse24 .cse25 (= (+ 6 .cse26) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse26)) .cse27)) (let ((.cse30 (+ 6 18))) (and .cse28 .cse21 .cse29 .cse2 .cse3 (= (+ .cse30 37) |ULTIMATE.start_main_~y~0#1|) .cse4 (= (+ .cse30 6) |ULTIMATE.start_main_~z~0#1|) .cse31 .cse5 .cse32 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse7 .cse23 .cse9 (or .cse11 .cse18) (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse33 .cse24 .cse25 .cse27)) (let ((.cse34 (+ .cse6 (- 6))) (.cse35 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and .cse20 .cse21 (= .cse34 6) .cse2 .cse3 .cse4 .cse5 (= (+ .cse34 1) .cse35) .cse7 .cse9 (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 .cse35)) (= .cse0 .cse1) .cse25 .cse27)) (let ((.cse38 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse42 (+ .cse38 1)) (.cse46 (+ .cse37 1))) (let ((.cse36 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse50 (+ .cse46 1)) (.cse49 (+ .cse42 1))) (and .cse28 (or .cse36 (not (>= .cse37 .cse38)) .cse32 (<= .cse38 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse39 (+ (* .cse38 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse39) .cse40) .cse41) (* 2 .cse39)))) 0)) .cse21 .cse29 .cse2 .cse3 .cse4 .cse31 .cse5 (or (<= .cse42 |ULTIMATE.start_main_~a~0#1|) .cse36 (= 0 (+ (let ((.cse43 (+ 6 (* .cse42 6)))) (+ (* .cse43 2) (+ (- .cse44) (+ (* .cse43 |ULTIMATE.start_main_~a~0#1|) .cse40)))) (- 10))) (not .cse45) (not (>= .cse46 .cse42))) .cse7 .cse23 .cse9 (or .cse36 (= (+ (- 10) (let ((.cse47 (+ (* .cse49 6) 6))) (+ (* .cse47 2) (+ (- .cse48) (+ (* .cse47 |ULTIMATE.start_main_~a~0#1|) .cse40))))) 0) (not (<= .cse46 |ULTIMATE.start_main_~a~0#1|)) (<= .cse49 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse50 .cse49))) (or .cse20 .cse51) .cse33 .cse24 .cse25 (let ((.cse55 (+ .cse49 1))) (or (= (+ (let ((.cse52 (+ (* 6 .cse55) 6))) (+ (* .cse52 2) (+ (- (* 2 (+ .cse53 .cse54))) (+ (* .cse52 |ULTIMATE.start_main_~a~0#1|) .cse40)))) (- 10)) 0) .cse36 (not (>= (+ .cse50 1) .cse55)) (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|)) (<= .cse55 |ULTIMATE.start_main_~a~0#1|))) .cse27)))))))))) [2023-02-18 00:59:59,210 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 00:59:59,210 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= 6 |ULTIMATE.start_main_~z~0#1|)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse8 (let ((.cse10 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse9 (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse8) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse9) (or (not .cse9) (not (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) .cse2))))))) (or (and .cse6 (= (+ (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse7 (* .cse7 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse6 .cse1 .cse2 .cse4))))) (or (and (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse5) (and .cse2 .cse3 .cse5 .cse4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ (- 6) (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 12)) (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0))))) [2023-02-18 00:59:59,210 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse21 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse33 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse47 (+ 6 (* .cse33 6))) (.cse2 (+ .cse19 .cse21)) (.cse18 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse43 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse31 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse26 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse12 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse20 (* 2 .cse21)) (.cse38 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse42 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse13 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse40 (- .cse43)) (.cse39 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse22 (- (* .cse19 18))) (.cse41 (* 2 .cse18)) (.cse4 (- (* 18 .cse2))) (.cse44 (not (= .cse47 .cse18)))) (let ((.cse16 (or (= (+ (- 6) (let ((.cse46 (+ .cse47 6))) (+ (let ((.cse45 (+ .cse47 .cse21))) (+ (- (* .cse45 12)) (+ (* .cse46 .cse45) .cse4))) (* .cse46 2)))) 0) .cse44)) (.cse23 (or (= (+ (- 6) (+ (+ (- (* .cse21 12)) (+ .cse22 (* .cse18 .cse21))) .cse41)) 0) .cse44)) (.cse0 (= (+ (+ (+ (- .cse13) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse40)) .cse39) (- 10)) 0)) (.cse5 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse43) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse14 (or .cse42 (= (+ (+ (- (* .cse18 .cse19)) (* .cse19 .cse43)) (* .cse19 12)) 0) (< .cse33 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse24 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse38 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse25 (or (= (+ (+ (+ (+ .cse40 (* .cse18 |ULTIMATE.start_main_~a~0#1|)) (- .cse20)) .cse41) (- 10)) 0) .cse42 (<= .cse33 |ULTIMATE.start_main_~a~0#1|))) (.cse32 (+ 0 1)) (.cse9 (= (+ (- 6) (+ (+ .cse38 (+ .cse12 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse39)) 0)) (.cse10 (let ((.cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse35 (let ((.cse37 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse36 (<= (+ .cse37 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse35) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse36) (or (not .cse36) (not (<= (+ .cse37 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse31)) .cse26)))))) (.cse11 (= (+ (let ((.cse34 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse34 (* .cse34 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse15 (= .cse19 (* .cse33 (* .cse33 .cse33)))) (.cse17 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse3 (+ .cse18 .cse21)) (.cse1 (+ .cse18 6))) (and .cse0 (= (+ (- 10) (+ (* .cse1 3) (+ (+ (+ (- (* .cse1 (* 3 .cse2))) (* (* 2 .cse3) .cse3)) .cse4) (- (* .cse3 10))))) 0) .cse5 (= (+ (let ((.cse8 (+ .cse1 6))) (+ (let ((.cse6 (+ .cse1 .cse3))) (+ (- (* .cse6 10)) (let ((.cse7 (+ .cse3 .cse2))) (+ (- (* .cse7 18)) (+ (- (* .cse8 (* .cse7 3))) (* .cse6 (* .cse6 2))))))) (* .cse8 3))) (- 10)) 0) .cse9 .cse10 .cse11 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse12 (+ (* .cse13 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0) .cse14 .cse15 .cse16 .cse17 (= (+ (+ (+ (+ (+ (- (* .cse18 (* 3 .cse19))) (* .cse20 .cse21)) .cse22) (- (* .cse21 10))) (* .cse18 3)) (- 10)) 0) .cse23 .cse24 .cse25)) (and .cse10 (= |ULTIMATE.start_main_~y~0#1| 1) .cse26 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse28 (+ 6 12))) (and .cse0 .cse5 .cse9 .cse10 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse27 (+ 19 (* (- 1) 12)))) (+ (+ (- 6) .cse27) .cse27)))) .cse11 .cse14 .cse15 .cse16 .cse17 .cse23 .cse24 (= (+ 6 .cse28) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse28)) .cse25)) (let ((.cse29 (+ .cse31 (- 6))) (.cse30 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and .cse0 .cse5 (= .cse29 6) .cse9 .cse10 .cse11 .cse14 (= (+ .cse29 1) .cse30) .cse15 .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse31 .cse30)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) .cse32) .cse24 .cse25)) (and (= |ULTIMATE.start_main_~x~0#1| .cse32) (= |ULTIMATE.start_main_~n~0#1| .cse32) .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse31 1)) .cse15 .cse17 (= .cse31 6) (= (+ 6 (* 6 0)) .cse31))))))) [2023-02-18 00:59:59,211 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse67 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse55 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse22 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse79 (+ .cse55 6)) (.cse77 (+ .cse55 .cse67)) (.cse58 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse78 (+ .cse58 .cse67)) (.cse45 (+ .cse79 .cse77)) (.cse75 (+ 6 (* .cse22 6))) (.cse80 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (.cse59 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse70 (* 2 .cse67))) (let ((.cse27 (- .cse70)) (.cse34 (<= .cse22 |ULTIMATE.start_main_~a~0#1|)) (.cse24 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse8 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse6 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse57 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse26 (- .cse59)) (.cse65 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse56 (* 2 .cse55)) (.cse68 (- (* .cse58 18))) (.cse12 (< .cse80 65536)) (.cse13 (<= 0 .cse80)) (.cse16 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse71 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse10 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse69 (not (= .cse75 .cse55))) (.cse64 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse66 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse38 (* .cse45 2)) (.cse46 (+ .cse79 6)) (.cse33 (* 2 .cse77)) (.cse74 (- (* 18 .cse78)))) (let ((.cse20 (= (+ (- 10) (+ (* .cse79 3) (+ (+ (+ (- (* .cse79 (* 3 .cse78))) (* .cse33 .cse77)) .cse74) (- (* .cse77 10))))) 0)) (.cse29 (= (+ (+ (+ (- (* .cse45 10)) (let ((.cse76 (+ .cse77 .cse78))) (+ (- (* .cse76 18)) (+ (- (* .cse46 (* .cse76 3))) (* .cse45 .cse38))))) (* .cse46 3)) (- 10)) 0)) (.cse30 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse64 (+ (* .cse66 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse36 (or (= (+ (- 6) (let ((.cse73 (+ .cse75 6))) (+ (let ((.cse72 (+ .cse75 .cse67))) (+ (- (* .cse72 12)) (+ (* .cse73 .cse72) .cse74))) (* .cse73 2)))) 0) .cse69)) (.cse11 (and .cse16 .cse71 .cse10)) (.cse18 (and .cse12 .cse13 (not .cse71))) (.cse41 (= (+ (+ (+ (+ (+ (- (* .cse55 (* 3 .cse58))) (* .cse70 .cse67)) .cse68) (- (* .cse67 10))) (* .cse55 3)) (- 10)) 0)) (.cse42 (or (= (+ (- 6) (+ (+ (- (* .cse67 12)) (+ .cse68 (* .cse55 .cse67))) .cse56)) 0) .cse69)) (.cse19 (= (+ (+ (+ (- .cse66) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse26)) .cse65) (- 10)) 0)) (.cse28 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse59) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse2 (= (+ (- 6) (+ (+ .cse57 (+ .cse64 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse65)) 0)) (.cse3 (let ((.cse61 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse61 (let ((.cse63 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse62 (<= (+ .cse63 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse61) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse62) (or (not .cse62) (not (<= (+ .cse63 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse6)) .cse49)))))) (.cse4 (= (+ (let ((.cse60 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse60 (* .cse60 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (or .cse24 (= (+ (+ (- (* .cse55 .cse58)) (* .cse58 .cse59)) (* .cse58 12)) 0) (< .cse22 .cse8))) (.cse7 (= .cse58 (* .cse22 (* .cse22 .cse22)))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse1 (+ 0 1)) (.cse43 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse57 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse48 (or (= (+ (+ (+ (+ .cse26 (* .cse55 |ULTIMATE.start_main_~a~0#1|)) .cse27) .cse56) (- 10)) 0) .cse24 .cse34))) (or (let ((.cse14 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse15 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536)))) (and (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse1) (= |ULTIMATE.start_main_~n~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 1)) (<= (+ (- 1) 1) |ULTIMATE.start_main_~a~0#1|) .cse7 (<= .cse8 1) .cse9 .cse10 (= .cse6 6) (not (<= 1 |ULTIMATE.start_main_~a~0#1|)) (or .cse11 (and .cse12 .cse13 (<= (+ (- 32768) .cse14) .cse15) (<= (+ (- 65536) .cse14) .cse15))) (<= .cse0 |ULTIMATE.start_main_~a~0#1|) (or (let ((.cse17 (+ 65536 .cse15))) (and .cse16 (<= .cse17 (+ 32767 .cse14)) .cse10 (<= .cse17 (+ 65535 .cse14)))) .cse18) (>= .cse1 |ULTIMATE.start_main_~n~0#1|) (= (+ 6 (* 6 0)) .cse6))) (let ((.cse23 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse31 (+ .cse23 1)) (.cse35 (+ .cse22 1))) (let ((.cse21 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse40 (+ .cse35 1)) (.cse39 (+ .cse31 1))) (and .cse19 .cse20 (or .cse21 (not (>= .cse22 .cse23)) .cse24 (<= .cse23 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse25 (+ (* .cse23 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse25) .cse26) .cse27) (* 2 .cse25)))) 0)) .cse28 .cse29 .cse2 .cse3 .cse4 .cse30 .cse5 (or (<= .cse31 |ULTIMATE.start_main_~a~0#1|) .cse21 (= 0 (+ (let ((.cse32 (+ 6 (* .cse31 6)))) (+ (* .cse32 2) (+ (- .cse33) (+ (* .cse32 |ULTIMATE.start_main_~a~0#1|) .cse26)))) (- 10))) (not .cse34) (not (>= .cse35 .cse31))) .cse7 .cse36 .cse9 (or .cse21 (= (+ (- 10) (let ((.cse37 (+ (* .cse39 6) 6))) (+ (* .cse37 2) (+ (- .cse38) (+ (* .cse37 |ULTIMATE.start_main_~a~0#1|) .cse26))))) 0) (not (<= .cse35 |ULTIMATE.start_main_~a~0#1|)) (<= .cse39 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse40 .cse39))) .cse41 .cse42 .cse43 (let ((.cse47 (+ .cse39 1))) (or (= (+ (let ((.cse44 (+ (* 6 .cse47) 6))) (+ (* .cse44 2) (+ (- (* 2 (+ .cse45 .cse46))) (+ (* .cse44 |ULTIMATE.start_main_~a~0#1|) .cse26)))) (- 10)) 0) .cse21 (not (>= (+ .cse40 1) .cse47)) (not (<= .cse40 |ULTIMATE.start_main_~a~0#1|)) (<= .cse47 |ULTIMATE.start_main_~a~0#1|))) .cse48)))) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse49 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse51 (+ 6 12))) (and .cse19 .cse28 .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse50 (+ 19 (* (- 1) 12)))) (+ (+ (- 6) .cse50) .cse50)))) .cse4 .cse5 .cse7 .cse36 .cse9 .cse42 .cse43 (= (+ 6 .cse51) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse51)) .cse48)) (let ((.cse52 (+ 6 18))) (and .cse20 .cse28 .cse29 .cse2 .cse3 (= (+ .cse52 37) |ULTIMATE.start_main_~y~0#1|) .cse4 (= (+ .cse52 6) |ULTIMATE.start_main_~z~0#1|) .cse30 .cse5 .cse24 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse7 .cse36 .cse9 (or .cse11 .cse18) (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse41 .cse42 .cse43 .cse48)) (let ((.cse53 (+ .cse6 (- 6))) (.cse54 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and .cse19 .cse28 (= .cse53 6) .cse2 .cse3 .cse4 .cse5 (= (+ .cse53 1) .cse54) .cse7 .cse9 (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 .cse54)) (= .cse0 .cse1) .cse43 .cse48)))))))) [2023-02-18 00:59:59,211 INFO L899 garLoopResultBuilder]: For program point L37(lines 32 45) no Hoare annotation was computed. [2023-02-18 00:59:59,212 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse65 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse42 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse69 (* 2 .cse63)) (.cse74 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse85 (+ .cse65 6)) (.cse83 (+ .cse65 .cse63)) (.cse68 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse95 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse76 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse81 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse92 (< .cse95 65536)) (.cse93 (<= 0 .cse95)) (.cse86 (< |ULTIMATE.start_main_~a~0#1| 65536)) (.cse94 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (.cse40 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse84 (+ .cse68 .cse63)) (.cse56 (+ .cse85 .cse83)) (.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse61 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse45 (- .cse74)) (.cse46 (- .cse69)) (.cse66 (* 2 .cse65)) (.cse73 (+ 6 (* .cse42 6)))) (let ((.cse64 (- (* .cse68 18))) (.cse67 (not (= .cse73 .cse65))) (.cse35 (= (+ (+ (+ (+ .cse45 (* .cse65 |ULTIMATE.start_main_~a~0#1|)) .cse46) .cse66) (- 10)) 0)) (.cse37 (<= .cse42 |ULTIMATE.start_main_~a~0#1|)) (.cse36 (not .cse61)) (.cse60 (not .cse78)) (.cse29 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse25 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse62 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse75 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse52 (* .cse56 2)) (.cse57 (+ .cse85 6)) (.cse49 (* 2 .cse83)) (.cse72 (- (* 18 .cse84))) (.cse88 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) (.cse89 (* 65536 (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536))) (.cse91 (and .cse86 .cse94 .cse40)) (.cse90 (and .cse92 .cse93 (not .cse94))) (.cse34 (+ 0 1)) (.cse59 (= (+ (+ (+ (- .cse76) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse45)) .cse81) (- 10)) 0))) (let ((.cse4 (+ 6 18)) (.cse17 (or .cse59 .cse61)) (.cse21 (+ 6 12)) (.cse22 (+ .cse34 1)) (.cse19 (* (- 1) 12)) (.cse13 (or .cse91 .cse90)) (.cse26 (or .cse91 (and .cse92 .cse93 (<= (+ (- 32768) .cse88) .cse89) (<= (+ (- 65536) .cse88) .cse89)))) (.cse23 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse27 (or (let ((.cse87 (+ 65536 .cse89))) (and .cse86 (<= .cse87 (+ 32767 .cse88)) .cse40 (<= .cse87 (+ 65535 .cse88)))) .cse90)) (.cse0 (= (+ (- 10) (+ (* .cse85 3) (+ (+ (+ (- (* .cse85 (* 3 .cse84))) (* .cse49 .cse83)) .cse72) (- (* .cse83 10))))) 0)) (.cse1 (= (+ (+ (+ (- (* .cse56 10)) (let ((.cse82 (+ .cse83 .cse84))) (+ (- (* .cse82 18)) (+ (- (* .cse57 (* .cse82 3))) (* .cse56 .cse52))))) (* .cse57 3)) (- 10)) 0)) (.cse2 (= (+ (- 6) (+ (+ .cse62 (+ .cse75 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse81)) 0)) (.cse3 (or .cse78 (let ((.cse80 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse79 (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse60 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse79) (or (not .cse79) (not (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse29)) .cse25))))) (.cse5 (= (+ (let ((.cse77 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse77 (* .cse77 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse75 (+ (* .cse76 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse7 (or .cse36 (= (+ (+ (- (* .cse65 .cse68)) (* .cse68 .cse74)) (* .cse68 12)) 0) (< .cse42 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse8 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse74) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0) .cse61)) (.cse9 (= .cse68 (* .cse42 (* .cse42 .cse42)))) (.cse10 (or .cse60 .cse35 .cse36 .cse37)) (.cse11 (or (= (+ (- 6) (let ((.cse71 (+ .cse73 6))) (+ (let ((.cse70 (+ .cse73 .cse63))) (+ (- (* .cse70 12)) (+ (* .cse71 .cse70) .cse72))) (* .cse71 2)))) 0) .cse67)) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse14 (= (+ (+ (+ (+ (+ (- (* .cse65 (* 3 .cse68))) (* .cse69 .cse63)) .cse64) (- (* .cse63 10))) (* .cse65 3)) (- 10)) 0)) (.cse15 (or (= (+ (- 6) (+ (+ (- (* .cse63 12)) (+ .cse64 (* .cse65 .cse63))) .cse66)) 0) .cse67)) (.cse16 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse62 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse24 (or .cse59 .cse60 .cse61))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ .cse4 37) |ULTIMATE.start_main_~y~0#1|) .cse5 (= (+ .cse4 6) |ULTIMATE.start_main_~z~0#1|) .cse6 .cse7 (<= 3 |ULTIMATE.start_main_~a~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (>= (+ 3 1) |ULTIMATE.start_main_~n~0#1|) .cse14 .cse15 .cse16) (and (= .cse4 |ULTIMATE.start_main_~z~0#1|) .cse2 .cse17 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ 19 (let ((.cse18 (+ 19 .cse19))) (+ (+ (- 6) .cse18) .cse18)))) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (let ((.cse20 (+ (- 6) 18))) (= (+ (+ (- 6) .cse20) 1) (+ (* (- 1) .cse20) (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18))))) .cse15 .cse16 (= (+ 6 .cse21) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 19 .cse21)) (= .cse22 .cse23) .cse24) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse25 .cse13 (= |ULTIMATE.start_main_~x~0#1| 0) .cse26 .cse27 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse31 (+ .cse19 |ULTIMATE.start_main_~y~0#1|)) (.cse30 (+ .cse29 (- 6)))) (let ((.cse28 (+ .cse30 1)) (.cse32 (+ .cse31 (- 6))) (.cse33 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (and (= .cse28 (+ (* (- 1) .cse29) |ULTIMATE.start_main_~y~0#1|)) (= .cse30 6) .cse17 .cse3 .cse5 .cse7 (= (+ .cse31 .cse32) |ULTIMATE.start_main_~x~0#1|) (= .cse28 .cse33) (= |ULTIMATE.start_main_~z~0#1| .cse21) .cse8 .cse9 (= (+ .cse31 (* (- 1) (+ (+ 6 (* (- 1) .cse31) .cse32) .cse31 (* (- 1) .cse32)))) 1) .cse12 (= .cse22 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse29 .cse33)) .cse13 (= .cse23 .cse34) .cse16 .cse24 (or .cse35 .cse36 .cse37)))) (let ((.cse39 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) 6 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse38 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) .cse39))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse38)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) (= .cse23 0) (= |ULTIMATE.start_main_~x~0#1| .cse34) (= |ULTIMATE.start_main_~n~0#1| .cse34) .cse2 .cse3 .cse5 .cse7 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse29 1)) .cse9 (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse38)) 1) .cse12 (= .cse39 0) .cse13 .cse40 (= .cse29 6) .cse26 (<= .cse23 |ULTIMATE.start_main_~a~0#1|) .cse27 (>= .cse34 |ULTIMATE.start_main_~n~0#1|) .cse24 (= (+ 6 (* 6 0)) .cse29)))) (let ((.cse43 (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (let ((.cse47 (+ .cse43 1)) (.cse50 (+ .cse42 1))) (let ((.cse41 (not (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))) (.cse54 (+ .cse50 1)) (.cse53 (+ .cse47 1))) (and .cse0 (or .cse41 (not (>= .cse42 .cse43)) .cse36 (<= .cse43 |ULTIMATE.start_main_~a~0#1|) (= (+ (- 10) (let ((.cse44 (+ (* .cse43 6) 6))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse44) .cse45) .cse46) (* 2 .cse44)))) 0)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (or (<= .cse47 |ULTIMATE.start_main_~a~0#1|) .cse41 (= 0 (+ (let ((.cse48 (+ 6 (* .cse47 6)))) (+ (* .cse48 2) (+ (- .cse49) (+ (* .cse48 |ULTIMATE.start_main_~a~0#1|) .cse45)))) (- 10))) (not .cse37) (not (>= .cse50 .cse47))) .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse41 (= (+ (- 10) (let ((.cse51 (+ (* .cse53 6) 6))) (+ (* .cse51 2) (+ (- .cse52) (+ (* .cse51 |ULTIMATE.start_main_~a~0#1|) .cse45))))) 0) (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|)) (<= .cse53 |ULTIMATE.start_main_~a~0#1|) (not (>= .cse54 .cse53))) .cse14 .cse15 .cse16 (let ((.cse58 (+ .cse53 1))) (or (= (+ (let ((.cse55 (+ (* 6 .cse58) 6))) (+ (* .cse55 2) (+ (- (* 2 (+ .cse56 .cse57))) (+ (* .cse55 |ULTIMATE.start_main_~a~0#1|) .cse45)))) (- 10)) 0) .cse41 (not (>= (+ .cse54 1) .cse58)) (not (<= .cse54 |ULTIMATE.start_main_~a~0#1|)) (<= .cse58 |ULTIMATE.start_main_~a~0#1|))) .cse24)))))))))) [2023-02-18 00:59:59,212 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 00:59:59,212 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 00:59:59,212 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 00:59:59,212 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 00:59:59,213 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 00:59:59,213 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 00:59:59,215 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:59:59,216 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 00:59:59,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 12:59:59 BoogieIcfgContainer [2023-02-18 00:59:59,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 00:59:59,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 00:59:59,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 00:59:59,275 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 00:59:59,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:59:03" (3/4) ... [2023-02-18 00:59:59,277 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 00:59:59,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 00:59:59,284 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-18 00:59:59,284 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 00:59:59,284 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 00:59:59,284 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 00:59:59,309 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 00:59:59,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 00:59:59,310 INFO L158 Benchmark]: Toolchain (without parser) took 56767.54ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 100.4MB in the beginning and 147.2MB in the end (delta: -46.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-02-18 00:59:59,310 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 47.7MB in the beginning and 47.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:59:59,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.06ms. Allocated memory is still 148.9MB. Free memory was 100.4MB in the beginning and 89.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 00:59:59,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 88.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:59:59,311 INFO L158 Benchmark]: Boogie Preprocessor took 13.18ms. Allocated memory is still 148.9MB. Free memory was 88.1MB in the beginning and 86.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:59:59,311 INFO L158 Benchmark]: RCFGBuilder took 273.87ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 76.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 00:59:59,311 INFO L158 Benchmark]: TraceAbstraction took 56243.05ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 75.6MB in the beginning and 150.4MB in the end (delta: -74.8MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2023-02-18 00:59:59,312 INFO L158 Benchmark]: Witness Printer took 37.42ms. Allocated memory is still 207.6MB. Free memory was 150.4MB in the beginning and 147.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:59:59,315 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.14ms. Allocated memory is still 98.6MB. Free memory was 47.7MB in the beginning and 47.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.06ms. Allocated memory is still 148.9MB. Free memory was 100.4MB in the beginning and 89.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 88.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.18ms. Allocated memory is still 148.9MB. Free memory was 88.1MB in the beginning and 86.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.87ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 76.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 56243.05ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 75.6MB in the beginning and 150.4MB in the end (delta: -74.8MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Witness Printer took 37.42ms. Allocated memory is still 207.6MB. Free memory was 150.4MB in the beginning and 147.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 17]: 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.1s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 48.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 42.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 42.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3804 IncrementalHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 286 mSDtfsCounter, 3804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1313 GetRequests, 1133 SyntacticMatches, 7 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=10, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 84 PreInvPairs, 152 NumberOfFragments, 31974 HoareAnnotationTreeSize, 84 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 654 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1272 ConstructedInterpolants, 0 QuantifiedInterpolants, 15381 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 272 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 6954/7650 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: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((z + -6 + -6 + 1 == -1 * (z + -6) + y && z + -6 + -6 == 6) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && -1 * 12 + y + (-1 * 12 + y + -6) == x) && z + -6 + -6 + 1 == -1 + x) && z == 6 + 12) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && -1 * 12 + y + -1 * (6 + -1 * (-1 * 12 + y) + (-1 * 12 + y + -6) + (-1 * 12 + y) + -1 * (-1 * 12 + y + -6)) == 1) && x == n * (n * n)) && 0 + 1 + 1 == n) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && y == z + -6 + (-1 + x)) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 + n == 0 + 1) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && ((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || !(z == 6 + 6 * n)) || n <= a)) && ((-(6 * a) + (6 + z) * a + -(2 * (y + z)) + 2 * (6 + z) + -10 == 0 || !(n <= a)) || n + 1 <= a)) || ((((((((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && y == 1) && n == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && x == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || (((65536 + a < 65536 && 0 <= 65536 + a) && -32768 + -1 * a <= 65536 * ((-a + -1) / 65536)) && -65536 + -1 * a <= 65536 * ((-a + -1) / 65536)))) && ((((a < 65536 && 65536 + 65536 * ((-a + -1) / 65536) <= 32767 + -1 * a) && 0 <= a) && 65536 + 65536 * ((-a + -1) / 65536) <= 65535 + -1 * a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 6 == z)) || (((((((((((((((((((((z == 6 + (y + -1 * x + (-1 * y + 6 + x)) && x + -1 * 1 == 0) && -1 + n == 0) && x == 0 + 1) && n == 0 + 1) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && y == z + -6 + 1) && x + y == (n + 1) * ((n + 1) * (n + 1))) && y + -1 * (y + -1 * x + (-1 * y + 6 + x)) == 1) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && -1 * y + 6 + x == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 0 <= a) && z + -6 == 6) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || (((65536 + a < 65536 && 0 <= 65536 + a) && -32768 + -1 * a <= 65536 * ((-a + -1) / 65536)) && -65536 + -1 * a <= 65536 * ((-a + -1) / 65536)))) && -1 + n <= a) && ((((a < 65536 && 65536 + 65536 * ((-a + -1) / 65536) <= 32767 + -1 * a) && 0 <= a) && 65536 + 65536 * ((-a + -1) / 65536) <= 65535 + -1 * a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 0 + 1 >= n) && ((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || !(z == 6 + 6 * n)) || n <= a)) && 6 + 6 * 0 == z + -6)) || ((((((((((((((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 && -((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0) && 6 + 18 + 37 == y) && 6 + 18 + 6 == z) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && 3 <= a) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 3 + 1 >= n) && -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && (-6 + (-((y + z) * 12) + (-((x + y) * 18) + (6 + z) * (y + z)) + 2 * (6 + z)) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) || ((((((((((((((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 && ((((!(5 * z % 6 == 0) || !(n + 1 >= -z / -6)) || !(n <= a)) || -z / -6 <= a) || -10 + (a * (-z / -6 * 6 + 6) + -(6 * a) + -(2 * (y + z)) + 2 * (-z / -6 * 6 + 6)) == 0)) && -((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && ((((-z / -6 + 1 <= a || !(5 * z % 6 == 0)) || 0 == (6 + (-z / -6 + 1) * 6) * 2 + (-(2 * (6 + z + (y + z))) + ((6 + (-z / -6 + 1) * 6) * a + -(6 * a))) + -10) || !(n + 1 <= a)) || !(n + 1 + 1 >= -z / -6 + 1))) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && x == n * (n * n)) && ((((!(5 * z % 6 == 0) || -10 + (((-z / -6 + 1 + 1) * 6 + 6) * 2 + (-((6 + z + 6 + (6 + z + (y + z))) * 2) + (((-z / -6 + 1 + 1) * 6 + 6) * a + -(6 * a)))) == 0) || !(n + 1 + 1 <= a)) || -z / -6 + 1 + 1 <= a) || !(n + 1 + 1 + 1 >= -z / -6 + 1 + 1))) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && (-6 + (-((y + z) * 12) + (-((x + y) * 18) + (6 + z) * (y + z)) + 2 * (6 + z)) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (((((6 * (-z / -6 + 1 + 1 + 1) + 6) * 2 + (-(2 * (6 + z + 6 + (6 + z + (y + z)) + (6 + z + 6 + 6))) + ((6 * (-z / -6 + 1 + 1 + 1) + 6) * a + -(6 * a))) + -10 == 0 || !(5 * z % 6 == 0)) || !(n + 1 + 1 + 1 + 1 >= -z / -6 + 1 + 1 + 1)) || !(n + 1 + 1 + 1 <= a)) || -z / -6 + 1 + 1 + 1 <= a)) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) && ((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || !(z == 6 + 6 * n)) || n <= a))) || (((((((((((((((6 + 18 == z && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && x == 19 + (-6 + (19 + -1 * 12) + (19 + -1 * 12))) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && (-6 + (-((6 + (n + 1) * 6 + (y + z)) * 12) + ((6 + (n + 1) * 6 + 6) * (6 + (n + 1) * 6 + (y + z)) + -(18 * (x + y + (y + z)))) + (6 + (n + 1) * 6 + 6) * 2) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -6 + (-6 + 18) + 1 == -1 * (-6 + 18) + (y + -1 * 18)) && (-6 + (-((y + z) * 12) + (-((x + y) * 18) + (6 + z) * (y + z)) + 2 * (6 + z)) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + (6 + 12) == z) && y == 19 + (6 + 12)) && 0 + 1 + 1 == -1 + n) && ((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || !(z == 6 + 6 * n)) || n <= a))) || (((((((((((((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 && ((((!(5 * z % 6 == 0) || !(n + 1 >= -z / -6)) || !(n <= a)) || -z / -6 <= a) || -10 + (a * (-z / -6 * 6 + 6) + -(6 * a) + -(2 * (y + z)) + 2 * (-z / -6 * 6 + 6)) == 0)) && -((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && ((((-z / -6 + 1 <= a || !(5 * z % 6 == 0)) || 0 == (6 + (-z / -6 + 1) * 6) * 2 + (-(2 * (6 + z + (y + z))) + ((6 + (-z / -6 + 1) * 6) * a + -(6 * a))) + -10) || !(n + 1 <= a)) || !(n + 1 + 1 >= -z / -6 + 1))) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && x == n * (n * n)) && ((((!(5 * z % 6 == 0) || -10 + (((-z / -6 + 1 + 1) * 6 + 6) * 2 + (-((6 + z + 6 + (6 + z + (y + z))) * 2) + (((-z / -6 + 1 + 1) * 6 + 6) * a + -(6 * a)))) == 0) || !(n + 1 + 1 <= a)) || -z / -6 + 1 + 1 <= a) || !(n + 1 + 1 + 1 >= -z / -6 + 1 + 1))) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && (-6 + (-((y + z) * 12) + (-((x + y) * 18) + (6 + z) * (y + z)) + 2 * (6 + z)) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) && ((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || !(z == 6 + 6 * n)) || n <= a)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-18 00:59:59,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE