./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 574ddb4e 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-?-574ddb4 [2023-02-17 06:45:55,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:45:55,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:45:55,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:45:55,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:45:55,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:45:55,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:45:55,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:45:55,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:45:55,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:45:55,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:45:55,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:45:55,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:45:55,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:45:55,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:45:55,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:45:55,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:45:55,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:45:55,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:45:55,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:45:55,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:45:55,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:45:55,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:45:55,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:45:55,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:45:55,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:45:55,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:45:55,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:45:55,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:45:55,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:45:55,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:45:55,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:45:55,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:45:55,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:45:55,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:45:55,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:45:55,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:45:55,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:45:55,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:45:55,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:45:55,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:45:55,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:45:55,352 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:45:55,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:45:55,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:45:55,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:45:55,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:45:55,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:45:55,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:45:55,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:45:55,359 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:45:55,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:45:55,360 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:45:55,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:45:55,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:45:55,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:45:55,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:45:55,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:45:55,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:45:55,361 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:45:55,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:45:55,362 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:45:55,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:45:55,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:45:55,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:45:55,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:45:55,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:45:55,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:45:55,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:45:55,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:45:55,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:45:55,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:45:55,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:45:55,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:45:55,364 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:45:55,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:45:55,364 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:45:55,365 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-17 06:45:55,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:45:55,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:45:55,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:45:55,577 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:45:55,577 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:45:55,578 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-17 06:45:56,440 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:45:56,620 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:45:56,621 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu-ll.c [2023-02-17 06:45:56,624 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadfab281/96957c323c5b4811a61dd1f89fef1233/FLAG7b482ca37 [2023-02-17 06:45:56,637 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadfab281/96957c323c5b4811a61dd1f89fef1233 [2023-02-17 06:45:56,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:45:56,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:45:56,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:45:56,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:45:56,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:45:56,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f9b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56, skipping insertion in model container [2023-02-17 06:45:56,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:45:56,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:45:56,781 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-17 06:45:56,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:45:56,812 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:45:56,819 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-17 06:45:56,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:45:56,833 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:45:56,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56 WrapperNode [2023-02-17 06:45:56,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:45:56,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:45:56,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:45:56,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:45:56,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,855 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-02-17 06:45:56,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:45:56,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:45:56,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:45:56,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:45:56,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,866 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:45:56,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:45:56,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:45:56,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:45:56,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (1/1) ... [2023-02-17 06:45:56,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:45:56,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:45:56,901 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-17 06:45:56,922 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-17 06:45:56,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:45:56,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:45:56,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:45:56,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:45:56,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 06:45:56,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 06:45:56,972 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:45:56,974 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:45:57,057 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:45:57,061 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:45:57,062 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 06:45:57,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:45:57 BoogieIcfgContainer [2023-02-17 06:45:57,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:45:57,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:45:57,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:45:57,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:45:57,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:45:56" (1/3) ... [2023-02-17 06:45:57,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24649b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:45:57, skipping insertion in model container [2023-02-17 06:45:57,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:45:56" (2/3) ... [2023-02-17 06:45:57,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24649b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:45:57, skipping insertion in model container [2023-02-17 06:45:57,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:45:57" (3/3) ... [2023-02-17 06:45:57,068 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2023-02-17 06:45:57,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:45:57,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 06:45:57,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:45:57,116 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;@6a1ece81, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:45:57,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 06:45:57,119 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-17 06:45:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 06:45:57,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:45:57,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:45:57,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:45:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:45:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1823012769, now seen corresponding path program 1 times [2023-02-17 06:45:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:45:57,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189690856] [2023-02-17 06:45:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:45:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:45:57,241 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-17 06:45:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:45:57,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189690856] [2023-02-17 06:45:57,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189690856] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:45:57,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:45:57,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 06:45:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090140860] [2023-02-17 06:45:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:45:57,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 06:45:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:45:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 06:45:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 06:45:57,277 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-17 06:45:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:45:57,298 INFO L93 Difference]: Finished difference Result 48 states and 85 transitions. [2023-02-17 06:45:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 06:45:57,302 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-17 06:45:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:45:57,307 INFO L225 Difference]: With dead ends: 48 [2023-02-17 06:45:57,308 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 06:45:57,313 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-17 06:45:57,317 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-17 06:45:57,318 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-17 06:45:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 06:45:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-17 06:45:57,347 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-17 06:45:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2023-02-17 06:45:57,350 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2023-02-17 06:45:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:45:57,351 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2023-02-17 06:45:57,352 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-17 06:45:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2023-02-17 06:45:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 06:45:57,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:45:57,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:45:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 06:45:57,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:45:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:45:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1811632607, now seen corresponding path program 1 times [2023-02-17 06:45:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:45:57,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273771417] [2023-02-17 06:45:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:45:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:45:57,559 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-17 06:45:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:45:57,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273771417] [2023-02-17 06:45:57,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273771417] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:45:57,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:45:57,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:45:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035503734] [2023-02-17 06:45:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:45:57,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:45:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:45:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:45:57,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:45:57,566 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-17 06:45:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:45:57,649 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2023-02-17 06:45:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:45:57,649 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-17 06:45:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:45:57,650 INFO L225 Difference]: With dead ends: 27 [2023-02-17 06:45:57,650 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 06:45:57,651 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-17 06:45:57,651 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-17 06:45:57,652 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-17 06:45:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 06:45:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-17 06:45:57,660 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-17 06:45:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-02-17 06:45:57,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2023-02-17 06:45:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:45:57,662 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-02-17 06:45:57,662 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-17 06:45:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-02-17 06:45:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 06:45:57,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:45:57,663 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:45:57,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 06:45:57,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:45:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:45:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1582559355, now seen corresponding path program 1 times [2023-02-17 06:45:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:45:57,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761374872] [2023-02-17 06:45:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:57,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:45:57,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:45:57,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469570594] [2023-02-17 06:45:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:57,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:45:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:45:57,676 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-17 06:45:57,695 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-17 06:45:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:45:57,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 06:45:57,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:45:57,828 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-17 06:45:57,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:45:57,910 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-17 06:45:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:45:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761374872] [2023-02-17 06:45:57,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:45:57,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469570594] [2023-02-17 06:45:57,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469570594] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:45:57,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:45:57,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:45:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494883324] [2023-02-17 06:45:57,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:45:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:45:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:45:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:45:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:45:57,921 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-17 06:45:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:45:58,368 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2023-02-17 06:45:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 06:45:58,369 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-17 06:45:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:45:58,371 INFO L225 Difference]: With dead ends: 50 [2023-02-17 06:45:58,371 INFO L226 Difference]: Without dead ends: 48 [2023-02-17 06:45:58,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:45:58,372 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:45:58,372 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.4s Time] [2023-02-17 06:45:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-17 06:45:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-02-17 06:45:58,383 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-17 06:45:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-02-17 06:45:58,384 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 12 [2023-02-17 06:45:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:45:58,384 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-02-17 06:45:58,384 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-17 06:45:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-02-17 06:45:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 06:45:58,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:45:58,385 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:45:58,399 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-17 06:45:58,589 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-17 06:45:58,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:45:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:45:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 424345951, now seen corresponding path program 1 times [2023-02-17 06:45:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:45:58,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972656885] [2023-02-17 06:45:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:45:58,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:45:58,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989252064] [2023-02-17 06:45:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:45:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:45:58,599 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-17 06:45:58,601 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-17 06:45:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:45:58,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 06:45:58,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:45:58,693 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-17 06:45:58,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:45:58,736 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-17 06:45:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:45:58,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972656885] [2023-02-17 06:45:58,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:45:58,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989252064] [2023-02-17 06:45:58,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989252064] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:45:58,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:45:58,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:45:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225492052] [2023-02-17 06:45:58,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:45:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:45:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:45:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:45:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:45:58,738 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-17 06:45:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:45:58,943 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2023-02-17 06:45:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 06:45:58,945 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-17 06:45:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:45:58,946 INFO L225 Difference]: With dead ends: 52 [2023-02-17 06:45:58,946 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 06:45:58,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:45:58,947 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-17 06:45:58,947 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-17 06:45:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 06:45:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-02-17 06:45:58,963 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-17 06:45:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-02-17 06:45:58,966 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 17 [2023-02-17 06:45:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:45:58,966 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-02-17 06:45:58,966 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-17 06:45:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-02-17 06:45:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 06:45:58,967 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:45:58,968 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:45:58,975 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-17 06:45:59,174 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-17 06:45:59,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:45:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:45:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1752711045, now seen corresponding path program 1 times [2023-02-17 06:45:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:45:59,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423177236] [2023-02-17 06:45:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:45:59,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:45:59,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390368292] [2023-02-17 06:45:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:45:59,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:45:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:45:59,198 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-17 06:45:59,200 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-17 06:45:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:45:59,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 06:45:59,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:45:59,275 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-17 06:45:59,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:45:59,372 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-17 06:45:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:45:59,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423177236] [2023-02-17 06:45:59,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:45:59,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390368292] [2023-02-17 06:45:59,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390368292] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:45:59,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:45:59,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:45:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720493534] [2023-02-17 06:45:59,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:45:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:45:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:45:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:45:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:45:59,378 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-17 06:46:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:00,099 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-17 06:46:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 06:46:00,100 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-17 06:46:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:00,101 INFO L225 Difference]: With dead ends: 65 [2023-02-17 06:46:00,101 INFO L226 Difference]: Without dead ends: 56 [2023-02-17 06:46:00,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:46:00,102 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:00,102 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.7s Time] [2023-02-17 06:46:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-17 06:46:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-17 06:46:00,114 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-17 06:46:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-02-17 06:46:00,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2023-02-17 06:46:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:00,115 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-02-17 06:46:00,115 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-17 06:46:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-02-17 06:46:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 06:46:00,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:00,116 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-17 06:46:00,137 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-17 06:46:00,322 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-17 06:46:00,323 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:00,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash 190158181, now seen corresponding path program 1 times [2023-02-17 06:46:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:00,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511091020] [2023-02-17 06:46:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:00,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:00,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645808729] [2023-02-17 06:46:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:00,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:00,331 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-17 06:46:00,335 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-17 06:46:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:46:00,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 06:46:00,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:00,404 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-17 06:46:00,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:00,477 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-17 06:46:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:00,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511091020] [2023-02-17 06:46:00,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:00,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645808729] [2023-02-17 06:46:00,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645808729] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:00,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:00,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-17 06:46:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94034515] [2023-02-17 06:46:00,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:00,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 06:46:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 06:46:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:46:00,481 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-17 06:46:02,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:46:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:03,140 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2023-02-17 06:46:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 06:46:03,141 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-17 06:46:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:03,142 INFO L225 Difference]: With dead ends: 80 [2023-02-17 06:46:03,142 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 06:46:03,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-17 06:46:03,143 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-17 06:46:03,143 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-17 06:46:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 06:46:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-02-17 06:46:03,158 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-17 06:46:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-02-17 06:46:03,159 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 44 [2023-02-17 06:46:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:03,159 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-02-17 06:46:03,159 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-17 06:46:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-02-17 06:46:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 06:46:03,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:03,160 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-17 06:46:03,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 06:46:03,361 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-17 06:46:03,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1122712219, now seen corresponding path program 2 times [2023-02-17 06:46:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:03,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624387359] [2023-02-17 06:46:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:03,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:03,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:03,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911077341] [2023-02-17 06:46:03,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:46:03,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:03,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:03,370 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-17 06:46:03,375 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-17 06:46:03,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:46:03,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:46:03,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 06:46:03,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:03,443 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-17 06:46:03,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:03,493 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-17 06:46:03,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:03,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624387359] [2023-02-17 06:46:03,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:03,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911077341] [2023-02-17 06:46:03,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911077341] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:03,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:03,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:46:03,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131944765] [2023-02-17 06:46:03,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:03,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:46:03,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:03,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:46:03,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:46:03,496 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-17 06:46:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:03,927 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2023-02-17 06:46:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 06:46:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 54 [2023-02-17 06:46:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:03,929 INFO L225 Difference]: With dead ends: 84 [2023-02-17 06:46:03,929 INFO L226 Difference]: Without dead ends: 79 [2023-02-17 06:46:03,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:46:03,929 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:03,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 57 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 06:46:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-17 06:46:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-17 06:46:03,943 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-17 06:46:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2023-02-17 06:46:03,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 54 [2023-02-17 06:46:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:03,944 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2023-02-17 06:46:03,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-17 06:46:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2023-02-17 06:46:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 06:46:03,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:03,951 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-17 06:46:03,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 06:46:04,155 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-17 06:46:04,155 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1898506858, now seen corresponding path program 1 times [2023-02-17 06:46:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822574470] [2023-02-17 06:46:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:04,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:04,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226079426] [2023-02-17 06:46:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:04,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:04,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:04,169 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-17 06:46:04,171 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-17 06:46:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:46:04,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 06:46:04,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:04,427 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-17 06:46:04,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:04,564 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-17 06:46:04,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822574470] [2023-02-17 06:46:04,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226079426] [2023-02-17 06:46:04,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226079426] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:04,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:04,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-17 06:46:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999923704] [2023-02-17 06:46:04,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:04,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 06:46:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 06:46:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:46:04,567 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-17 06:46:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:04,878 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-02-17 06:46:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 06:46:04,879 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-17 06:46:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:04,880 INFO L225 Difference]: With dead ends: 85 [2023-02-17 06:46:04,880 INFO L226 Difference]: Without dead ends: 83 [2023-02-17 06:46:04,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-02-17 06:46:04,880 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:04,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 06:46:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-17 06:46:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-17 06:46:04,905 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-17 06:46:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-02-17 06:46:04,907 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 65 [2023-02-17 06:46:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:04,907 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-02-17 06:46:04,907 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-17 06:46:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-02-17 06:46:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 06:46:04,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:04,910 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-17 06:46:04,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 06:46:05,115 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-17 06:46:05,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash 161977518, now seen corresponding path program 1 times [2023-02-17 06:46:05,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:05,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155208040] [2023-02-17 06:46:05,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:05,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:05,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778807513] [2023-02-17 06:46:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:05,130 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-17 06:46:05,132 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-17 06:46:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:46:05,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 06:46:05,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:05,306 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-17 06:46:05,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:05,449 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-17 06:46:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155208040] [2023-02-17 06:46:05,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778807513] [2023-02-17 06:46:05,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778807513] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:05,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:05,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 06:46:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688159123] [2023-02-17 06:46:05,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 06:46:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 06:46:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-17 06:46:05,452 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-17 06:46:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:06,043 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2023-02-17 06:46:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 06:46:06,043 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-17 06:46:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:06,044 INFO L225 Difference]: With dead ends: 111 [2023-02-17 06:46:06,044 INFO L226 Difference]: Without dead ends: 102 [2023-02-17 06:46:06,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-02-17 06:46:06,045 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:06,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 06:46:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-17 06:46:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-02-17 06:46:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-17 06:46:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2023-02-17 06:46:06,069 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 70 [2023-02-17 06:46:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:06,069 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2023-02-17 06:46:06,069 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-17 06:46:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2023-02-17 06:46:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 06:46:06,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:06,070 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-17 06:46:06,077 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-17 06:46:06,276 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-17 06:46:06,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1175438523, now seen corresponding path program 3 times [2023-02-17 06:46:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075419773] [2023-02-17 06:46:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:06,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:06,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111577389] [2023-02-17 06:46:06,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 06:46:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:06,297 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-17 06:46:06,299 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-17 06:46:06,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 06:46:06,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:46:06,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 06:46:06,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:06,446 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-17 06:46:06,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:06,728 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-17 06:46:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:06,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075419773] [2023-02-17 06:46:06,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:06,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111577389] [2023-02-17 06:46:06,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111577389] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:06,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:06,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 06:46:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305359433] [2023-02-17 06:46:06,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 06:46:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 06:46:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-17 06:46:06,731 INFO L87 Difference]: Start difference. First operand 102 states and 122 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-17 06:46:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:08,257 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2023-02-17 06:46:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 06:46:08,257 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-17 06:46:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:08,258 INFO L225 Difference]: With dead ends: 124 [2023-02-17 06:46:08,258 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 06:46:08,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 135 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-17 06:46:08,259 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:08,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 06:46:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 06:46:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-17 06:46:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-17 06:46:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2023-02-17 06:46:08,291 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 76 [2023-02-17 06:46:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:08,292 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2023-02-17 06:46:08,292 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-17 06:46:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2023-02-17 06:46:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-02-17 06:46:08,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:08,294 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-17 06:46:08,308 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-17 06:46:08,508 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-17 06:46:08,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:08,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1712175254, now seen corresponding path program 1 times [2023-02-17 06:46:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:08,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252534665] [2023-02-17 06:46:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:08,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687594727] [2023-02-17 06:46:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:08,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:08,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:08,524 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-17 06:46:08,526 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-17 06:46:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:46:08,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-17 06:46:08,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 104 proven. 110 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-17 06:46:08,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252534665] [2023-02-17 06:46:08,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687594727] [2023-02-17 06:46:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687594727] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 06:46:08,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 06:46:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 06:46:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911585619] [2023-02-17 06:46:08,752 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:08,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 06:46:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:08,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 06:46:08,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:46:08,753 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2023-02-17 06:46:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:09,141 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-17 06:46:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 06:46:09,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 129 [2023-02-17 06:46:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:09,142 INFO L225 Difference]: With dead ends: 133 [2023-02-17 06:46:09,142 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 06:46:09,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-17 06:46:09,143 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:09,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 06:46:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 06:46:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-17 06:46:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 71 states have internal predecessors, (72), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-02-17 06:46:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2023-02-17 06:46:09,168 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 129 [2023-02-17 06:46:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:09,168 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2023-02-17 06:46:09,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2023-02-17 06:46:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2023-02-17 06:46:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-02-17 06:46:09,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:09,169 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-17 06:46:09,176 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-17 06:46:09,376 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-17 06:46:09,376 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1019061416, now seen corresponding path program 2 times [2023-02-17 06:46:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:09,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901369482] [2023-02-17 06:46:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:09,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:09,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256359243] [2023-02-17 06:46:09,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:46:09,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:09,386 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-17 06:46:09,397 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-17 06:46:09,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:46:09,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:46:09,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 06:46:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:09,695 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-17 06:46:09,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:10,228 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-17 06:46:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901369482] [2023-02-17 06:46:10,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:10,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256359243] [2023-02-17 06:46:10,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256359243] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:10,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:10,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-17 06:46:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644527026] [2023-02-17 06:46:10,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 06:46:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 06:46:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-02-17 06:46:10,231 INFO L87 Difference]: Start difference. First operand 119 states and 129 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-17 06:46:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:46:12,167 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2023-02-17 06:46:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 06:46:12,168 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-17 06:46:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:46:12,169 INFO L225 Difference]: With dead ends: 155 [2023-02-17 06:46:12,169 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 06:46:12,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2023-02-17 06:46:12,170 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-17 06:46:12,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 110 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-17 06:46:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 06:46:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2023-02-17 06:46:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-02-17 06:46:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2023-02-17 06:46:12,204 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 151 [2023-02-17 06:46:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:46:12,205 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2023-02-17 06:46:12,205 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-17 06:46:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2023-02-17 06:46:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-02-17 06:46:12,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:46:12,206 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:46:12,220 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-17 06:46:12,410 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-17 06:46:12,411 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:46:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:46:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1062647964, now seen corresponding path program 2 times [2023-02-17 06:46:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:46:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057774758] [2023-02-17 06:46:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:46:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:46:12,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:46:12,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848506846] [2023-02-17 06:46:12,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:46:12,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:46:12,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:46:12,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:46:12,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 06:46:12,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:46:12,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:46:12,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-17 06:46:12,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:46:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 132 proven. 150 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-02-17 06:46:12,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:46:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 132 proven. 146 refuted. 4 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-02-17 06:46:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:46:17,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057774758] [2023-02-17 06:46:17,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:46:17,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848506846] [2023-02-17 06:46:17,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848506846] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:46:17,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:46:17,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-17 06:46:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826078476] [2023-02-17 06:46:17,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:46:17,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 06:46:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:46:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 06:46:17,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2023-02-17 06:46:17,182 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 22 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-02-17 06:46:22,974 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-17 06:46:24,982 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-17 06:46:32,196 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-17 06:46:34,227 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-17 06:46:37,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:46:39,038 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-17 06:46:41,051 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-17 06:46:49,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:46:51,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:46:54,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:46:57,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:00,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:02,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:04,601 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-17 06:47:06,615 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-17 06:47:08,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:11,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:13,691 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-17 06:47:15,695 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-17 06:47:17,697 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-17 06:47:24,829 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-17 06:47:28,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:31,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:47:40,371 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-17 06:47:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:47:40,392 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2023-02-17 06:47:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 06:47:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 156 [2023-02-17 06:47:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:47:40,393 INFO L225 Difference]: With dead ends: 163 [2023-02-17 06:47:40,393 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 06:47:40,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 263 SyntacticMatches, 28 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=168, Invalid=579, Unknown=9, NotChecked=0, Total=756 [2023-02-17 06:47:40,395 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 112 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:47:40,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 865 Invalid, 24 Unknown, 0 Unchecked, 59.4s Time] [2023-02-17 06:47:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 06:47:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 06:47:40,396 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-17 06:47:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 06:47:40,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2023-02-17 06:47:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:47:40,397 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 06:47:40,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-02-17 06:47:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 06:47:40,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 06:47:40,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 06:47:40,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-17 06:47:40,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 06:47:40,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 06:47:40,637 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse101 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse57 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse97 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse93 (* .cse101 6)) (.cse56 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse107 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse111 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse87 (- .cse56)) (.cse106 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse114 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse99 (+ 6 (* 6 .cse101))) (.cse58 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse116 (+ .cse93 6)) (.cse47 (+ .cse57 .cse97)) (.cse16 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse62 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse115 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse92 (+ 1 .cse101))) (let ((.cse103 (* 2 .cse97)) (.cse91 (+ 1 .cse92)) (.cse63 (let ((.cse119 (= |ULTIMATE.start_main_~z~0#1| (+ .cse115 6)))) (or (let ((.cse118 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse117 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse118 (- 6)) 0))) (and (or (not .cse117) (<= 0 .cse16) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse118 (- 5)) 0))) (not .cse119) .cse62 (or .cse117 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse119))) (.cse102 (- (* 18 .cse47))) (.cse48 (+ .cse97 .cse116)) (.cse51 (+ 6 .cse116)) (.cse52 (not (= .cse116 .cse58))) (.cse105 (not (= .cse58 .cse99))) (.cse104 (- (* 18 .cse57))) (.cse108 (* 2 .cse58)) (.cse70 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse87) (- .cse106)) .cse114) (- 10)))) (.cse69 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse33 (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse115)))) (.cse60 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse107) .cse111) .cse114) (- 6)))) (.cse55 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse74 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse75 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse113 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (let ((.cse68 (+ 6 (+ 19 (- 7)))) (.cse37 (+ 6 (+ 7 (- 1)))) (.cse71 (< .cse113 65536)) (.cse72 (<= 0 .cse113)) (.cse73 (let ((.cse112 (+ .cse75 65536))) (and (<= .cse112 (+ .cse74 32767)) .cse55 (<= .cse112 (+ .cse74 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse9 (or .cse33 .cse60)) (.cse13 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse111) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse14 (or .cse69 (= 0 (+ (+ (* .cse56 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|))))) (.cse36 (or .cse33 .cse69 .cse70)) (.cse15 (or .cse105 (= 0 (+ (+ (+ (+ (* .cse97 .cse58) .cse104) (- (* 12 .cse97))) .cse108) (- 6))))) (.cse3 (or (= 0 (+ (+ (+ (+ (* .cse48 .cse51) .cse102) (- (* 12 .cse48))) (* 2 .cse51)) (- 6))) .cse52)) (.cse18 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse6 (let ((.cse109 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse110 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse110 |ULTIMATE.start_main_~n~0#1|) .cse110)))))) (or (and .cse63 .cse109) (and .cse63 (or .cse33 .cse109))))) (.cse77 (+ 6 (* 6 .cse91))) (.cse35 (not .cse69)) (.cse96 (+ 6 (* 6 .cse92))) (.cse80 (+ .cse97 .cse58)) (.cse81 (+ 6 .cse58)) (.cse100 (- .cse103)) (.cse30 (+ |ULTIMATE.start_main_~n~0#1| (- 1)))) (let ((.cse23 (* .cse16 (- 1))) (.cse27 (+ |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse1 (<= .cse30 |ULTIMATE.start_main_~a~0#1|)) (.cse38 (+ 6 6)) (.cse39 (= .cse57 (* (* .cse101 .cse101) .cse101))) (.cse32 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse58) .cse87) .cse100) .cse108) (- 10)))) (.cse34 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse24 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse41 (= 0 (+ (+ (+ (+ (+ (* .cse106 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse107) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse40 (or (= 0 (+ (+ (+ (+ (+ (* .cse103 .cse97) (- (* (* 3 .cse57) .cse58))) .cse104) (- (* 10 .cse97))) (* 3 .cse58)) (- 10))) .cse105)) (.cse42 (or (not (= .cse81 .cse96)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse80) .cse80) (- (* (* 3 .cse47) .cse81))) .cse102) (- (* 10 .cse80))) (* 3 .cse81)) (- 10))))) (.cse43 (let ((.cse90 (<= .cse91 |ULTIMATE.start_main_~a~0#1|)) (.cse94 (<= .cse92 |ULTIMATE.start_main_~a~0#1|)) (.cse95 (<= .cse101 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse82 (or .cse95 (not (= .cse99 .cse58)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse99) .cse87) .cse100) (* 2 .cse99)) (- 10))) .cse35)) (.cse83 (let ((.cse98 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse95) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse96) .cse87) (- (* 2 (+ .cse97 .cse98)))) (* 2 .cse96)) (- 10))) (not (= .cse98 .cse58)) .cse94))) (.cse84 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse77) .cse87) (- (* 2 (+ .cse48 (+ .cse93 12))))) (* 2 .cse77)) (- 10))) .cse90 (not .cse94) .cse52))) (or (and .cse9 .cse82 .cse13 .cse83 .cse14 .cse36 .cse15 .cse3 .cse18 .cse6 .cse84) (and .cse9 .cse82 .cse13 .cse83 (let ((.cse89 (* .cse92 6))) (let ((.cse85 (+ 1 .cse91)) (.cse88 (+ .cse89 6))) (or (<= .cse85 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse86 (+ 6 (* 6 .cse85)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse86) .cse87) (- (* 2 (+ (+ .cse80 .cse88) (+ .cse89 12))))) (* 2 .cse86))) (- 10))) (not .cse90) .cse35 (not (= .cse88 .cse81))))) .cse14 .cse36 .cse15 .cse3 .cse18 .cse6 .cse84))))) (.cse53 (let ((.cse76 (+ 6 .cse81))) (or (not (= .cse76 .cse77)) (= 0 (+ (+ (let ((.cse78 (+ .cse80 .cse81))) (+ (let ((.cse79 (+ .cse47 .cse80))) (+ (+ (* (* 2 .cse78) .cse78) (- (* (* 3 .cse79) .cse76))) (- (* 18 .cse79)))) (- (* 10 .cse78)))) (* 3 .cse76)) (- 10)))))) (.cse61 (or (and .cse71 (<= (+ .cse74 (- 65536)) .cse75) .cse72 (<= (+ .cse74 (- 32768)) .cse75)) .cse73)) (.cse5 (+ 6 .cse37)) (.cse0 (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse17 (+ 19 .cse68)) (.cse2 (or (and .cse71 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse72) .cse73)) (.cse19 (+ 1 1)) (.cse31 (or .cse69 .cse70)) (.cse25 (+ 6 12)) (.cse8 (* (* 0 0) 0)) (.cse10 (+ .cse30 (- 1))) (.cse11 (+ 1 0)) (.cse20 (* 7 (- 1))) (.cse22 (* |ULTIMATE.start_main_~x~0#1| (- 1)))) (or (let ((.cse21 (+ .cse24 |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse4 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse23) (- 19))) (.cse12 (+ |ULTIMATE.start_main_~y~0#1| .cse22 .cse21)) (.cse7 (+ .cse20 (+ (+ .cse21 (- 19)) (- 7)) 6))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 .cse5) .cse6 (= .cse7 .cse8) .cse9 (= (+ .cse10 (- 1)) .cse11) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse12)) .cse13 .cse14 .cse15 (= .cse16 (+ 6 .cse4)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse12 (- 1))) .cse17) .cse18 (= .cse10 .cse19) (>= .cse7 0)))) (let ((.cse28 (+ .cse20 (+ |ULTIMATE.start_main_~x~0#1| (- 7)) 6)) (.cse29 (+ .cse16 (- 5))) (.cse26 (+ |ULTIMATE.start_main_~y~0#1| (- 7)))) (and (= |ULTIMATE.start_main_~z~0#1| .cse25) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse26)) (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse23 5) (- 1)) 0) (= .cse27 (+ 1 (+ 12 (- 6)))) .cse0 (= .cse28 .cse8) (= |ULTIMATE.start_main_~z~0#1| .cse5) .cse2 (>= .cse28 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse29 .cse16)) (= .cse30 .cse11) (= |ULTIMATE.start_main_~n~0#1| .cse19) .cse31 .cse6 (or .cse32 .cse33 .cse34 .cse35) (= |ULTIMATE.start_main_~y~0#1| (+ .cse27 12)) .cse13 (= (+ .cse29 (- 1)) 6) .cse14 .cse36 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse37)) (= .cse26 .cse38) .cse18 (or .cse33 .cse39))) (and .cse40 .cse41 .cse42 .cse43 (or (= 0 (+ (let ((.cse50 (+ 6 .cse51))) (let ((.cse46 (+ 6 .cse50))) (+ (let ((.cse49 (+ .cse48 .cse51))) (let ((.cse44 (+ .cse49 .cse50))) (+ (let ((.cse45 (+ (+ .cse47 .cse48) .cse49))) (+ (+ (* (* 2 .cse44) .cse44) (- (* (* 3 .cse45) .cse46))) (- (* 18 .cse45)))) (- (* 10 .cse44))))) (* 3 .cse46)))) (- 10))) .cse52) .cse53) (let ((.cse54 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse59 (+ .cse24 |ULTIMATE.start_main_~x~0#1| 6))) (and (= .cse27 0) .cse1 (= .cse54 6) (= .cse16 (+ 6 (* 6 0))) .cse2 (= .cse16 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse54)) (= .cse30 0) .cse55 .cse6 (= |ULTIMATE.start_main_~z~0#1| .cse38) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse16)) (or .cse34 (= 0 (+ (+ (* .cse56 .cse57) (- (* .cse57 .cse58))) (* 12 .cse57))) .cse35) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) (= .cse59 .cse8) .cse39 (or .cse32 .cse34 .cse35) .cse60 (>= .cse59 0) (<= |ULTIMATE.start_main_~n~0#1| .cse11) (= |ULTIMATE.start_main_~n~0#1| .cse11) .cse61 (= |ULTIMATE.start_main_~x~0#1| 1))) (and (or .cse33 .cse41) .cse40 .cse42 .cse43 .cse53) (and (>= |ULTIMATE.start_main_~x~0#1| 0) .cse2 .cse62 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse63 .cse61 .cse18 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse66 (+ |ULTIMATE.start_main_~y~0#1| (- 19))) (.cse64 (+ |ULTIMATE.start_main_~y~0#1| .cse22 8)) (.cse65 (+ .cse20 (+ (+ |ULTIMATE.start_main_~x~0#1| (- 19)) (- 7)) 6))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse64)) (>= .cse65 0) (= .cse66 .cse5) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse17) .cse2 (= .cse30 .cse19) .cse3 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66)) .cse31 .cse6 (let ((.cse67 (+ |ULTIMATE.start_main_~y~0#1| (* .cse64 (- 1))))) (= .cse67 (+ (+ (+ (* .cse67 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse68)) (= .cse64 .cse25) .cse13 .cse14 .cse60 .cse36 .cse15 .cse18 (= .cse65 .cse8) (= .cse10 .cse11)))))))))) [2023-02-17 06:47:40,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 06:47:40,640 INFO L895 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse97 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse115 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse75 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse74 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse91 (* .cse97 6))) (let ((.cse117 (+ .cse91 6)) (.cse57 (+ .cse75 .cse74)) (.cse98 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse84 (- .cse115)) (.cse71 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse114 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse76 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse94 (+ 6 (* 6 .cse97))) (.cse90 (+ 1 .cse97))) (let ((.cse73 (* 2 .cse74)) (.cse33 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse103 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse104 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse108 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse89 (+ 1 .cse90)) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse48 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse78 (not (= .cse76 .cse94))) (.cse77 (- (* 18 .cse75))) (.cse105 (* 2 .cse76)) (.cse112 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse99 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse84) (- .cse71)) .cse114) (- 10)))) (.cse72 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse113 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse106 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse88 (not .cse98)) (.cse70 (- (* 18 .cse57))) (.cse58 (+ .cse74 .cse117)) (.cse61 (+ 6 .cse117)) (.cse62 (not (= .cse117 .cse76)))) (let ((.cse67 (+ .cse74 .cse76)) (.cse68 (+ 6 .cse76)) (.cse3 (or (= 0 (+ (+ (+ (+ (* .cse58 .cse61) .cse70) (- (* 12 .cse58))) (* 2 .cse61)) (- 6))) .cse62)) (.cse4 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse116 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse116 |ULTIMATE.start_main_~n~0#1|) .cse116))))) (.cse9 (or .cse106 (= 0 (+ (+ (* .cse115 .cse75) (- (* .cse75 .cse76))) (* 12 .cse75))) .cse88)) (.cse13 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse113) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse14 (or .cse98 (= 0 (+ (+ (* .cse115 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|))))) (.cse15 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse72) .cse113) .cse114) (- 6)))) (.cse40 (or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse112))) .cse98 .cse99)) (.cse16 (or .cse78 (= 0 (+ (+ (+ (+ (* .cse74 .cse76) .cse77) (- (* 12 .cse74))) .cse105) (- 6))))) (.cse17 (let ((.cse111 (= |ULTIMATE.start_main_~z~0#1| (+ .cse112 6)))) (or (let ((.cse110 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse109 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse110 (- 6)) 0))) (and (or (not .cse109) (<= 0 .cse18) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse110 (- 5)) 0))) (not .cse111) .cse48 (or .cse109 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse111))) (.cse20 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse64 (+ 6 (* 6 .cse89))) (.cse69 (+ 6 (* 6 .cse90))) (.cse53 (+ 6 (+ 19 (- 7)))) (.cse42 (+ 6 (+ 7 (- 1)))) (.cse100 (< .cse108 65536)) (.cse101 (<= 0 .cse108)) (.cse102 (let ((.cse107 (+ .cse104 65536))) (and (<= .cse107 (+ .cse103 32767)) .cse33 (<= .cse107 (+ .cse103 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse95 (- .cse73)) (.cse32 (+ |ULTIMATE.start_main_~n~0#1| (- 1)))) (let ((.cse1 (<= .cse32 |ULTIMATE.start_main_~a~0#1|)) (.cse26 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse25 (* .cse18 (- 1))) (.cse29 (= .cse75 (* (* .cse97 .cse97) .cse97))) (.cse35 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse76) .cse84) .cse95) .cse105) (- 10))) .cse106 .cse88)) (.cse27 (+ |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse34 (+ 6 6)) (.cse31 (or (and .cse100 (<= (+ .cse103 (- 65536)) .cse104) .cse101 (<= (+ .cse103 (- 32768)) .cse104)) .cse102)) (.cse6 (+ 6 .cse42)) (.cse0 (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse19 (+ 19 .cse53)) (.cse2 (or (and .cse100 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse101) .cse102)) (.cse21 (+ 1 1)) (.cse39 (or .cse98 .cse99)) (.cse41 (+ 6 12)) (.cse8 (* (* 0 0) 0)) (.cse10 (+ .cse32 (- 1))) (.cse11 (+ 1 0)) (.cse22 (* 7 (- 1))) (.cse24 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse43 (let ((.cse87 (<= .cse89 |ULTIMATE.start_main_~a~0#1|)) (.cse93 (<= .cse97 |ULTIMATE.start_main_~a~0#1|)) (.cse92 (<= .cse90 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse79 (let ((.cse96 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse93) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse69) .cse84) (- (* 2 (+ .cse74 .cse96)))) (* 2 .cse69)) (- 10))) (not (= .cse96 .cse76)) .cse92))) (.cse80 (or .cse93 (not (= .cse94 .cse76)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse94) .cse84) .cse95) (* 2 .cse94)) (- 10))) .cse88)) (.cse81 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse64) .cse84) (- (* 2 (+ .cse58 (+ .cse91 12))))) (* 2 .cse64)) (- 10))) .cse87 (not .cse92) .cse62))) (or (and .cse79 .cse3 .cse4 .cse9 .cse80 .cse13 .cse14 .cse15 .cse40 .cse16 .cse17 .cse20 .cse81) (and .cse79 (let ((.cse86 (* .cse90 6))) (let ((.cse82 (+ 1 .cse89)) (.cse85 (+ .cse86 6))) (or (<= .cse82 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse83 (+ 6 (* 6 .cse82)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse83) .cse84) (- (* 2 (+ (+ .cse67 .cse85) (+ .cse86 12))))) (* 2 .cse83))) (- 10))) (not .cse87) .cse88 (not (= .cse85 .cse68))))) .cse3 .cse4 .cse9 .cse80 .cse13 .cse14 .cse15 .cse40 .cse16 .cse17 .cse20 .cse81))))) (.cse44 (or (= 0 (+ (+ (+ (+ (+ (* .cse73 .cse74) (- (* (* 3 .cse75) .cse76))) .cse77) (- (* 10 .cse74))) (* 3 .cse76)) (- 10))) .cse78)) (.cse45 (= 0 (+ (+ (+ (+ (+ (* .cse71 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse72) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse46 (or (not (= .cse68 .cse69)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse67) .cse67) (- (* (* 3 .cse57) .cse68))) .cse70) (- (* 10 .cse67))) (* 3 .cse68)) (- 10))))) (.cse47 (let ((.cse63 (+ 6 .cse68))) (or (not (= .cse63 .cse64)) (= 0 (+ (+ (let ((.cse65 (+ .cse67 .cse68))) (+ (let ((.cse66 (+ .cse57 .cse67))) (+ (+ (* (* 2 .cse65) .cse65) (- (* (* 3 .cse66) .cse63))) (- (* 18 .cse66)))) (- (* 10 .cse65)))) (* 3 .cse63)) (- 10))))))) (or (let ((.cse23 (+ .cse26 |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse5 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse25) (- 19))) (.cse12 (+ |ULTIMATE.start_main_~y~0#1| .cse24 .cse23)) (.cse7 (+ .cse22 (+ (+ .cse23 (- 19)) (- 7)) 6))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 .cse6) (= .cse7 .cse8) .cse9 (= (+ .cse10 (- 1)) .cse11) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse12)) .cse13 .cse14 .cse15 .cse16 .cse17 (= .cse18 (+ 6 .cse5)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse12 (- 1))) .cse19) .cse20 (= .cse10 .cse21) (>= .cse7 0)))) (let ((.cse28 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse30 (+ .cse26 |ULTIMATE.start_main_~x~0#1| 6))) (and (= .cse27 0) (= .cse28 6) (= .cse18 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse18)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse29 .cse15 (>= .cse30 0) .cse17 (= |ULTIMATE.start_main_~n~0#1| .cse11) .cse31 .cse1 (= .cse18 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse28)) (= .cse32 0) .cse4 .cse33 (= |ULTIMATE.start_main_~z~0#1| .cse34) .cse9 (= .cse30 .cse8) .cse35 (<= |ULTIMATE.start_main_~n~0#1| .cse11) (= |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse37 (+ .cse22 (+ |ULTIMATE.start_main_~x~0#1| (- 7)) 6)) (.cse38 (+ .cse18 (- 5))) (.cse36 (+ |ULTIMATE.start_main_~y~0#1| (- 7)))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse36)) (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse25 5) (- 1)) 0) .cse0 (= .cse37 .cse8) (= |ULTIMATE.start_main_~z~0#1| .cse6) .cse2 (>= .cse37 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse38 .cse18)) (= |ULTIMATE.start_main_~n~0#1| .cse21) .cse39 .cse29 .cse14 .cse40 .cse17 .cse20 (= |ULTIMATE.start_main_~z~0#1| .cse41) (= .cse27 (+ 1 (+ 12 (- 6)))) (= .cse32 .cse11) .cse4 .cse9 .cse35 (= |ULTIMATE.start_main_~y~0#1| (+ .cse27 12)) .cse13 (= (+ .cse38 (- 1)) 6) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse42)) (= .cse36 .cse34))) (and .cse43 .cse44 .cse45 .cse46 .cse47) (and (>= |ULTIMATE.start_main_~x~0#1| 0) .cse2 .cse48 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse17 .cse31 .cse20 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse51 (+ |ULTIMATE.start_main_~y~0#1| (- 19))) (.cse49 (+ |ULTIMATE.start_main_~y~0#1| .cse24 8)) (.cse50 (+ .cse22 (+ (+ |ULTIMATE.start_main_~x~0#1| (- 19)) (- 7)) 6))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse49)) (>= .cse50 0) (= .cse51 .cse6) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse19) .cse2 (= .cse32 .cse21) .cse3 .cse4 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse51)) .cse39 (let ((.cse52 (+ |ULTIMATE.start_main_~y~0#1| (* .cse49 (- 1))))) (= .cse52 (+ (+ (+ (* .cse52 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse9 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse53)) (= .cse49 .cse41) .cse13 .cse14 .cse15 .cse40 .cse16 .cse17 .cse20 (= .cse50 .cse8) (= .cse10 .cse11))) (and .cse43 .cse44 .cse45 .cse46 (or (= 0 (+ (let ((.cse60 (+ 6 .cse61))) (let ((.cse56 (+ 6 .cse60))) (+ (let ((.cse59 (+ .cse58 .cse61))) (let ((.cse54 (+ .cse59 .cse60))) (+ (let ((.cse55 (+ (+ .cse57 .cse58) .cse59))) (+ (+ (* (* 2 .cse54) .cse54) (- (* (* 3 .cse55) .cse56))) (- (* 18 .cse55)))) (- (* 10 .cse54))))) (* 3 .cse56)))) (- 10))) .cse62) .cse47)))))))) [2023-02-17 06:47:40,640 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-02-17 06:47:40,640 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse3 (let ((.cse13 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse12 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse11 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse12 (- 6)) 0))) (and (or (not .cse11) (<= 0 .cse4) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse12 (- 5)) 0))) (not .cse13) .cse2 (or .cse11 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse13))) (.cse0 (- (* 12 |ULTIMATE.start_main_~y~0#1|)))) (let ((.cse1 (let ((.cse5 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (* (* .cse10 .cse10) .cse10)))) (.cse6 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (- (* 18 |ULTIMATE.start_main_~x~0#1|))) .cse0) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse7 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse9 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse9 |ULTIMATE.start_main_~n~0#1|) .cse9))))) (.cse8 (= |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 (and .cse5 .cse6 .cse3 .cse7 (= |ULTIMATE.start_main_~n~0#1| (+ 1 0)) .cse8 (= |ULTIMATE.start_main_~x~0#1| 1)) (and .cse5 .cse6 .cse3 .cse7 .cse8))))) (or (and (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse0) (- (* 6 |ULTIMATE.start_main_~z~0#1|))))) .cse1) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse3 (= |ULTIMATE.start_main_~z~0#1| 6)) (and (= .cse4 6) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse4))))))) [2023-02-17 06:47:40,641 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse74 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse80 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse59 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse73 (* .cse74 6))) (let ((.cse90 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse70 (+ 1 .cse74)) (.cse24 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse27 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse28 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse93 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse94 (+ .cse73 6)) (.cse45 (+ .cse80 .cse59)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse79 (* 2 .cse59)) (.cse61 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse71 (+ 6 (* 6 .cse74)))) (let ((.cse75 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse82 (not (= .cse61 .cse71))) (.cse81 (- (* 18 .cse80))) (.cse78 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse87 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse72 (- .cse79)) (.cse86 (* 2 .cse61)) (.cse89 (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse25)) (.cse68 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse56 (- (* 18 .cse45))) (.cse51 (+ .cse59 .cse94)) (.cse54 (+ 6 .cse94)) (.cse34 (not (= .cse94 .cse61))) (.cse26 (< .cse93 65536)) (.cse29 (<= 0 .cse93)) (.cse30 (let ((.cse92 (+ .cse28 65536))) (and (<= .cse92 (+ .cse27 32767)) .cse24 (<= .cse92 (+ .cse27 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse69 (+ 1 .cse70)) (.cse58 (- .cse90)) (.cse77 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse88 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse55 (+ 6 (* 6 .cse70))) (.cse46 (+ .cse59 .cse61)) (.cse47 (+ 6 .cse61)) (.cse5 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse58) (- .cse77)) .cse88) (- 10)))) (.cse42 (+ 6 (* 6 .cse69))) (.cse23 (or (and .cse26 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse29) .cse30)) (.cse38 (or (= 0 (+ (+ (+ (+ (* .cse51 .cse54) .cse56) (- (* 12 .cse51))) (* 2 .cse54)) (- 6))) .cse34)) (.cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse91 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse91 |ULTIMATE.start_main_~n~0#1|) .cse91))))) (.cse8 (= 0 (+ (+ (* .cse90 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse9 (or .cse89 (= 0 (+ (+ (* .cse90 .cse80) (- (* .cse80 .cse61))) (* 12 .cse80))) .cse68)) (.cse10 (= .cse80 (* (* .cse74 .cse74) .cse74))) (.cse11 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse61) .cse58) .cse72) .cse86) (- 10))) .cse89 .cse68)) (.cse12 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse87) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse78) .cse87) .cse88) (- 6)))) (.cse40 (or .cse82 (= 0 (+ (+ (+ (+ (* .cse59 .cse61) .cse81) (- (* 12 .cse59))) .cse86) (- 6))))) (.cse1 (let ((.cse85 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse84 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse83 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse84 (- 6)) 0))) (and (or (not .cse83) (<= 0 .cse4) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse84 (- 5)) 0))) (not .cse85) .cse0 (or .cse83 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse85))) (.cse14 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse15 (+ .cse75 (- 1))) (.cse7 (+ 1 1)) (.cse2 (* .cse4 (- 1)))) (let ((.cse16 (+ 1 0)) (.cse31 (or (= 0 (+ (+ (+ (+ (+ (* .cse79 .cse59) (- (* (* 3 .cse80) .cse61))) .cse81) (- (* 10 .cse59))) (* 3 .cse61)) (- 10))) .cse82)) (.cse32 (= 0 (+ (+ (+ (+ (+ (* .cse77 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse78) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse18 (or (let ((.cse57 (<= .cse74 |ULTIMATE.start_main_~a~0#1|)) (.cse67 (<= .cse69 |ULTIMATE.start_main_~a~0#1|)) (.cse62 (<= .cse70 |ULTIMATE.start_main_~a~0#1|))) (and (let ((.cse60 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse57) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse55) .cse58) (- (* 2 (+ .cse59 .cse60)))) (* 2 .cse55)) (- 10))) (not (= .cse60 .cse61)) .cse62)) (let ((.cse66 (* .cse70 6))) (let ((.cse63 (+ 1 .cse69)) (.cse65 (+ .cse66 6))) (or (<= .cse63 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse64 (+ 6 (* 6 .cse63)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse64) .cse58) (- (* 2 (+ (+ .cse46 .cse65) (+ .cse66 12))))) (* 2 .cse64))) (- 10))) (not .cse67) .cse68 (not (= .cse65 .cse47))))) .cse38 .cse5 .cse6 .cse8 .cse9 .cse10 (or .cse57 (not (= .cse71 .cse61)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse71) .cse58) .cse72) (* 2 .cse71)) (- 10))) .cse68) .cse11 .cse12 .cse13 .cse40 .cse1 .cse14 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse42) .cse58) (- (* 2 (+ .cse51 (+ .cse73 12))))) (* 2 .cse42)) (- 10))) .cse67 (not .cse62) .cse34))) (let ((.cse76 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse2) (- 19)))) (and (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|) (<= .cse75 |ULTIMATE.start_main_~a~0#1|) .cse23 .cse38 .cse6 (= .cse76 (+ 6 (+ 6 (+ 7 (- 1))))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse40 .cse1 (= .cse4 (+ 6 .cse76)) .cse14 .cse68 (= .cse15 .cse7))))) (.cse35 (or (not (= .cse47 .cse55)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse46) .cse46) (- (* (* 3 .cse45) .cse47))) .cse56) (- (* 10 .cse46))) (* 3 .cse47)) (- 10))))) (.cse33 (= 0 (+ (let ((.cse53 (+ 6 .cse54))) (let ((.cse50 (+ 6 .cse53))) (+ (let ((.cse52 (+ .cse51 .cse54))) (let ((.cse48 (+ .cse52 .cse53))) (+ (let ((.cse49 (+ (+ .cse45 .cse51) .cse52))) (+ (+ (* (* 2 .cse48) .cse48) (- (* (* 3 .cse49) .cse50))) (- (* 18 .cse49)))) (- (* 10 .cse48))))) (* 3 .cse50)))) (- 10)))) (.cse36 (let ((.cse41 (+ 6 .cse47))) (or (not (= .cse41 .cse42)) (= 0 (+ (+ (let ((.cse43 (+ .cse46 .cse47))) (+ (let ((.cse44 (+ .cse45 .cse46))) (+ (+ (* (* 2 .cse43) .cse43) (- (* (* 3 .cse44) .cse41))) (- (* 18 .cse44)))) (- (* 10 .cse43)))) (* 3 .cse41)) (- 10)))))) (.cse21 (* |ULTIMATE.start_main_~x~0#1| (- 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse1 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse3 (+ .cse4 (- 5)))) (and (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse2 5) (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse3 .cse4)) .cse5 .cse6 (= |ULTIMATE.start_main_~n~0#1| .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 (= (+ .cse3 (- 1)) 6) .cse13 .cse1 .cse14)) (let ((.cse20 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse17 (+ |ULTIMATE.start_main_~y~0#1| .cse21 .cse20)) (.cse19 (+ (* 7 (- 1)) (+ (+ .cse20 (- 19)) (- 7)) 6))) (and (= (+ .cse15 (- 1)) .cse16) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse17)) .cse18 (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse17 (- 1))) (+ 19 (+ 6 (+ 19 (- 7))))) (= .cse19 (* (* 0 0) 0)) (>= .cse19 0)))) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (and (= .cse22 6) .cse23 (= .cse4 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse22)) .cse6 .cse24 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse4)) .cse9 .cse10 .cse11 (<= .cse25 1) .cse13 (<= |ULTIMATE.start_main_~n~0#1| .cse16) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse16) (or (and .cse26 (<= (+ .cse27 (- 65536)) .cse28) .cse29 (<= (+ .cse27 (- 32768)) .cse28)) .cse30) .cse14 (= |ULTIMATE.start_main_~x~0#1| 1))) (and .cse31 .cse32 .cse18 (or (not .cse14) .cse33 .cse34) .cse35 .cse36) (and .cse31 .cse32 .cse18 .cse35 (or .cse33 .cse34) .cse36) (let ((.cse37 (+ |ULTIMATE.start_main_~y~0#1| .cse21 8))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse37)) .cse5 .cse38 .cse6 .cse8 (let ((.cse39 (+ |ULTIMATE.start_main_~y~0#1| (* .cse37 (- 1))))) (= .cse39 (+ (+ (+ (* .cse39 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse9 .cse10 .cse11 (= .cse37 (+ 6 12)) .cse12 .cse13 .cse40 .cse1 .cse14))))))))) [2023-02-17 06:47:40,641 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 06:47:40,641 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 55) the Hoare annotation is: true [2023-02-17 06:47:40,642 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse81 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse100 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse110 (+ 1 .cse100)) (.cse96 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse69 (* .cse100 6)) (.cse82 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse95 (* 2 .cse81)) (.cse88 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse112 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse91 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse86 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse68 (- .cse88)) (.cse99 (- .cse95)) (.cse84 (* 2 .cse82)) (.cse51 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse114 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse115 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse119 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse120 (+ .cse69 6)) (.cse61 (+ .cse96 .cse81)) (.cse109 (+ 1 .cse110)) (.cse98 (+ 6 (* 6 .cse100))) (.cse79 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse57 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse90 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse85 (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse79)))) (.cse83 (- (* 18 .cse96))) (.cse80 (not (= .cse82 .cse98))) (.cse67 (+ 6 (* 6 .cse109))) (.cse75 (- (* 18 .cse61))) (.cse62 (+ .cse81 .cse120)) (.cse65 (+ 6 .cse120)) (.cse66 (not (= .cse120 .cse82))) (.cse74 (+ .cse81 .cse82)) (.cse70 (<= .cse109 |ULTIMATE.start_main_~a~0#1|)) (.cse72 (+ 6 .cse82)) (.cse97 (<= .cse100 |ULTIMATE.start_main_~a~0#1|)) (.cse73 (+ 6 (* 6 .cse110))) (.cse71 (<= .cse110 |ULTIMATE.start_main_~a~0#1|)) (.cse89 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse113 (< .cse119 65536)) (.cse116 (<= 0 .cse119)) (.cse117 (let ((.cse118 (+ .cse115 65536))) (and (<= .cse118 (+ .cse114 32767)) .cse51 (<= .cse118 (+ .cse114 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse34 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse7 (+ 6 (+ 19 (- 7)))) (.cse37 (+ 6 (+ 7 (- 1)))) (.cse3 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse92 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse82) .cse68) .cse99) .cse84) (- 10)))) (.cse93 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse94 (not .cse86)) (.cse87 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse68) (- .cse112)) .cse91) (- 10))))) (let ((.cse6 (or .cse86 .cse87)) (.cse11 (+ 6 12)) (.cse35 (+ |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse38 (+ 6 6)) (.cse36 (or .cse92 .cse93 .cse94)) (.cse1 (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse50 (<= .cse3 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (+ 6 .cse37)) (.cse25 (* (* 0 0) 0)) (.cse27 (+ 1 0)) (.cse20 (+ 19 .cse7)) (.cse26 (+ .cse3 (- 1))) (.cse4 (+ 1 1)) (.cse28 (* 7 (- 1))) (.cse29 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse31 (* .cse34 (- 1))) (.cse52 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse2 (or (and .cse113 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse116) .cse117)) (.cse49 (or (and .cse113 (<= (+ .cse114 (- 65536)) .cse115) .cse116 (<= (+ .cse114 (- 32768)) .cse115)) .cse117)) (.cse39 (= 0 (+ (+ (+ (+ (+ (* .cse112 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse89) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse40 (let ((.cse111 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse97) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse73) .cse68) (- (* 2 (+ .cse81 .cse111)))) (* 2 .cse73)) (- 10))) (not (= .cse111 .cse82)) .cse71))) (.cse41 (let ((.cse108 (* .cse110 6))) (let ((.cse105 (+ 1 .cse109)) (.cse107 (+ .cse108 6))) (or (<= .cse105 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse106 (+ 6 (* 6 .cse105)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse106) .cse68) (- (* 2 (+ (+ .cse74 .cse107) (+ .cse108 12))))) (* 2 .cse106))) (- 10))) (not .cse70) .cse94 (not (= .cse107 .cse72)))))) (.cse5 (or (= 0 (+ (+ (+ (+ (* .cse62 .cse65) .cse75) (- (* 12 .cse62))) (* 2 .cse65)) (- 6))) .cse66)) (.cse21 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse104 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse104 |ULTIMATE.start_main_~n~0#1|) .cse104))))) (.cse23 (or .cse93 (= 0 (+ (+ (* .cse88 .cse96) (- (* .cse96 .cse82))) (* 12 .cse96))) .cse94)) (.cse42 (let ((.cse101 (+ 6 .cse72))) (or (not (= .cse101 .cse67)) (= 0 (+ (+ (let ((.cse102 (+ .cse74 .cse72))) (+ (let ((.cse103 (+ .cse61 .cse74))) (+ (+ (* (* 2 .cse102) .cse102) (- (* (* 3 .cse103) .cse101))) (- (* 18 .cse103)))) (- (* 10 .cse102)))) (* 3 .cse101)) (- 10)))))) (.cse8 (= .cse96 (* (* .cse100 .cse100) .cse100))) (.cse43 (or .cse97 (not (= .cse98 .cse82)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse98) .cse68) .cse99) (* 2 .cse98)) (- 10))) .cse94)) (.cse44 (or (= 0 (+ (+ (+ (+ (+ (* .cse95 .cse81) (- (* (* 3 .cse96) .cse82))) .cse83) (- (* 10 .cse81))) (* 3 .cse82)) (- 10))) .cse80)) (.cse9 (or .cse92 .cse85 .cse93 .cse94)) (.cse24 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse90) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse12 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse89) .cse90) .cse91) (- 6)))) (.cse13 (or .cse86 (= 0 (+ (+ (* .cse88 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|))))) (.cse14 (or .cse85 .cse86 .cse87)) (.cse15 (or .cse80 (= 0 (+ (+ (+ (+ (* .cse81 .cse82) .cse83) (- (* 12 .cse81))) .cse84) (- 6))))) (.cse16 (let ((.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ .cse79 6)))) (or (let ((.cse77 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse76 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse77 (- 6)) 0))) (and (or (not .cse76) (<= 0 .cse34) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse77 (- 5)) 0))) (not .cse78) .cse57 (or .cse76 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse78))) (.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|))) (.cse45 (or (not (= .cse72 .cse73)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse74) .cse74) (- (* (* 3 .cse61) .cse72))) .cse75) (- (* 10 .cse74))) (* 3 .cse72)) (- 10))))) (.cse46 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse67) .cse68) (- (* 2 (+ .cse62 (+ .cse69 12))))) (* 2 .cse67)) (- 10))) .cse70 (not .cse71) .cse66))) (or (let ((.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 19))) (.cse10 (+ |ULTIMATE.start_main_~y~0#1| .cse29 8)) (.cse0 (+ .cse28 (+ (+ |ULTIMATE.start_main_~x~0#1| (- 19)) (- 7)) 6))) (and (>= .cse0 0) .cse1 .cse2 (= .cse3 .cse4) .cse5 .cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse7)) .cse8 .cse9 (= .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse10)) (= .cse18 .cse19) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse21 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse18)) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| (* .cse10 (- 1))))) (= .cse22 (+ (+ (+ (* .cse22 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse23 .cse24 (= .cse0 .cse25) (= .cse26 .cse27))) (let ((.cse32 (+ .cse28 (+ |ULTIMATE.start_main_~x~0#1| (- 7)) 6)) (.cse33 (+ .cse34 (- 5))) (.cse30 (+ |ULTIMATE.start_main_~y~0#1| (- 7)))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse30)) (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse31 5) (- 1)) 0) .cse1 (= .cse32 .cse25) (= |ULTIMATE.start_main_~z~0#1| .cse19) .cse2 (>= .cse32 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse33 .cse34)) (= |ULTIMATE.start_main_~n~0#1| .cse4) .cse6 .cse8 .cse12 .cse13 .cse14 .cse16 .cse17 (= |ULTIMATE.start_main_~z~0#1| .cse11) (= .cse35 (+ 1 (+ 12 (- 6)))) (= .cse3 .cse27) .cse21 .cse23 .cse36 (= |ULTIMATE.start_main_~y~0#1| (+ .cse35 12)) .cse24 (= (+ .cse33 (- 1)) 6) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse37)) (= .cse30 .cse38))) (and .cse39 .cse40 .cse41 .cse5 .cse21 .cse23 .cse42 .cse8 .cse43 .cse44 .cse9 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse45 .cse46) (let ((.cse47 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse48 (+ .cse52 |ULTIMATE.start_main_~x~0#1| 6))) (and (= .cse35 0) (= .cse47 6) (= .cse34 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse34)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse8 .cse12 (>= .cse48 0) .cse16 (= |ULTIMATE.start_main_~n~0#1| .cse27) .cse49 .cse17 .cse50 (= .cse34 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse47)) (= .cse3 0) .cse21 .cse51 (= |ULTIMATE.start_main_~z~0#1| .cse38) .cse23 (= .cse48 .cse25) .cse36 (<= |ULTIMATE.start_main_~n~0#1| .cse27) (= |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse56 (+ .cse52 |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse53 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse31) (- 19))) (.cse55 (+ |ULTIMATE.start_main_~y~0#1| .cse29 .cse56)) (.cse54 (+ .cse28 (+ (+ .cse56 (- 19)) (- 7)) 6))) (and .cse1 .cse50 .cse2 .cse5 .cse21 (= .cse53 .cse19) (= .cse54 .cse25) .cse23 .cse8 (= (+ .cse26 (- 1)) .cse27) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse55)) .cse9 .cse24 .cse12 .cse13 .cse15 .cse16 (= .cse34 (+ 6 .cse53)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse55 (- 1))) .cse20) .cse17 (= .cse26 .cse4) (>= .cse54 0)))) (and (>= |ULTIMATE.start_main_~x~0#1| 0) .cse2 .cse57 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 .cse49 .cse17 (= |ULTIMATE.start_main_~z~0#1| 6)) (and .cse39 .cse40 .cse41 .cse5 .cse21 .cse23 .cse42 .cse8 .cse43 .cse44 .cse9 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse45 .cse46 (or (= 0 (+ (let ((.cse64 (+ 6 .cse65))) (let ((.cse60 (+ 6 .cse64))) (+ (let ((.cse63 (+ .cse62 .cse65))) (let ((.cse58 (+ .cse63 .cse64))) (+ (let ((.cse59 (+ (+ .cse61 .cse62) .cse63))) (+ (+ (* (* 2 .cse58) .cse58) (- (* (* 3 .cse59) .cse60))) (- (* 18 .cse59)))) (- (* 10 .cse58))))) (* 3 .cse60)))) (- 10))) .cse66)))))))) [2023-02-17 06:47:40,643 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse81 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse100 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse110 (+ 1 .cse100)) (.cse96 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse69 (* .cse100 6)) (.cse82 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse95 (* 2 .cse81)) (.cse91 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse112 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse90 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse86 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse68 (- .cse91)) (.cse99 (- .cse95)) (.cse84 (* 2 .cse82)) (.cse44 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse114 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse115 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse119 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse120 (+ .cse69 6)) (.cse61 (+ .cse96 .cse81)) (.cse109 (+ 1 .cse110)) (.cse98 (+ 6 (* 6 .cse100))) (.cse79 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse57 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse89 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse85 (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse79)))) (.cse83 (- (* 18 .cse96))) (.cse80 (not (= .cse82 .cse98))) (.cse67 (+ 6 (* 6 .cse109))) (.cse75 (- (* 18 .cse61))) (.cse62 (+ .cse81 .cse120)) (.cse65 (+ 6 .cse120)) (.cse66 (not (= .cse120 .cse82))) (.cse74 (+ .cse81 .cse82)) (.cse70 (<= .cse109 |ULTIMATE.start_main_~a~0#1|)) (.cse72 (+ 6 .cse82)) (.cse97 (<= .cse100 |ULTIMATE.start_main_~a~0#1|)) (.cse73 (+ 6 (* 6 .cse110))) (.cse71 (<= .cse110 |ULTIMATE.start_main_~a~0#1|)) (.cse88 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse113 (< .cse119 65536)) (.cse116 (<= 0 .cse119)) (.cse117 (let ((.cse118 (+ .cse115 65536))) (and (<= .cse118 (+ .cse114 32767)) .cse44 (<= .cse118 (+ .cse114 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse92 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse82) .cse68) .cse99) .cse84) (- 10)))) (.cse93 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse94 (not .cse86)) (.cse87 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse68) (- .cse112)) .cse90) (- 10)))) (.cse56 (+ 6 (+ 7 (- 1)))) (.cse40 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse7 (+ 6 (+ 19 (- 7)))) (.cse3 (+ |ULTIMATE.start_main_~n~0#1| (- 1)))) (let ((.cse43 (<= .cse3 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (+ 19 .cse7)) (.cse26 (+ .cse3 (- 1))) (.cse29 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse47 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse52 (* .cse40 (- 1))) (.cse1 (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse25 (* (* 0 0) 0)) (.cse19 (+ 6 .cse56)) (.cse4 (+ 1 1)) (.cse6 (or .cse86 .cse87)) (.cse11 (+ 6 12)) (.cse27 (+ 1 0)) (.cse46 (or .cse92 .cse93 .cse94)) (.cse38 (+ |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse45 (+ 6 6)) (.cse28 (* 7 (- 1))) (.cse2 (or (and .cse113 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse116) .cse117)) (.cse42 (or (and .cse113 (<= (+ .cse114 (- 65536)) .cse115) .cse116 (<= (+ .cse114 (- 32768)) .cse115)) .cse117)) (.cse30 (= 0 (+ (+ (+ (+ (+ (* .cse112 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse88) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse31 (let ((.cse111 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse97) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse73) .cse68) (- (* 2 (+ .cse81 .cse111)))) (* 2 .cse73)) (- 10))) (not (= .cse111 .cse82)) .cse71))) (.cse32 (let ((.cse108 (* .cse110 6))) (let ((.cse105 (+ 1 .cse109)) (.cse107 (+ .cse108 6))) (or (<= .cse105 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse106 (+ 6 (* 6 .cse105)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse106) .cse68) (- (* 2 (+ (+ .cse74 .cse107) (+ .cse108 12))))) (* 2 .cse106))) (- 10))) (not .cse70) .cse94 (not (= .cse107 .cse72)))))) (.cse5 (or (= 0 (+ (+ (+ (+ (* .cse62 .cse65) .cse75) (- (* 12 .cse62))) (* 2 .cse65)) (- 6))) .cse66)) (.cse21 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse104 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse104 |ULTIMATE.start_main_~n~0#1|) .cse104))))) (.cse23 (or .cse93 (= 0 (+ (+ (* .cse91 .cse96) (- (* .cse96 .cse82))) (* 12 .cse96))) .cse94)) (.cse33 (let ((.cse101 (+ 6 .cse72))) (or (not (= .cse101 .cse67)) (= 0 (+ (+ (let ((.cse102 (+ .cse74 .cse72))) (+ (let ((.cse103 (+ .cse61 .cse74))) (+ (+ (* (* 2 .cse102) .cse102) (- (* (* 3 .cse103) .cse101))) (- (* 18 .cse103)))) (- (* 10 .cse102)))) (* 3 .cse101)) (- 10)))))) (.cse8 (= .cse96 (* (* .cse100 .cse100) .cse100))) (.cse34 (or .cse97 (not (= .cse98 .cse82)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse98) .cse68) .cse99) (* 2 .cse98)) (- 10))) .cse94)) (.cse35 (or (= 0 (+ (+ (+ (+ (+ (* .cse95 .cse81) (- (* (* 3 .cse96) .cse82))) .cse83) (- (* 10 .cse81))) (* 3 .cse82)) (- 10))) .cse80)) (.cse9 (or .cse92 .cse85 .cse93 .cse94)) (.cse24 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse89) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse12 (or .cse86 (= 0 (+ (+ (* .cse91 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|))))) (.cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse88) .cse89) .cse90) (- 6)))) (.cse14 (or .cse85 .cse86 .cse87)) (.cse15 (or .cse80 (= 0 (+ (+ (+ (+ (* .cse81 .cse82) .cse83) (- (* 12 .cse81))) .cse84) (- 6))))) (.cse16 (let ((.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ .cse79 6)))) (or (let ((.cse77 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse76 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse77 (- 6)) 0))) (and (or (not .cse76) (<= 0 .cse40) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse77 (- 5)) 0))) (not .cse78) .cse57 (or .cse76 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse78))) (.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|))) (.cse36 (or (not (= .cse72 .cse73)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse74) .cse74) (- (* (* 3 .cse61) .cse72))) .cse75) (- (* 10 .cse74))) (* 3 .cse72)) (- 10))))) (.cse37 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse67) .cse68) (- (* 2 (+ .cse62 (+ .cse69 12))))) (* 2 .cse67)) (- 10))) .cse70 (not .cse71) .cse66))) (or (let ((.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 19))) (.cse10 (+ |ULTIMATE.start_main_~y~0#1| .cse29 8)) (.cse0 (+ .cse28 (+ (+ |ULTIMATE.start_main_~x~0#1| (- 19)) (- 7)) 6))) (and (>= .cse0 0) .cse1 .cse2 (= .cse3 .cse4) .cse5 .cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse7)) .cse8 .cse9 (= .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse10)) (= .cse18 .cse19) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse21 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse18)) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| (* .cse10 (- 1))))) (= .cse22 (+ (+ (+ (* .cse22 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse23 .cse24 (= .cse0 .cse25) (= .cse26 .cse27))) (and .cse30 .cse31 .cse32 .cse5 .cse21 .cse23 .cse33 .cse8 .cse34 .cse35 .cse9 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse37) (let ((.cse39 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse41 (+ .cse47 |ULTIMATE.start_main_~x~0#1| 6))) (and (= .cse38 0) (= .cse39 6) (= .cse40 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse40)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse8 .cse13 (>= .cse41 0) .cse16 (= |ULTIMATE.start_main_~n~0#1| .cse27) .cse42 .cse43 (= .cse40 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse39)) (= .cse3 0) .cse21 .cse44 (= |ULTIMATE.start_main_~z~0#1| .cse45) .cse23 (= .cse41 .cse25) .cse46 (<= |ULTIMATE.start_main_~n~0#1| .cse27) (= |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse51 (+ .cse47 |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse48 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse52) (- 19))) (.cse50 (+ |ULTIMATE.start_main_~y~0#1| .cse29 .cse51)) (.cse49 (+ .cse28 (+ (+ .cse51 (- 19)) (- 7)) 6))) (and .cse1 .cse43 .cse2 .cse5 .cse21 (= .cse48 .cse19) (= .cse49 .cse25) .cse23 .cse8 (= (+ .cse26 (- 1)) .cse27) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse50)) .cse9 .cse24 .cse12 .cse13 .cse15 .cse16 (= .cse40 (+ 6 .cse48)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse50 (- 1))) .cse20) .cse17 (= .cse26 .cse4) (>= .cse49 0)))) (let ((.cse54 (+ .cse28 (+ |ULTIMATE.start_main_~x~0#1| (- 7)) 6)) (.cse55 (+ .cse40 (- 5))) (.cse53 (+ |ULTIMATE.start_main_~y~0#1| (- 7)))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse53)) (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse52 5) (- 1)) 0) .cse1 (= .cse54 .cse25) (= |ULTIMATE.start_main_~z~0#1| .cse19) .cse2 (>= .cse54 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse55 .cse40)) (= |ULTIMATE.start_main_~n~0#1| .cse4) .cse6 .cse8 .cse12 .cse14 .cse16 .cse17 (= |ULTIMATE.start_main_~z~0#1| .cse11) (= .cse38 (+ 1 (+ 12 (- 6)))) (= .cse3 .cse27) .cse21 .cse23 .cse46 (= |ULTIMATE.start_main_~y~0#1| (+ .cse38 12)) .cse24 (= (+ .cse55 (- 1)) 6) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse56)) (= .cse53 .cse45))) (and (>= |ULTIMATE.start_main_~x~0#1| 0) .cse2 .cse57 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 .cse42 .cse17 (= |ULTIMATE.start_main_~z~0#1| 6)) (and .cse30 .cse31 .cse32 .cse5 .cse21 .cse23 .cse33 .cse8 .cse34 .cse35 .cse9 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse37 (or (= 0 (+ (let ((.cse64 (+ 6 .cse65))) (let ((.cse60 (+ 6 .cse64))) (+ (let ((.cse63 (+ .cse62 .cse65))) (let ((.cse58 (+ .cse63 .cse64))) (+ (let ((.cse59 (+ (+ .cse61 .cse62) .cse63))) (+ (+ (* (* 2 .cse58) .cse58) (- (* (* 3 .cse59) .cse60))) (- (* 18 .cse59)))) (- (* 10 .cse58))))) (* 3 .cse60)))) (- 10))) .cse66)))))))) [2023-02-17 06:47:40,643 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 06:47:40,644 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 45) the Hoare annotation is: (let ((.cse101 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse57 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse97 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse93 (* .cse101 6)) (.cse56 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse107 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse111 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse87 (- .cse56)) (.cse106 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse114 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse99 (+ 6 (* 6 .cse101))) (.cse58 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse116 (+ .cse93 6)) (.cse47 (+ .cse57 .cse97)) (.cse16 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse62 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse115 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse92 (+ 1 .cse101))) (let ((.cse103 (* 2 .cse97)) (.cse91 (+ 1 .cse92)) (.cse63 (let ((.cse119 (= |ULTIMATE.start_main_~z~0#1| (+ .cse115 6)))) (or (let ((.cse118 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse117 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse118 (- 6)) 0))) (and (or (not .cse117) (<= 0 .cse16) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse118 (- 5)) 0))) (not .cse119) .cse62 (or .cse117 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse119))) (.cse102 (- (* 18 .cse47))) (.cse48 (+ .cse97 .cse116)) (.cse51 (+ 6 .cse116)) (.cse52 (not (= .cse116 .cse58))) (.cse105 (not (= .cse58 .cse99))) (.cse104 (- (* 18 .cse57))) (.cse108 (* 2 .cse58)) (.cse70 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse87) (- .cse106)) .cse114) (- 10)))) (.cse69 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse33 (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse115)))) (.cse60 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse107) .cse111) .cse114) (- 6)))) (.cse55 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse74 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse75 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse113 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (let ((.cse68 (+ 6 (+ 19 (- 7)))) (.cse37 (+ 6 (+ 7 (- 1)))) (.cse71 (< .cse113 65536)) (.cse72 (<= 0 .cse113)) (.cse73 (let ((.cse112 (+ .cse75 65536))) (and (<= .cse112 (+ .cse74 32767)) .cse55 (<= .cse112 (+ .cse74 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse9 (or .cse33 .cse60)) (.cse13 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse111) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse14 (or .cse69 (= 0 (+ (+ (* .cse56 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|))))) (.cse36 (or .cse33 .cse69 .cse70)) (.cse15 (or .cse105 (= 0 (+ (+ (+ (+ (* .cse97 .cse58) .cse104) (- (* 12 .cse97))) .cse108) (- 6))))) (.cse3 (or (= 0 (+ (+ (+ (+ (* .cse48 .cse51) .cse102) (- (* 12 .cse48))) (* 2 .cse51)) (- 6))) .cse52)) (.cse18 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse6 (let ((.cse109 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse110 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse110 |ULTIMATE.start_main_~n~0#1|) .cse110)))))) (or (and .cse63 .cse109) (and .cse63 (or .cse33 .cse109))))) (.cse77 (+ 6 (* 6 .cse91))) (.cse35 (not .cse69)) (.cse96 (+ 6 (* 6 .cse92))) (.cse80 (+ .cse97 .cse58)) (.cse81 (+ 6 .cse58)) (.cse100 (- .cse103)) (.cse30 (+ |ULTIMATE.start_main_~n~0#1| (- 1)))) (let ((.cse23 (* .cse16 (- 1))) (.cse27 (+ |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse1 (<= .cse30 |ULTIMATE.start_main_~a~0#1|)) (.cse38 (+ 6 6)) (.cse39 (= .cse57 (* (* .cse101 .cse101) .cse101))) (.cse32 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse58) .cse87) .cse100) .cse108) (- 10)))) (.cse34 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse24 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse41 (= 0 (+ (+ (+ (+ (+ (* .cse106 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse107) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse40 (or (= 0 (+ (+ (+ (+ (+ (* .cse103 .cse97) (- (* (* 3 .cse57) .cse58))) .cse104) (- (* 10 .cse97))) (* 3 .cse58)) (- 10))) .cse105)) (.cse42 (or (not (= .cse81 .cse96)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse80) .cse80) (- (* (* 3 .cse47) .cse81))) .cse102) (- (* 10 .cse80))) (* 3 .cse81)) (- 10))))) (.cse43 (let ((.cse90 (<= .cse91 |ULTIMATE.start_main_~a~0#1|)) (.cse94 (<= .cse92 |ULTIMATE.start_main_~a~0#1|)) (.cse95 (<= .cse101 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse82 (or .cse95 (not (= .cse99 .cse58)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse99) .cse87) .cse100) (* 2 .cse99)) (- 10))) .cse35)) (.cse83 (let ((.cse98 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse95) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse96) .cse87) (- (* 2 (+ .cse97 .cse98)))) (* 2 .cse96)) (- 10))) (not (= .cse98 .cse58)) .cse94))) (.cse84 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse77) .cse87) (- (* 2 (+ .cse48 (+ .cse93 12))))) (* 2 .cse77)) (- 10))) .cse90 (not .cse94) .cse52))) (or (and .cse9 .cse82 .cse13 .cse83 .cse14 .cse36 .cse15 .cse3 .cse18 .cse6 .cse84) (and .cse9 .cse82 .cse13 .cse83 (let ((.cse89 (* .cse92 6))) (let ((.cse85 (+ 1 .cse91)) (.cse88 (+ .cse89 6))) (or (<= .cse85 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse86 (+ 6 (* 6 .cse85)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse86) .cse87) (- (* 2 (+ (+ .cse80 .cse88) (+ .cse89 12))))) (* 2 .cse86))) (- 10))) (not .cse90) .cse35 (not (= .cse88 .cse81))))) .cse14 .cse36 .cse15 .cse3 .cse18 .cse6 .cse84))))) (.cse53 (let ((.cse76 (+ 6 .cse81))) (or (not (= .cse76 .cse77)) (= 0 (+ (+ (let ((.cse78 (+ .cse80 .cse81))) (+ (let ((.cse79 (+ .cse47 .cse80))) (+ (+ (* (* 2 .cse78) .cse78) (- (* (* 3 .cse79) .cse76))) (- (* 18 .cse79)))) (- (* 10 .cse78)))) (* 3 .cse76)) (- 10)))))) (.cse61 (or (and .cse71 (<= (+ .cse74 (- 65536)) .cse75) .cse72 (<= (+ .cse74 (- 32768)) .cse75)) .cse73)) (.cse5 (+ 6 .cse37)) (.cse0 (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse17 (+ 19 .cse68)) (.cse2 (or (and .cse71 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse72) .cse73)) (.cse19 (+ 1 1)) (.cse31 (or .cse69 .cse70)) (.cse25 (+ 6 12)) (.cse8 (* (* 0 0) 0)) (.cse10 (+ .cse30 (- 1))) (.cse11 (+ 1 0)) (.cse20 (* 7 (- 1))) (.cse22 (* |ULTIMATE.start_main_~x~0#1| (- 1)))) (or (let ((.cse21 (+ .cse24 |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse4 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse23) (- 19))) (.cse12 (+ |ULTIMATE.start_main_~y~0#1| .cse22 .cse21)) (.cse7 (+ .cse20 (+ (+ .cse21 (- 19)) (- 7)) 6))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 .cse5) .cse6 (= .cse7 .cse8) .cse9 (= (+ .cse10 (- 1)) .cse11) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse12)) .cse13 .cse14 .cse15 (= .cse16 (+ 6 .cse4)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse12 (- 1))) .cse17) .cse18 (= .cse10 .cse19) (>= .cse7 0)))) (let ((.cse28 (+ .cse20 (+ |ULTIMATE.start_main_~x~0#1| (- 7)) 6)) (.cse29 (+ .cse16 (- 5))) (.cse26 (+ |ULTIMATE.start_main_~y~0#1| (- 7)))) (and (= |ULTIMATE.start_main_~z~0#1| .cse25) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse26)) (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse23 5) (- 1)) 0) (= .cse27 (+ 1 (+ 12 (- 6)))) .cse0 (= .cse28 .cse8) (= |ULTIMATE.start_main_~z~0#1| .cse5) .cse2 (>= .cse28 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse29 .cse16)) (= .cse30 .cse11) (= |ULTIMATE.start_main_~n~0#1| .cse19) .cse31 .cse6 (or .cse32 .cse33 .cse34 .cse35) (= |ULTIMATE.start_main_~y~0#1| (+ .cse27 12)) .cse13 (= (+ .cse29 (- 1)) 6) .cse14 .cse36 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse37)) (= .cse26 .cse38) .cse18 (or .cse33 .cse39))) (and .cse40 .cse41 .cse42 .cse43 (or (= 0 (+ (let ((.cse50 (+ 6 .cse51))) (let ((.cse46 (+ 6 .cse50))) (+ (let ((.cse49 (+ .cse48 .cse51))) (let ((.cse44 (+ .cse49 .cse50))) (+ (let ((.cse45 (+ (+ .cse47 .cse48) .cse49))) (+ (+ (* (* 2 .cse44) .cse44) (- (* (* 3 .cse45) .cse46))) (- (* 18 .cse45)))) (- (* 10 .cse44))))) (* 3 .cse46)))) (- 10))) .cse52) .cse53) (let ((.cse54 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse59 (+ .cse24 |ULTIMATE.start_main_~x~0#1| 6))) (and (= .cse27 0) .cse1 (= .cse54 6) (= .cse16 (+ 6 (* 6 0))) .cse2 (= .cse16 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse54)) (= .cse30 0) .cse55 .cse6 (= |ULTIMATE.start_main_~z~0#1| .cse38) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse16)) (or .cse34 (= 0 (+ (+ (* .cse56 .cse57) (- (* .cse57 .cse58))) (* 12 .cse57))) .cse35) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) (= .cse59 .cse8) .cse39 (or .cse32 .cse34 .cse35) .cse60 (>= .cse59 0) (<= |ULTIMATE.start_main_~n~0#1| .cse11) (= |ULTIMATE.start_main_~n~0#1| .cse11) .cse61 (= |ULTIMATE.start_main_~x~0#1| 1))) (and (or .cse33 .cse41) .cse40 .cse42 .cse43 .cse53) (and (>= |ULTIMATE.start_main_~x~0#1| 0) .cse2 .cse62 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse63 .cse61 .cse18 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse66 (+ |ULTIMATE.start_main_~y~0#1| (- 19))) (.cse64 (+ |ULTIMATE.start_main_~y~0#1| .cse22 8)) (.cse65 (+ .cse20 (+ (+ |ULTIMATE.start_main_~x~0#1| (- 19)) (- 7)) 6))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse64)) (>= .cse65 0) (= .cse66 .cse5) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse17) .cse2 (= .cse30 .cse19) .cse3 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66)) .cse31 .cse6 (let ((.cse67 (+ |ULTIMATE.start_main_~y~0#1| (* .cse64 (- 1))))) (= .cse67 (+ (+ (+ (* .cse67 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse68)) (= .cse64 .cse25) .cse13 .cse14 .cse60 .cse36 .cse15 .cse18 (= .cse65 .cse8) (= .cse10 .cse11)))))))))) [2023-02-17 06:47:40,645 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 45) the Hoare annotation is: (let ((.cse82 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse93 (+ 1 .cse82)) (.cse79 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse69 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse57 (* .cse82 6)) (.cse86 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse28 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse31 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse32 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse97 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse56 (- .cse86)) (.cse95 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse75 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse98 (+ .cse57 6)) (.cse49 (+ .cse79 .cse69)) (.cse29 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse92 (+ 1 .cse93)) (.cse78 (* 2 .cse69)) (.cse81 (+ 6 (* 6 .cse82))) (.cse70 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse24 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse74 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse72 (* 2 .cse70)) (.cse71 (- (* 18 .cse79))) (.cse68 (not (= .cse70 .cse81))) (.cse76 (- .cse78)) (.cse55 (+ 6 (* 6 .cse92))) (.cse77 (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse29)) (.cse63 (- (* 18 .cse49))) (.cse50 (+ .cse69 .cse98)) (.cse53 (+ 6 .cse98)) (.cse54 (not (= .cse98 .cse70))) (.cse62 (+ .cse69 .cse70)) (.cse58 (<= .cse92 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse60 (+ 6 .cse70)) (.cse80 (<= .cse82 |ULTIMATE.start_main_~a~0#1|)) (.cse61 (+ 6 (* 6 .cse93))) (.cse59 (<= .cse93 |ULTIMATE.start_main_~a~0#1|)) (.cse67 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse26 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse56) (- .cse95)) .cse75) (- 10)))) (.cse73 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse30 (< .cse97 65536)) (.cse33 (<= 0 .cse97)) (.cse34 (let ((.cse96 (+ .cse32 65536))) (and (<= .cse96 (+ .cse31 32767)) .cse28 (<= .cse96 (+ .cse31 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse17 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse23 (* .cse17 (- 1))) (.cse20 (+ 1 1)) (.cse1 (or (and .cse30 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse33) .cse34)) (.cse10 (+ 1 0)) (.cse22 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse37 (= 0 (+ (+ (+ (+ (+ (* .cse95 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse73) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse38 (or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse67))) .cse26)) (.cse39 (let ((.cse94 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse80) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse61) .cse56) (- (* 2 (+ .cse69 .cse94)))) (* 2 .cse61)) (- 10))) (not (= .cse94 .cse70)) .cse59))) (.cse40 (let ((.cse91 (* .cse93 6))) (let ((.cse88 (+ 1 .cse92)) (.cse90 (+ .cse91 6))) (or (<= .cse88 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse89 (+ 6 (* 6 .cse88)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse89) .cse56) (- (* 2 (+ (+ .cse62 .cse90) (+ .cse91 12))))) (* 2 .cse89))) (- 10))) (not .cse58) .cse19 (not (= .cse90 .cse60)))))) (.cse2 (or (= 0 (+ (+ (+ (+ (* .cse50 .cse53) .cse63) (- (* 12 .cse50))) (* 2 .cse53)) (- 6))) .cse54)) (.cse3 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse87 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse87 |ULTIMATE.start_main_~n~0#1|) .cse87))))) (.cse5 (= 0 (+ (+ (* .cse86 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse7 (or .cse77 (= 0 (+ (+ (* .cse86 .cse79) (- (* .cse79 .cse70))) (* 12 .cse79))) .cse19)) (.cse41 (let ((.cse83 (+ 6 .cse60))) (or (not (= .cse83 .cse55)) (= 0 (+ (+ (let ((.cse84 (+ .cse62 .cse60))) (+ (let ((.cse85 (+ .cse49 .cse62))) (+ (+ (* (* 2 .cse84) .cse84) (- (* (* 3 .cse85) .cse83))) (- (* 18 .cse85)))) (- (* 10 .cse84)))) (* 3 .cse83)) (- 10)))))) (.cse8 (= .cse79 (* (* .cse82 .cse82) .cse82))) (.cse42 (or .cse80 (not (= .cse81 .cse70)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse81) .cse56) .cse76) (* 2 .cse81)) (- 10))) .cse19)) (.cse43 (or (= 0 (+ (+ (+ (+ (+ (* .cse78 .cse69) (- (* (* 3 .cse79) .cse70))) .cse71) (- (* 10 .cse69))) (* 3 .cse70)) (- 10))) .cse68)) (.cse12 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse70) .cse56) .cse76) .cse72) (- 10))) .cse77 .cse19)) (.cse13 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse74) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse14 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse73) .cse74) .cse75) (- 6)))) (.cse15 (or .cse68 (= 0 (+ (+ (+ (+ (* .cse69 .cse70) .cse71) (- (* 12 .cse69))) .cse72) (- 6))))) (.cse16 (let ((.cse66 (= |ULTIMATE.start_main_~z~0#1| (+ .cse67 6)))) (or (let ((.cse65 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse64 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse65 (- 6)) 0))) (and (or (not .cse64) (<= 0 .cse17) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse65 (- 5)) 0))) (not .cse66) .cse24 (or .cse64 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse66))) (.cse18 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse44 (or (not (= .cse60 .cse61)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse62) .cse62) (- (* (* 3 .cse49) .cse60))) .cse63) (- (* 10 .cse62))) (* 3 .cse60)) (- 10))))) (.cse45 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse55) .cse56) (- (* 2 (+ .cse50 (+ .cse57 12))))) (* 2 .cse55)) (- 10))) .cse58 (not .cse59) .cse54))) (or (let ((.cse0 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse21 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse4 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse23) (- 19))) (.cse11 (+ |ULTIMATE.start_main_~y~0#1| .cse22 .cse21)) (.cse9 (+ .cse0 (- 1))) (.cse6 (+ (* 7 (- 1)) (+ (+ .cse21 (- 19)) (- 7)) 6))) (and (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|) (<= .cse0 |ULTIMATE.start_main_~a~0#1|) .cse1 .cse2 .cse3 (= .cse4 (+ 6 (+ 6 (+ 7 (- 1))))) .cse5 (= .cse6 (* (* 0 0) 0)) .cse7 .cse8 (= (+ .cse9 (- 1)) .cse10) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse11)) .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse17 (+ 6 .cse4)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse11 (- 1))) (+ 19 (+ 6 (+ 19 (- 7))))) .cse18 .cse19 (= .cse9 .cse20) (>= .cse6 0)))) (and .cse24 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse25 (+ .cse17 (- 5)))) (and (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse23 5) (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse25 .cse17)) .cse26 .cse3 (= |ULTIMATE.start_main_~n~0#1| .cse20) .cse5 .cse7 .cse8 .cse12 .cse13 (= (+ .cse25 (- 1)) 6) .cse14 .cse16 .cse18)) (let ((.cse27 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (and (= .cse27 6) .cse1 (= .cse17 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse27)) .cse3 .cse28 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse17)) .cse7 .cse8 .cse12 (<= .cse29 1) .cse14 (<= |ULTIMATE.start_main_~n~0#1| .cse10) .cse16 (= |ULTIMATE.start_main_~n~0#1| .cse10) (or (and .cse30 (<= (+ .cse31 (- 65536)) .cse32) .cse33 (<= (+ .cse31 (- 32768)) .cse32)) .cse34) .cse18 (= |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse35 (+ |ULTIMATE.start_main_~y~0#1| .cse22 8))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse35)) .cse26 .cse2 .cse3 .cse5 (let ((.cse36 (+ |ULTIMATE.start_main_~y~0#1| (* .cse35 (- 1))))) (= .cse36 (+ (+ (+ (* .cse36 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse7 .cse8 .cse12 (= .cse35 (+ 6 12)) .cse13 .cse14 .cse15 .cse16 .cse18)) (and .cse37 .cse38 .cse39 .cse40 .cse2 .cse3 .cse5 .cse7 .cse41 .cse8 .cse42 .cse43 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse44 .cse45) (and .cse37 .cse38 .cse39 .cse40 .cse2 .cse3 .cse5 .cse7 .cse41 .cse8 .cse42 .cse43 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse44 .cse45 (or (= 0 (+ (let ((.cse52 (+ 6 .cse53))) (let ((.cse48 (+ 6 .cse52))) (+ (let ((.cse51 (+ .cse50 .cse53))) (let ((.cse46 (+ .cse51 .cse52))) (+ (let ((.cse47 (+ (+ .cse49 .cse50) .cse51))) (+ (+ (* (* 2 .cse46) .cse46) (- (* (* 3 .cse47) .cse48))) (- (* 18 .cse47)))) (- (* 10 .cse46))))) (* 3 .cse48)))) (- 10))) .cse54)))))))) [2023-02-17 06:47:40,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 06:47:40,645 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~z~0#1| 6)) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse10 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse9 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse8 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse9 (- 6)) 0))) (and (or (not .cse8) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse9 (- 5)) 0))) (not .cse10) .cse1 (or .cse8 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse10)))) (or (and .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse7 |ULTIMATE.start_main_~n~0#1|) .cse7))))) (and .cse1 .cse2 .cse6 .cse4))))) (or (and .cse5 .cse1 .cse3 .cse4) (and .cse5 (= |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 (and .cse0 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (and .cse0 .cse1 .cse2 .cse3 .cse4)))) [2023-02-17 06:47:40,646 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse71 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse52 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse51 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse70 (* .cse71 6))) (let ((.cse67 (+ 1 .cse71)) (.cse84 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse86 (+ .cse70 6)) (.cse36 (+ .cse52 .cse51)) (.cse50 (* 2 .cse51)) (.cse53 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse68 (+ 6 (* 6 .cse71)))) (let ((.cse72 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse11 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse7 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse55 (not (= .cse53 .cse68))) (.cse54 (- (* 18 .cse52))) (.cse49 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse81 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse69 (- .cse50)) (.cse80 (* 2 .cse53)) (.cse83 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse65 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse40 (- (* 18 .cse36))) (.cse44 (+ .cse51 .cse86)) (.cse47 (+ 6 .cse86)) (.cse5 (not (= .cse86 .cse53))) (.cse57 (- .cse84)) (.cse48 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse82 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse66 (+ 1 .cse67))) (let ((.cse39 (+ 6 (* 6 .cse67))) (.cse37 (+ .cse51 .cse53)) (.cse38 (+ 6 .cse53)) (.cse33 (+ 6 (* 6 .cse66))) (.cse12 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse57) (- .cse48)) .cse82) (- 10)))) (.cse29 (or (= 0 (+ (+ (+ (+ (* .cse44 .cse47) .cse40) (- (* 12 .cse44))) (* 2 .cse47)) (- 6))) .cse5)) (.cse13 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse85 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse85 |ULTIMATE.start_main_~n~0#1|) .cse85))))) (.cse15 (= 0 (+ (+ (* .cse84 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse16 (or .cse83 (= 0 (+ (+ (* .cse84 .cse52) (- (* .cse52 .cse53))) (* 12 .cse52))) .cse65)) (.cse17 (= .cse52 (* (* .cse71 .cse71) .cse71))) (.cse18 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse53) .cse57) .cse69) .cse80) (- 10))) .cse83 .cse65)) (.cse19 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse81) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse20 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse49) .cse81) .cse82) (- 6)))) (.cse31 (or .cse55 (= 0 (+ (+ (+ (+ (* .cse51 .cse53) .cse54) (- (* 12 .cse51))) .cse80) (- 6))))) (.cse8 (let ((.cse79 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse78 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse77 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse78 (- 6)) 0))) (and (or (not .cse77) (<= 0 .cse11) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse78 (- 5)) 0))) (not .cse79) .cse7 (or .cse77 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse79))) (.cse21 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse22 (+ .cse72 (- 1))) (.cse14 (+ 1 1)) (.cse9 (* .cse11 (- 1)))) (let ((.cse0 (or (let ((.cse56 (<= .cse71 |ULTIMATE.start_main_~a~0#1|)) (.cse64 (<= .cse66 |ULTIMATE.start_main_~a~0#1|)) (.cse59 (<= .cse67 |ULTIMATE.start_main_~a~0#1|))) (and (let ((.cse58 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse56) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse39) .cse57) (- (* 2 (+ .cse51 .cse58)))) (* 2 .cse39)) (- 10))) (not (= .cse58 .cse53)) .cse59)) (let ((.cse63 (* .cse67 6))) (let ((.cse60 (+ 1 .cse66)) (.cse62 (+ .cse63 6))) (or (<= .cse60 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse61 (+ 6 (* 6 .cse60)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse61) .cse57) (- (* 2 (+ (+ .cse37 .cse62) (+ .cse63 12))))) (* 2 .cse61))) (- 10))) (not .cse64) .cse65 (not (= .cse62 .cse38))))) .cse12 .cse29 .cse13 .cse15 .cse16 .cse17 (or .cse56 (not (= .cse68 .cse53)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse68) .cse57) .cse69) (* 2 .cse68)) (- 10))) .cse65) .cse18 .cse19 .cse20 .cse31 .cse8 .cse21 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse33) .cse57) (- (* 2 (+ .cse44 (+ .cse70 12))))) (* 2 .cse33)) (- 10))) .cse64 (not .cse59) .cse5))) (let ((.cse76 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse9) (- 19)))) (and (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|) (<= .cse72 |ULTIMATE.start_main_~a~0#1|) (or (let ((.cse73 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse73 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse73))) (let ((.cse74 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse75 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse74 (+ .cse75 32767)) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= .cse74 (+ .cse75 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) .cse12 .cse29 .cse13 (= .cse76 (+ 6 (+ 6 (+ 7 (- 1))))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31 .cse8 (= .cse11 (+ 6 .cse76)) .cse21 .cse65 (= .cse22 .cse14))))) (.cse1 (or (= 0 (+ (+ (+ (+ (+ (* .cse50 .cse51) (- (* (* 3 .cse52) .cse53))) .cse54) (- (* 10 .cse51))) (* 3 .cse53)) (- 10))) .cse55)) (.cse2 (= 0 (+ (+ (+ (+ (+ (* .cse48 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse49) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse4 (= 0 (+ (let ((.cse46 (+ 6 .cse47))) (let ((.cse43 (+ 6 .cse46))) (+ (let ((.cse45 (+ .cse44 .cse47))) (let ((.cse41 (+ .cse45 .cse46))) (+ (let ((.cse42 (+ (+ .cse36 .cse44) .cse45))) (+ (+ (* (* 2 .cse41) .cse41) (- (* (* 3 .cse42) .cse43))) (- (* 18 .cse42)))) (- (* 10 .cse41))))) (* 3 .cse43)))) (- 10)))) (.cse3 (or (not (= .cse38 .cse39)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse37) .cse37) (- (* (* 3 .cse36) .cse38))) .cse40) (- (* 10 .cse37))) (* 3 .cse38)) (- 10))))) (.cse6 (let ((.cse32 (+ 6 .cse38))) (or (not (= .cse32 .cse33)) (= 0 (+ (+ (let ((.cse34 (+ .cse37 .cse38))) (+ (let ((.cse35 (+ .cse36 .cse37))) (+ (+ (* (* 2 .cse34) .cse34) (- (* (* 3 .cse35) .cse32))) (- (* 18 .cse35)))) (- (* 10 .cse34)))) (* 3 .cse32)) (- 10)))))) (.cse27 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse23 (+ 1 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or .cse4 .cse5) .cse6) (and .cse7 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse8 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse10 (+ .cse11 (- 5)))) (and (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse9 5) (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse10 .cse11)) .cse12 .cse13 (= |ULTIMATE.start_main_~n~0#1| .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 (= (+ .cse10 (- 1)) 6) .cse20 .cse8 .cse21)) (let ((.cse26 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse24 (+ |ULTIMATE.start_main_~y~0#1| .cse27 .cse26)) (.cse25 (+ (* 7 (- 1)) (+ (+ .cse26 (- 19)) (- 7)) 6))) (and (= (+ .cse22 (- 1)) .cse23) .cse0 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse24)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse24 (- 1))) (+ 19 (+ 6 (+ 19 (- 7))))) (= .cse25 (* (* 0 0) 0)) (>= .cse25 0)))) (and .cse0 .cse1 .cse2 (or (not .cse21) .cse4 .cse5) .cse3 .cse6) (let ((.cse28 (+ |ULTIMATE.start_main_~y~0#1| .cse27 8))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse28)) .cse12 .cse29 .cse13 .cse15 (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| (* .cse28 (- 1))))) (= .cse30 (+ (+ (+ (* .cse30 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse16 .cse17 .cse18 (= .cse28 (+ 6 12)) .cse19 .cse20 .cse31 .cse8 .cse21)) (and .cse17 .cse20 (= .cse11 6) .cse8 .cse13 (= |ULTIMATE.start_main_~n~0#1| .cse23) .cse21 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse11)))))))))) [2023-02-17 06:47:40,647 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse73 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse79 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse58 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse72 (* .cse73 6))) (let ((.cse89 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse69 (+ 1 .cse73)) (.cse24 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse27 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse28 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse92 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse93 (+ .cse72 6)) (.cse37 (+ .cse79 .cse58)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse78 (* 2 .cse58)) (.cse60 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse70 (+ 6 (* 6 .cse73)))) (let ((.cse74 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse81 (not (= .cse60 .cse70))) (.cse80 (- (* 18 .cse79))) (.cse77 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse86 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse71 (- .cse78)) (.cse85 (* 2 .cse60)) (.cse88 (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse25)) (.cse67 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse55 (- (* 18 .cse37))) (.cse38 (+ .cse58 .cse93)) (.cse41 (+ 6 .cse93)) (.cse42 (not (= .cse93 .cse60))) (.cse26 (< .cse92 65536)) (.cse29 (<= 0 .cse92)) (.cse30 (let ((.cse91 (+ .cse28 65536))) (and (<= .cse91 (+ .cse27 32767)) .cse24 (<= .cse91 (+ .cse27 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse68 (+ 1 .cse69)) (.cse57 (- .cse89)) (.cse76 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse87 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse54 (+ 6 (* 6 .cse69))) (.cse52 (+ .cse58 .cse60)) (.cse53 (+ 6 .cse60)) (.cse5 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse57) (- .cse76)) .cse87) (- 10)))) (.cse49 (+ 6 (* 6 .cse68))) (.cse23 (or (and .cse26 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse29) .cse30)) (.cse45 (or (= 0 (+ (+ (+ (+ (* .cse38 .cse41) .cse55) (- (* 12 .cse38))) (* 2 .cse41)) (- 6))) .cse42)) (.cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse90 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse90 |ULTIMATE.start_main_~n~0#1|) .cse90))))) (.cse8 (= 0 (+ (+ (* .cse89 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse9 (or .cse88 (= 0 (+ (+ (* .cse89 .cse79) (- (* .cse79 .cse60))) (* 12 .cse79))) .cse67)) (.cse10 (= .cse79 (* (* .cse73 .cse73) .cse73))) (.cse11 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse60) .cse57) .cse71) .cse85) (- 10))) .cse88 .cse67)) (.cse12 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse86) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse77) .cse86) .cse87) (- 6)))) (.cse47 (or .cse81 (= 0 (+ (+ (+ (+ (* .cse58 .cse60) .cse80) (- (* 12 .cse58))) .cse85) (- 6))))) (.cse1 (let ((.cse84 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse83 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse82 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse83 (- 6)) 0))) (and (or (not .cse82) (<= 0 .cse4) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse83 (- 5)) 0))) (not .cse84) .cse0 (or .cse82 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse84))) (.cse14 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse15 (+ .cse74 (- 1))) (.cse7 (+ 1 1)) (.cse2 (* .cse4 (- 1)))) (let ((.cse16 (+ 1 0)) (.cse31 (or (= 0 (+ (+ (+ (+ (+ (* .cse78 .cse58) (- (* (* 3 .cse79) .cse60))) .cse80) (- (* 10 .cse58))) (* 3 .cse60)) (- 10))) .cse81)) (.cse32 (= 0 (+ (+ (+ (+ (+ (* .cse76 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse77) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse18 (or (let ((.cse56 (<= .cse73 |ULTIMATE.start_main_~a~0#1|)) (.cse66 (<= .cse68 |ULTIMATE.start_main_~a~0#1|)) (.cse61 (<= .cse69 |ULTIMATE.start_main_~a~0#1|))) (and (let ((.cse59 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse56) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse54) .cse57) (- (* 2 (+ .cse58 .cse59)))) (* 2 .cse54)) (- 10))) (not (= .cse59 .cse60)) .cse61)) (let ((.cse65 (* .cse69 6))) (let ((.cse62 (+ 1 .cse68)) (.cse64 (+ .cse65 6))) (or (<= .cse62 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse63 (+ 6 (* 6 .cse62)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse63) .cse57) (- (* 2 (+ (+ .cse52 .cse64) (+ .cse65 12))))) (* 2 .cse63))) (- 10))) (not .cse66) .cse67 (not (= .cse64 .cse53))))) .cse45 .cse5 .cse6 .cse8 .cse9 .cse10 (or .cse56 (not (= .cse70 .cse60)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse70) .cse57) .cse71) (* 2 .cse70)) (- 10))) .cse67) .cse11 .cse12 .cse13 .cse47 .cse1 .cse14 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse49) .cse57) (- (* 2 (+ .cse38 (+ .cse72 12))))) (* 2 .cse49)) (- 10))) .cse66 (not .cse61) .cse42))) (let ((.cse75 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse2) (- 19)))) (and (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|) (<= .cse74 |ULTIMATE.start_main_~a~0#1|) .cse23 .cse45 .cse6 (= .cse75 (+ 6 (+ 6 (+ 7 (- 1))))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse47 .cse1 (= .cse4 (+ 6 .cse75)) .cse14 .cse67 (= .cse15 .cse7))))) (.cse33 (or (not (= .cse53 .cse54)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse52) .cse52) (- (* (* 3 .cse37) .cse53))) .cse55) (- (* 10 .cse52))) (* 3 .cse53)) (- 10))))) (.cse43 (let ((.cse48 (+ 6 .cse53))) (or (not (= .cse48 .cse49)) (= 0 (+ (+ (let ((.cse50 (+ .cse52 .cse53))) (+ (let ((.cse51 (+ .cse37 .cse52))) (+ (+ (* (* 2 .cse50) .cse50) (- (* (* 3 .cse51) .cse48))) (- (* 18 .cse51)))) (- (* 10 .cse50)))) (* 3 .cse48)) (- 10)))))) (.cse21 (* |ULTIMATE.start_main_~x~0#1| (- 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse1 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse3 (+ .cse4 (- 5)))) (and (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse2 5) (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse3 .cse4)) .cse5 .cse6 (= |ULTIMATE.start_main_~n~0#1| .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 (= (+ .cse3 (- 1)) 6) .cse13 .cse1 .cse14)) (let ((.cse20 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse17 (+ |ULTIMATE.start_main_~y~0#1| .cse21 .cse20)) (.cse19 (+ (* 7 (- 1)) (+ (+ .cse20 (- 19)) (- 7)) 6))) (and (= (+ .cse15 (- 1)) .cse16) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse17)) .cse18 (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse17 (- 1))) (+ 19 (+ 6 (+ 19 (- 7))))) (= .cse19 (* (* 0 0) 0)) (>= .cse19 0)))) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (and (= .cse22 6) .cse23 (= .cse4 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse22)) .cse6 .cse24 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse4)) .cse9 .cse10 .cse11 (<= .cse25 1) .cse13 (<= |ULTIMATE.start_main_~n~0#1| .cse16) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse16) (or (and .cse26 (<= (+ .cse27 (- 65536)) .cse28) .cse29 (<= (+ .cse27 (- 32768)) .cse28)) .cse30) .cse14 (= |ULTIMATE.start_main_~x~0#1| 1))) (and .cse31 .cse32 .cse18 .cse33 (or (= 0 (+ (let ((.cse40 (+ 6 .cse41))) (let ((.cse36 (+ 6 .cse40))) (+ (let ((.cse39 (+ .cse38 .cse41))) (let ((.cse34 (+ .cse39 .cse40))) (+ (let ((.cse35 (+ (+ .cse37 .cse38) .cse39))) (+ (+ (* (* 2 .cse34) .cse34) (- (* (* 3 .cse35) .cse36))) (- (* 18 .cse35)))) (- (* 10 .cse34))))) (* 3 .cse36)))) (- 10))) .cse42) .cse43) (and .cse31 .cse32 .cse18 .cse33 .cse43) (let ((.cse44 (+ |ULTIMATE.start_main_~y~0#1| .cse21 8))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse44)) .cse5 .cse45 .cse6 .cse8 (let ((.cse46 (+ |ULTIMATE.start_main_~y~0#1| (* .cse44 (- 1))))) (= .cse46 (+ (+ (+ (* .cse46 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse9 .cse10 .cse11 (= .cse44 (+ 6 12)) .cse12 .cse13 .cse47 .cse1 .cse14))))))))) [2023-02-17 06:47:40,647 INFO L899 garLoopResultBuilder]: For program point L37(lines 32 45) no Hoare annotation was computed. [2023-02-17 06:47:40,648 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse81 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse100 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse110 (+ 1 .cse100)) (.cse96 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse69 (* .cse100 6)) (.cse82 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse95 (* 2 .cse81)) (.cse91 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse112 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse90 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse86 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse68 (- .cse91)) (.cse99 (- .cse95)) (.cse84 (* 2 .cse82)) (.cse36 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse114 (* |ULTIMATE.start_main_~a~0#1| (- 1))) (.cse115 (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536)) (.cse119 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse120 (+ .cse69 6)) (.cse61 (+ .cse96 .cse81)) (.cse109 (+ 1 .cse110)) (.cse98 (+ 6 (* 6 .cse100))) (.cse79 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse57 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse89 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse85 (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse79)))) (.cse83 (- (* 18 .cse96))) (.cse80 (not (= .cse82 .cse98))) (.cse67 (+ 6 (* 6 .cse109))) (.cse75 (- (* 18 .cse61))) (.cse62 (+ .cse81 .cse120)) (.cse65 (+ 6 .cse120)) (.cse66 (not (= .cse120 .cse82))) (.cse74 (+ .cse81 .cse82)) (.cse70 (<= .cse109 |ULTIMATE.start_main_~a~0#1|)) (.cse72 (+ 6 .cse82)) (.cse97 (<= .cse100 |ULTIMATE.start_main_~a~0#1|)) (.cse73 (+ 6 (* 6 .cse110))) (.cse71 (<= .cse110 |ULTIMATE.start_main_~a~0#1|)) (.cse88 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse113 (< .cse119 65536)) (.cse116 (<= 0 .cse119)) (.cse117 (let ((.cse118 (+ .cse115 65536))) (and (<= .cse118 (+ .cse114 32767)) .cse36 (<= .cse118 (+ .cse114 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse32 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse7 (+ 6 (+ 19 (- 7)))) (.cse52 (+ 6 (+ 7 (- 1)))) (.cse3 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse92 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse82) .cse68) .cse99) .cse84) (- 10)))) (.cse93 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse94 (not .cse86)) (.cse87 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse68) (- .cse112)) .cse90) (- 10))))) (let ((.cse6 (or .cse86 .cse87)) (.cse11 (+ 6 12)) (.cse38 (or .cse92 .cse93 .cse94)) (.cse30 (+ |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse37 (+ 6 6)) (.cse1 (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse35 (<= .cse3 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (+ 6 .cse52)) (.cse25 (* (* 0 0) 0)) (.cse27 (+ 1 0)) (.cse20 (+ 19 .cse7)) (.cse26 (+ .cse3 (- 1))) (.cse4 (+ 1 1)) (.cse28 (* 7 (- 1))) (.cse29 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse49 (* .cse32 (- 1))) (.cse39 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse2 (or (and .cse113 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse116) .cse117)) (.cse34 (or (and .cse113 (<= (+ .cse114 (- 65536)) .cse115) .cse116 (<= (+ .cse114 (- 32768)) .cse115)) .cse117)) (.cse40 (= 0 (+ (+ (+ (+ (+ (* .cse112 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse88) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)))) (.cse41 (let ((.cse111 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse97) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse73) .cse68) (- (* 2 (+ .cse81 .cse111)))) (* 2 .cse73)) (- 10))) (not (= .cse111 .cse82)) .cse71))) (.cse42 (let ((.cse108 (* .cse110 6))) (let ((.cse105 (+ 1 .cse109)) (.cse107 (+ .cse108 6))) (or (<= .cse105 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse106 (+ 6 (* 6 .cse105)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse106) .cse68) (- (* 2 (+ (+ .cse74 .cse107) (+ .cse108 12))))) (* 2 .cse106))) (- 10))) (not .cse70) .cse94 (not (= .cse107 .cse72)))))) (.cse5 (or (= 0 (+ (+ (+ (+ (* .cse62 .cse65) .cse75) (- (* 12 .cse62))) (* 2 .cse65)) (- 6))) .cse66)) (.cse21 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse104 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse104 |ULTIMATE.start_main_~n~0#1|) .cse104))))) (.cse23 (or .cse93 (= 0 (+ (+ (* .cse91 .cse96) (- (* .cse96 .cse82))) (* 12 .cse96))) .cse94)) (.cse43 (let ((.cse101 (+ 6 .cse72))) (or (not (= .cse101 .cse67)) (= 0 (+ (+ (let ((.cse102 (+ .cse74 .cse72))) (+ (let ((.cse103 (+ .cse61 .cse74))) (+ (+ (* (* 2 .cse102) .cse102) (- (* (* 3 .cse103) .cse101))) (- (* 18 .cse103)))) (- (* 10 .cse102)))) (* 3 .cse101)) (- 10)))))) (.cse8 (= .cse96 (* (* .cse100 .cse100) .cse100))) (.cse44 (or .cse97 (not (= .cse98 .cse82)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse98) .cse68) .cse99) (* 2 .cse98)) (- 10))) .cse94)) (.cse45 (or (= 0 (+ (+ (+ (+ (+ (* .cse95 .cse81) (- (* (* 3 .cse96) .cse82))) .cse83) (- (* 10 .cse81))) (* 3 .cse82)) (- 10))) .cse80)) (.cse9 (or .cse92 .cse85 .cse93 .cse94)) (.cse24 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse89) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse12 (or .cse86 (= 0 (+ (+ (* .cse91 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|))))) (.cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse88) .cse89) .cse90) (- 6)))) (.cse14 (or .cse85 .cse86 .cse87)) (.cse15 (or .cse80 (= 0 (+ (+ (+ (+ (* .cse81 .cse82) .cse83) (- (* 12 .cse81))) .cse84) (- 6))))) (.cse16 (let ((.cse78 (= |ULTIMATE.start_main_~z~0#1| (+ .cse79 6)))) (or (let ((.cse77 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse76 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse77 (- 6)) 0))) (and (or (not .cse76) (<= 0 .cse32) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse77 (- 5)) 0))) (not .cse78) .cse57 (or .cse76 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse78))) (.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|))) (.cse46 (or (not (= .cse72 .cse73)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse74) .cse74) (- (* (* 3 .cse61) .cse72))) .cse75) (- (* 10 .cse74))) (* 3 .cse72)) (- 10))))) (.cse47 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse67) .cse68) (- (* 2 (+ .cse62 (+ .cse69 12))))) (* 2 .cse67)) (- 10))) .cse70 (not .cse71) .cse66))) (or (let ((.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 19))) (.cse10 (+ |ULTIMATE.start_main_~y~0#1| .cse29 8)) (.cse0 (+ .cse28 (+ (+ |ULTIMATE.start_main_~x~0#1| (- 19)) (- 7)) 6))) (and (>= .cse0 0) .cse1 .cse2 (= .cse3 .cse4) .cse5 .cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse7)) .cse8 .cse9 (= .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse10)) (= .cse18 .cse19) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse21 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse18)) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| (* .cse10 (- 1))))) (= .cse22 (+ (+ (+ (* .cse22 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse23 .cse24 (= .cse0 .cse25) (= .cse26 .cse27))) (let ((.cse31 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse33 (+ .cse39 |ULTIMATE.start_main_~x~0#1| 6))) (and (= .cse30 0) (= .cse31 6) (= .cse32 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse32)) (= (+ |ULTIMATE.start_main_~y~0#1| (* 6 (- 1))) 1) .cse8 .cse13 (>= .cse33 0) .cse16 (= |ULTIMATE.start_main_~n~0#1| .cse27) .cse34 .cse17 .cse35 (= .cse32 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse31)) (= .cse3 0) .cse21 .cse36 (= |ULTIMATE.start_main_~z~0#1| .cse37) .cse23 (= .cse33 .cse25) .cse38 (<= |ULTIMATE.start_main_~n~0#1| .cse27) (= |ULTIMATE.start_main_~x~0#1| 1))) (and .cse40 .cse41 .cse42 .cse5 .cse21 .cse23 .cse43 .cse8 .cse44 .cse45 .cse9 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse47) (let ((.cse50 (+ .cse28 (+ |ULTIMATE.start_main_~x~0#1| (- 7)) 6)) (.cse51 (+ .cse32 (- 5))) (.cse48 (+ |ULTIMATE.start_main_~y~0#1| (- 7)))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse48)) (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse49 5) (- 1)) 0) .cse1 (= .cse50 .cse25) (= |ULTIMATE.start_main_~z~0#1| .cse19) .cse2 (>= .cse50 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse51 .cse32)) (= |ULTIMATE.start_main_~n~0#1| .cse4) .cse6 .cse8 .cse12 .cse14 .cse16 .cse17 (= |ULTIMATE.start_main_~z~0#1| .cse11) (= .cse30 (+ 1 (+ 12 (- 6)))) (= .cse3 .cse27) .cse21 .cse23 .cse38 (= |ULTIMATE.start_main_~y~0#1| (+ .cse30 12)) .cse24 (= (+ .cse51 (- 1)) 6) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse52)) (= .cse48 .cse37))) (let ((.cse56 (+ .cse39 |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse53 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse49) (- 19))) (.cse55 (+ |ULTIMATE.start_main_~y~0#1| .cse29 .cse56)) (.cse54 (+ .cse28 (+ (+ .cse56 (- 19)) (- 7)) 6))) (and .cse1 .cse35 .cse2 .cse5 .cse21 (= .cse53 .cse19) (= .cse54 .cse25) .cse23 .cse8 (= (+ .cse26 (- 1)) .cse27) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse55)) .cse9 .cse24 .cse12 .cse13 .cse15 .cse16 (= .cse32 (+ 6 .cse53)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse55 (- 1))) .cse20) .cse17 (= .cse26 .cse4) (>= .cse54 0)))) (and (>= |ULTIMATE.start_main_~x~0#1| 0) .cse2 .cse57 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 .cse34 .cse17 (= |ULTIMATE.start_main_~z~0#1| 6)) (and .cse40 .cse41 .cse42 .cse5 .cse21 .cse23 .cse43 .cse8 .cse44 .cse45 .cse9 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse47 (or (= 0 (+ (let ((.cse64 (+ 6 .cse65))) (let ((.cse60 (+ 6 .cse64))) (+ (let ((.cse63 (+ .cse62 .cse65))) (let ((.cse58 (+ .cse63 .cse64))) (+ (let ((.cse59 (+ (+ .cse61 .cse62) .cse63))) (+ (+ (* (* 2 .cse58) .cse58) (- (* (* 3 .cse59) .cse60))) (- (* 18 .cse59)))) (- (* 10 .cse58))))) (* 3 .cse60)))) (- 10))) .cse66)))))))) [2023-02-17 06:47:40,648 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 06:47:40,648 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 06:47:40,648 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 06:47:40,648 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 06:47:40,649 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: (let ((.cse27 (* (- 1) 65536))) (let ((.cse24 (+ .cse27 65536)) (.cse26 (* 0 (- 1))) (.cse28 (+ 0 65536))) (let ((.cse16 (< .cse28 65536)) (.cse17 (<= 0 .cse28)) (.cse19 (<= (+ .cse26 (- 32768)) .cse27)) (.cse18 (<= (+ .cse26 (- 65536)) .cse27)) (.cse21 (<= .cse24 (+ .cse26 32767))) (.cse22 (<= .cse24 (+ .cse26 65535))) (.cse20 (< 0 65536)) (.cse23 (+ 3 65536)) (.cse25 (* 3 (- 1)))) (let ((.cse2 (<= (+ 4 (- 1)) 3)) (.cse10 (<= (+ 1 (- 1)) 3)) (.cse9 (<= .cse24 (+ .cse25 32767))) (.cse7 (<= 0 3)) (.cse6 (< 3 65536)) (.cse8 (<= .cse24 (+ .cse25 65535))) (.cse3 (<= 0 .cse23)) (.cse4 (<= 3 32767)) (.cse5 (< .cse23 65536)) (.cse12 (<= 4 3)) (.cse0 (= |__VERIFIER_assert_#in~cond| 1)) (.cse1 (<= (+ 0 1) 1)) (.cse11 (or (and .cse16 .cse17 .cse19 .cse18) (and .cse21 .cse22 .cse20)))) (or (and .cse0 .cse1 .cse2 (or (and .cse3 (not .cse4) .cse5) (and .cse6 .cse7 .cse8 .cse9)) .cse10 .cse11 (not .cse12)) (let ((.cse13 (and (or (not .cse16) (not .cse17) (not .cse18) (not .cse19)) (or (not .cse20) (not .cse21) (not .cse22)))) (.cse14 (not .cse0)) (.cse15 (not .cse1))) (and (or .cse13 .cse14 .cse15 (not .cse2) (not .cse10) (and (or (not .cse9) (not .cse7) (not .cse6) (not .cse8)) (or (not .cse3) .cse4 (not .cse5))) .cse12) (or .cse13 .cse14 .cse15))) (and .cse0 .cse1 .cse11)))))) [2023-02-17 06:47:40,649 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 06:47:40,651 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 06:47:40,652 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 06:47:40,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 06:47:40 BoogieIcfgContainer [2023-02-17 06:47:40,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 06:47:40,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 06:47:40,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 06:47:40,710 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 06:47:40,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:45:57" (3/4) ... [2023-02-17 06:47:40,713 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 06:47:40,717 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 06:47:40,721 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 06:47:40,721 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 06:47:40,721 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 06:47:40,721 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 06:47:40,747 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 06:47:40,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 06:47:40,748 INFO L158 Benchmark]: Toolchain (without parser) took 104107.38ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 95.5MB in the beginning and 71.9MB in the end (delta: 23.5MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2023-02-17 06:47:40,748 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:47:40,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.27ms. Allocated memory is still 125.8MB. Free memory was 95.0MB in the beginning and 84.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:47:40,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.94ms. Allocated memory is still 125.8MB. Free memory was 84.4MB in the beginning and 82.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:47:40,749 INFO L158 Benchmark]: Boogie Preprocessor took 12.56ms. Allocated memory is still 125.8MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 970.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:47:40,749 INFO L158 Benchmark]: RCFGBuilder took 194.55ms. Allocated memory is still 125.8MB. Free memory was 81.9MB in the beginning and 71.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:47:40,750 INFO L158 Benchmark]: TraceAbstraction took 103645.32ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 70.8MB in the beginning and 75.1MB in the end (delta: -4.3MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2023-02-17 06:47:40,750 INFO L158 Benchmark]: Witness Printer took 37.61ms. Allocated memory is still 151.0MB. Free memory was 75.1MB in the beginning and 71.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 06:47:40,755 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.15ms. Allocated memory is still 104.9MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.27ms. Allocated memory is still 125.8MB. Free memory was 95.0MB in the beginning and 84.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.94ms. Allocated memory is still 125.8MB. Free memory was 84.4MB in the beginning and 82.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.56ms. Allocated memory is still 125.8MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 970.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 194.55ms. Allocated memory is still 125.8MB. Free memory was 81.9MB in the beginning and 71.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 103645.32ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 70.8MB in the beginning and 75.1MB in the end (delta: -4.3MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 37.61ms. Allocated memory is still 151.0MB. Free memory was 75.1MB in the beginning and 71.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 103.6s, OverallIterations: 13, TraceHistogramMax: 29, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 92.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 67.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 815 SdHoareTripleChecker+Invalid, 67.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 484 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4362 IncrementalHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 484 mSolverCounterUnsat, 325 mSDtfsCounter, 4362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1508 GetRequests, 1272 SyntacticMatches, 43 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=12, InterpolantAutomatonStates: 132, 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, 13 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 92 PreInvPairs, 168 NumberOfFragments, 52803 HoareAnnotationTreeSize, 92 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 810 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1454 ConstructedInterpolants, 0 QuantifiedInterpolants, 21114 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1822 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 8938/9826 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: ((((((((((((((((((((((1 + -1 <= a && n + -1 <= a) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && (0 == (y + z + ((1 + n) * 6 + 6)) * (6 + ((1 + n) * 6 + 6)) + -(18 * (x + y + (y + z))) + -(12 * (y + z + ((1 + n) * 6 + 6))) + 2 * (6 + ((1 + n) * 6 + 6)) + -6 || !((1 + n) * 6 + 6 == 6 + z))) && y + (z + -6) * -1 + -19 == 6 + (6 + (7 + -1))) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && 7 * -1 + (y * -1 + x + 24 + -19 + -7) + 6 == 0 * 0 * 0) && (!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6)) && n + -1 + -1 + -1 == 1 + 0) && z == 6 + (y + x * -1 + (y * -1 + x + 24))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && (!(6 + z == 6 + 6 * (1 + n)) || 0 == (y + z) * (6 + z) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + z) + -6)) && z + -6 == 6 + (y + (z + -6) * -1 + -19)) && y + (y + x * -1 + (y * -1 + x + 24)) * -1 == 19 + (6 + (19 + -7))) && x == n * n * n) && n + -1 + -1 == 1 + 1) && 7 * -1 + (y * -1 + x + 24 + -19 + -7) + 6 >= 0) || (((((((((((((((((((((((z == 6 + 12 && z == 6 + (y + -7)) && x + (z + -6) * -1 + 5 + -1 == 0) && x + -1 == 1 + (12 + -6)) && 1 + -1 <= a) && 7 * -1 + (x + -7) + 6 == 0 * 0 * 0) && z == 6 + (6 + (7 + -1))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && 7 * -1 + (x + -7) + 6 >= 0) && y == z + -6 + -5 + (z + -6)) && n + -1 == 1 + 0) && n == 1 + 1) && (n <= a || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((0 == a * (6 + z) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + z) + -10 || !(z == 6 + 6 * n)) || n + 1 < a + 1) || !(n <= a))) && y == x + -1 + 12) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && z + -6 + -5 + -1 == 6) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && y == 7 + (6 + (7 + -1))) && y + -7 == 6 + 6) && x == n * n * n) && (!(z == 6 + 6 * n) || x + y == (1 + n) * (1 + n) * (1 + n)))) || ((((((0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10 || !(6 + z == 6 + 6 * (1 + n))) && 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && (!(6 + (6 + z) == 6 + 6 * (1 + (1 + n))) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && ((((((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && (((1 + n <= a || !(6 + 6 * (1 + n) == 6 + z)) || 0 == a * (6 + 6 * (1 + n)) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -10) || !(n <= a))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (((!(1 + n <= a) || 0 == a * (6 + 6 * (1 + (1 + n))) + -(6 * a) + -(2 * (y + z + (n * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + n))) + -10) || !(n * 6 + 12 == 6 + z)) || 1 + (1 + n) <= a)) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && (!(6 + z == 6 + 6 * (1 + n)) || 0 == (y + z) * (6 + z) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + z) + -6)) && (0 == (y + z + ((1 + n) * 6 + 6)) * (6 + ((1 + n) * 6 + 6)) + -(18 * (x + y + (y + z))) + -(12 * (y + z + ((1 + n) * 6 + 6))) + 2 * (6 + ((1 + n) * 6 + 6)) + -6 || !((1 + n) * 6 + 6 == 6 + z))) && x == n * n * n) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((0 == a * (6 + 6 * (1 + (1 + (1 + n)))) + -(6 * a) + -(2 * (y + z + ((1 + n) * 6 + 6) + ((1 + n) * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + (1 + n)))) + -10 || 1 + (1 + (1 + n)) <= a) || !(1 + (1 + n) <= a)) || !((1 + n) * 6 + 6 == 6 + z))) || ((((((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && (((1 + n <= a || !(6 + 6 * (1 + n) == 6 + z)) || 0 == a * (6 + 6 * (1 + n)) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -10) || !(n <= a))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (((!(1 + n <= a) || 0 == a * (6 + 6 * (1 + (1 + n))) + -(6 * a) + -(2 * (y + z + (n * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + n))) + -10) || !(n * 6 + 12 == 6 + z)) || 1 + (1 + n) <= a)) && ((((1 + (1 + (1 + (1 + n))) <= a || 0 == a * (6 + 6 * (1 + (1 + (1 + (1 + n))))) + -(6 * a) + -(2 * (y + z + (6 + z) + ((1 + (1 + n)) * 6 + 6) + ((1 + (1 + n)) * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + (1 + (1 + n))))) + -10) || !(1 + (1 + (1 + n)) <= a)) || !(n <= a)) || !((1 + (1 + n)) * 6 + 6 == 6 + (6 + z)))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && (!(6 + z == 6 + 6 * (1 + n)) || 0 == (y + z) * (6 + z) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + z) + -6)) && (0 == (y + z + ((1 + n) * 6 + 6)) * (6 + ((1 + n) * 6 + 6)) + -(18 * (x + y + (y + z))) + -(12 * (y + z + ((1 + n) * 6 + 6))) + 2 * (6 + ((1 + n) * 6 + 6)) + -6 || !((1 + n) * 6 + 6 == 6 + z))) && x == n * n * n) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((0 == a * (6 + 6 * (1 + (1 + (1 + n)))) + -(6 * a) + -(2 * (y + z + ((1 + n) * 6 + 6) + ((1 + n) * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + (1 + n)))) + -10 || 1 + (1 + (1 + n)) <= a) || !(1 + (1 + n) <= a)) || !((1 + n) * 6 + 6 == 6 + z))))) && (0 == 2 * (y + z + ((1 + n) * 6 + 6) + (6 + ((1 + n) * 6 + 6)) + (6 + (6 + ((1 + n) * 6 + 6)))) * (y + z + ((1 + n) * 6 + 6) + (6 + ((1 + n) * 6 + 6)) + (6 + (6 + ((1 + n) * 6 + 6)))) + -(3 * (x + y + (y + z) + (y + z + ((1 + n) * 6 + 6)) + (y + z + ((1 + n) * 6 + 6) + (6 + ((1 + n) * 6 + 6)))) * (6 + (6 + (6 + ((1 + n) * 6 + 6))))) + -(18 * (x + y + (y + z) + (y + z + ((1 + n) * 6 + 6)) + (y + z + ((1 + n) * 6 + 6) + (6 + ((1 + n) * 6 + 6))))) + -(10 * (y + z + ((1 + n) * 6 + 6) + (6 + ((1 + n) * 6 + 6)) + (6 + (6 + ((1 + n) * 6 + 6))))) + 3 * (6 + (6 + (6 + ((1 + n) * 6 + 6)))) + -10 || !((1 + n) * 6 + 6 == 6 + z))) && (!(6 + (6 + (6 + z)) == 6 + 6 * (1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10))) || (((((((((((((((((((((((x + -1 == 0 && n + -1 <= a) && y + -1 == 6) && z + -6 == 6 + 6 * 0) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && z + -6 == 6) && 1 * -1 + x == 0) && z == 6 + (y + -1)) && n + -1 == 0) && 0 <= a) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && z == 6 + 6) && y == 1 + (z + -6)) && ((n + 1 < a + 1 || 0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || !(n <= a))) && y + 6 * -1 == 1) && y * -1 + x + 6 == 0 * 0 * 0) && x + y == (1 + n) * (1 + n) * (1 + n)) && ((0 == a * (6 + z) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + z) + -10 || n + 1 < a + 1) || !(n <= a))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && y * -1 + x + 6 >= 0) && n <= 1 + 0) && n == 1 + 0) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && x == 1)) || (((((!(z == 6 + 6 * n) || 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && (0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10 || !(6 + z == 6 + 6 * (1 + n)))) && (!(6 + (6 + z) == 6 + 6 * (1 + (1 + n))) || 0 == 2 * (y + z + (6 + z)) * (y + z + (6 + z)) + -(3 * (x + y + (y + z)) * (6 + (6 + z))) + -(18 * (x + y + (y + z))) + -(10 * (y + z + (6 + z))) + 3 * (6 + (6 + z)) + -10)) && ((((((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && (((1 + n <= a || !(6 + 6 * (1 + n) == 6 + z)) || 0 == a * (6 + 6 * (1 + n)) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -10) || !(n <= a))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (((!(1 + n <= a) || 0 == a * (6 + 6 * (1 + (1 + n))) + -(6 * a) + -(2 * (y + z + (n * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + n))) + -10) || !(n * 6 + 12 == 6 + z)) || 1 + (1 + n) <= a)) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && (!(6 + z == 6 + 6 * (1 + n)) || 0 == (y + z) * (6 + z) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + z) + -6)) && (0 == (y + z + ((1 + n) * 6 + 6)) * (6 + ((1 + n) * 6 + 6)) + -(18 * (x + y + (y + z))) + -(12 * (y + z + ((1 + n) * 6 + 6))) + 2 * (6 + ((1 + n) * 6 + 6)) + -6 || !((1 + n) * 6 + 6 == 6 + z))) && x == n * n * n) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((0 == a * (6 + 6 * (1 + (1 + (1 + n)))) + -(6 * a) + -(2 * (y + z + ((1 + n) * 6 + 6) + ((1 + n) * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + (1 + n)))) + -10 || 1 + (1 + (1 + n)) <= a) || !(1 + (1 + n) <= a)) || !((1 + n) * 6 + 6 == 6 + z))) || ((((((((((((!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && (((1 + n <= a || !(6 + 6 * (1 + n) == 6 + z)) || 0 == a * (6 + 6 * (1 + n)) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -10) || !(n <= a))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (((!(1 + n <= a) || 0 == a * (6 + 6 * (1 + (1 + n))) + -(6 * a) + -(2 * (y + z + (n * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + n))) + -10) || !(n * 6 + 12 == 6 + z)) || 1 + (1 + n) <= a)) && ((((1 + (1 + (1 + (1 + n))) <= a || 0 == a * (6 + 6 * (1 + (1 + (1 + (1 + n))))) + -(6 * a) + -(2 * (y + z + (6 + z) + ((1 + (1 + n)) * 6 + 6) + ((1 + (1 + n)) * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + (1 + (1 + n))))) + -10) || !(1 + (1 + (1 + n)) <= a)) || !(n <= a)) || !((1 + (1 + n)) * 6 + 6 == 6 + (6 + z)))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && (!(6 + z == 6 + 6 * (1 + n)) || 0 == (y + z) * (6 + z) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + z) + -6)) && (0 == (y + z + ((1 + n) * 6 + 6)) * (6 + ((1 + n) * 6 + 6)) + -(18 * (x + y + (y + z))) + -(12 * (y + z + ((1 + n) * 6 + 6))) + 2 * (6 + ((1 + n) * 6 + 6)) + -6 || !((1 + n) * 6 + 6 == 6 + z))) && x == n * n * n) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && (((0 == a * (6 + 6 * (1 + (1 + (1 + n)))) + -(6 * a) + -(2 * (y + z + ((1 + n) * 6 + 6) + ((1 + n) * 6 + 12))) + 2 * (6 + 6 * (1 + (1 + (1 + n)))) + -10 || 1 + (1 + (1 + n)) <= a) || !(1 + (1 + n) <= a)) || !((1 + n) * 6 + 6 == 6 + z))))) && (!(6 + (6 + (6 + z)) == 6 + 6 * (1 + (1 + (1 + n)))) || 0 == 2 * (y + z + (6 + z) + (6 + (6 + z))) * (y + z + (6 + z) + (6 + (6 + z))) + -(3 * (x + y + (y + z) + (y + z + (6 + z))) * (6 + (6 + (6 + z)))) + -(18 * (x + y + (y + z) + (y + z + (6 + z)))) + -(10 * (y + z + (6 + z) + (6 + (6 + z)))) + 3 * (6 + (6 + (6 + z))) + -10))) || ((((((((x >= 0 && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && n == 0) && y == 1) && x == 0) && ((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6)) && ((((a + 65536 < 65536 && a * -1 + -65536 <= (-a + -1) / 65536 * 65536) && 0 <= a + 65536) && a * -1 + -32768 <= (-a + -1) / 65536 * 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && x == n * n * n) && z == 6)) || (((((((((((((((((((((z == 6 + (y + x * -1 + 8) && 7 * -1 + (x + -19 + -7) + 6 >= 0) && y + -19 == 6 + (6 + (7 + -1))) && 1 + -1 <= a) && y == 19 + (6 + (19 + -7))) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535) && a < 65536))) && n + -1 == 1 + 1) && (0 == (y + z + ((1 + n) * 6 + 6)) * (6 + ((1 + n) * 6 + 6)) + -(18 * (x + y + (y + z))) + -(12 * (y + z + ((1 + n) * 6 + 6))) + 2 * (6 + ((1 + n) * 6 + 6)) + -6 || !((1 + n) * 6 + 6 == 6 + z))) && z == 6 + (y + -19)) && (n <= a || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && y + (y + x * -1 + 8) * -1 == (y + (y + x * -1 + 8) * -1) * -1 + x + -1 + 12) && z == 6 + (6 + (19 + -7))) && y + x * -1 + 8 == 6 + 12) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && ((!(z == 6 + 6 * n) || n <= a) || 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10)) && (!(6 + z == 6 + 6 * (1 + n)) || 0 == (y + z) * (6 + z) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + z) + -6)) && x == n * n * n) && 7 * -1 + (x + -19 + -7) + 6 == 0 * 0 * 0) && n + -1 + -1 == 1 + 0) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 06:47:40,790 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