./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-18 16:15:38,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 16:15:38,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 16:15:38,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 16:15:38,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 16:15:38,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 16:15:38,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 16:15:38,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 16:15:38,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 16:15:38,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 16:15:38,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 16:15:38,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 16:15:38,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 16:15:38,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 16:15:38,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 16:15:38,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 16:15:38,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 16:15:38,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 16:15:38,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 16:15:38,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 16:15:38,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 16:15:38,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 16:15:38,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 16:15:38,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 16:15:38,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 16:15:38,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 16:15:38,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 16:15:38,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 16:15:38,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 16:15:38,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 16:15:38,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 16:15:38,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 16:15:38,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 16:15:38,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 16:15:38,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 16:15:38,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 16:15:38,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 16:15:38,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 16:15:38,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 16:15:38,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 16:15:38,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 16:15:38,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 16:15:38,154 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 16:15:38,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 16:15:38,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 16:15:38,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 16:15:38,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 16:15:38,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 16:15:38,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 16:15:38,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 16:15:38,156 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 16:15:38,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 16:15:38,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 16:15:38,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:15:38,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 16:15:38,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 16:15:38,159 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf57d72e341b105161cbeacf29e58db93d2b67f8e0e097e4dbed74551cbdcfff [2023-02-18 16:15:38,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 16:15:38,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 16:15:38,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 16:15:38,389 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 16:15:38,389 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 16:15:38,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/cohencu-ll.c [2023-02-18 16:15:39,237 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 16:15:39,409 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 16:15:39,410 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu-ll.c [2023-02-18 16:15:39,413 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f44c525/7f5acf2ace2548a89832dcdb154ad9d6/FLAG4fb3ef8f7 [2023-02-18 16:15:39,423 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f44c525/7f5acf2ace2548a89832dcdb154ad9d6 [2023-02-18 16:15:39,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 16:15:39,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 16:15:39,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 16:15:39,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 16:15:39,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 16:15:39,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2253bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39, skipping insertion in model container [2023-02-18 16:15:39,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 16:15:39,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 16:15:39,557 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu-ll.c[588,601] [2023-02-18 16:15:39,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:15:39,578 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 16:15:39,585 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu-ll.c[588,601] [2023-02-18 16:15:39,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:15:39,598 INFO L208 MainTranslator]: Completed translation [2023-02-18 16:15:39,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39 WrapperNode [2023-02-18 16:15:39,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 16:15:39,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 16:15:39,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 16:15:39,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 16:15:39,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,616 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-02-18 16:15:39,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 16:15:39,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 16:15:39,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 16:15:39,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 16:15:39,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,629 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 16:15:39,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 16:15:39,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 16:15:39,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 16:15:39,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (1/1) ... [2023-02-18 16:15:39,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:15:39,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:39,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 16:15:39,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 16:15:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 16:15:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 16:15:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 16:15:39,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 16:15:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 16:15:39,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 16:15:39,743 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 16:15:39,744 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 16:15:39,829 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 16:15:39,833 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 16:15:39,833 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 16:15:39,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:15:39 BoogieIcfgContainer [2023-02-18 16:15:39,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 16:15:39,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 16:15:39,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 16:15:39,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 16:15:39,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:15:39" (1/3) ... [2023-02-18 16:15:39,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310073de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:15:39, skipping insertion in model container [2023-02-18 16:15:39,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:15:39" (2/3) ... [2023-02-18 16:15:39,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310073de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:15:39, skipping insertion in model container [2023-02-18 16:15:39,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:15:39" (3/3) ... [2023-02-18 16:15:39,839 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2023-02-18 16:15:39,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 16:15:39,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 16:15:39,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 16:15:39,900 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;@382c9e4b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 16:15:39,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 16:15:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 16:15:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 16:15:39,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:39,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:39,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1823012769, now seen corresponding path program 1 times [2023-02-18 16:15:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188306028] [2023-02-18 16:15:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:39,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:15:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:40,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188306028] [2023-02-18 16:15:40,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188306028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:15:40,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:15:40,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 16:15:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930560669] [2023-02-18 16:15:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:15:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 16:15:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 16:15:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 16:15:40,031 INFO L87 Difference]: Start difference. First operand has 25 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:15:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:40,045 INFO L93 Difference]: Finished difference Result 48 states and 85 transitions. [2023-02-18 16:15:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 16:15:40,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-18 16:15:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:40,051 INFO L225 Difference]: With dead ends: 48 [2023-02-18 16:15:40,051 INFO L226 Difference]: Without dead ends: 21 [2023-02-18 16:15:40,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 16:15:40,055 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 16:15:40,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:15:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-18 16:15:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-18 16:15:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 16:15:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2023-02-18 16:15:40,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2023-02-18 16:15:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:40,078 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2023-02-18 16:15:40,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:15:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2023-02-18 16:15:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 16:15:40,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:40,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:40,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 16:15:40,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1811632607, now seen corresponding path program 1 times [2023-02-18 16:15:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:40,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031028094] [2023-02-18 16:15:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:15:40,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:40,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031028094] [2023-02-18 16:15:40,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031028094] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:15:40,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:15:40,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 16:15:40,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998714068] [2023-02-18 16:15:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:15:40,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 16:15:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 16:15:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 16:15:40,265 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:15:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:40,356 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2023-02-18 16:15:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 16:15:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-18 16:15:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:40,357 INFO L225 Difference]: With dead ends: 27 [2023-02-18 16:15:40,357 INFO L226 Difference]: Without dead ends: 25 [2023-02-18 16:15:40,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 16:15:40,358 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:15:40,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 16:15:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-18 16:15:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-18 16:15:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 16:15:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-02-18 16:15:40,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2023-02-18 16:15:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:40,369 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-02-18 16:15:40,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:15:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-02-18 16:15:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 16:15:40,370 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:40,370 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:40,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 16:15:40,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1582559355, now seen corresponding path program 1 times [2023-02-18 16:15:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:40,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80313173] [2023-02-18 16:15:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:40,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:40,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642123004] [2023-02-18 16:15:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:40,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:40,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:40,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 16:15:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:40,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 16:15:40,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:15:40,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:15:40,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:40,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80313173] [2023-02-18 16:15:40,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:40,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642123004] [2023-02-18 16:15:40,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642123004] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:40,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:40,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:15:40,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471946855] [2023-02-18 16:15:40,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:40,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:15:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:40,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:15:40,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:15:40,636 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 16:15:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:41,049 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2023-02-18 16:15:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:15:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 12 [2023-02-18 16:15:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:41,051 INFO L225 Difference]: With dead ends: 50 [2023-02-18 16:15:41,051 INFO L226 Difference]: Without dead ends: 48 [2023-02-18 16:15:41,052 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-18 16:15:41,052 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-18 16:15:41,053 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-18 16:15:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-18 16:15:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-02-18 16:15:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 16:15:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-02-18 16:15:41,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 12 [2023-02-18 16:15:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-02-18 16:15:41,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 16:15:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-02-18 16:15:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 16:15:41,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:41,081 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:41,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:41,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash 424345951, now seen corresponding path program 1 times [2023-02-18 16:15:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493897513] [2023-02-18 16:15:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:41,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:41,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168698477] [2023-02-18 16:15:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:41,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:41,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:41,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 16:15:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:41,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 16:15:41,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 16:15:41,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 16:15:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493897513] [2023-02-18 16:15:41,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:41,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168698477] [2023-02-18 16:15:41,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168698477] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:41,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:41,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:15:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113440150] [2023-02-18 16:15:41,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:41,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:15:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:15:41,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:15:41,455 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 16:15:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:41,655 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2023-02-18 16:15:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 16:15:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-02-18 16:15:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:41,657 INFO L225 Difference]: With dead ends: 52 [2023-02-18 16:15:41,657 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 16:15:41,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:15:41,658 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:15:41,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 16:15:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 16:15:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-02-18 16:15:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 16:15:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-02-18 16:15:41,671 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 17 [2023-02-18 16:15:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:41,671 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-02-18 16:15:41,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 16:15:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-02-18 16:15:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 16:15:41,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:41,672 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:41,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:41,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 16:15:41,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1752711045, now seen corresponding path program 1 times [2023-02-18 16:15:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:41,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346024278] [2023-02-18 16:15:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:41,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:41,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065414614] [2023-02-18 16:15:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:41,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:41,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 16:15:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:41,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 16:15:41,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 16:15:41,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 16:15:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:42,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346024278] [2023-02-18 16:15:42,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:42,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065414614] [2023-02-18 16:15:42,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065414614] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:42,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:42,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:15:42,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652206204] [2023-02-18 16:15:42,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:42,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:15:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:42,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:15:42,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:15:42,016 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 16:15:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:42,747 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-18 16:15:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 16:15:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2023-02-18 16:15:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:42,748 INFO L225 Difference]: With dead ends: 65 [2023-02-18 16:15:42,748 INFO L226 Difference]: Without dead ends: 56 [2023-02-18 16:15:42,748 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-18 16:15:42,749 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-18 16:15:42,749 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-18 16:15:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-18 16:15:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-18 16:15:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 16:15:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-02-18 16:15:42,760 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2023-02-18 16:15:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:42,761 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-02-18 16:15:42,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 16:15:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-02-18 16:15:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 16:15:42,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:42,762 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:42,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 16:15:42,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:42,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 190158181, now seen corresponding path program 1 times [2023-02-18 16:15:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:42,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558969080] [2023-02-18 16:15:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:42,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:42,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961053627] [2023-02-18 16:15:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:42,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:42,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 16:15:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:43,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 16:15:43,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 16:15:43,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 16:15:43,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:43,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558969080] [2023-02-18 16:15:43,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:43,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961053627] [2023-02-18 16:15:43,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961053627] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:43,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:43,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 16:15:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130970739] [2023-02-18 16:15:43,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:43,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 16:15:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 16:15:43,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:15:43,104 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 16:15:45,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:15:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:45,765 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2023-02-18 16:15:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:15:45,766 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 44 [2023-02-18 16:15:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:45,766 INFO L225 Difference]: With dead ends: 80 [2023-02-18 16:15:45,766 INFO L226 Difference]: Without dead ends: 78 [2023-02-18 16:15:45,767 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-18 16:15:45,767 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-18 16:15:45,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 52 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 277 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-02-18 16:15:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-18 16:15:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-02-18 16:15:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.075) internal successors, (43), 43 states have internal predecessors, (43), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 16:15:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-02-18 16:15:45,795 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 44 [2023-02-18 16:15:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:45,795 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-02-18 16:15:45,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 16:15:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-02-18 16:15:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 16:15:45,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:45,798 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:45,805 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-18 16:15:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:46,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:46,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1122712219, now seen corresponding path program 2 times [2023-02-18 16:15:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:46,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719705917] [2023-02-18 16:15:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:46,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:46,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131522415] [2023-02-18 16:15:46,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:15:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:46,020 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:46,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 16:15:46,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:15:46,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:15:46,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 16:15:46,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 16:15:46,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 16:15:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719705917] [2023-02-18 16:15:46,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131522415] [2023-02-18 16:15:46,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131522415] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:46,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:46,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:15:46,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088114780] [2023-02-18 16:15:46,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:15:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:15:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:15:46,144 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-18 16:15:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:46,553 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2023-02-18 16:15:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:15:46,553 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-18 16:15:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:46,554 INFO L225 Difference]: With dead ends: 84 [2023-02-18 16:15:46,554 INFO L226 Difference]: Without dead ends: 79 [2023-02-18 16:15:46,554 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-18 16:15:46,555 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-18 16:15:46,555 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-18 16:15:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-18 16:15:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-18 16:15:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 16:15:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2023-02-18 16:15:46,568 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 54 [2023-02-18 16:15:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:46,568 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2023-02-18 16:15:46,569 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-18 16:15:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2023-02-18 16:15:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 16:15:46,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:46,570 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:46,576 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-18 16:15:46,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:46,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1898506858, now seen corresponding path program 1 times [2023-02-18 16:15:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494066097] [2023-02-18 16:15:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:46,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:46,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749824674] [2023-02-18 16:15:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:46,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:46,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 16:15:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:46,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 16:15:46,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 16:15:47,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 16:15:47,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:47,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494066097] [2023-02-18 16:15:47,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:47,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749824674] [2023-02-18 16:15:47,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749824674] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:47,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:47,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 16:15:47,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941769708] [2023-02-18 16:15:47,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:47,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 16:15:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 16:15:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:15:47,174 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 16:15:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:47,476 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-02-18 16:15:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 16:15:47,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 65 [2023-02-18 16:15:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:47,477 INFO L225 Difference]: With dead ends: 85 [2023-02-18 16:15:47,477 INFO L226 Difference]: Without dead ends: 83 [2023-02-18 16:15:47,477 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-18 16:15:47,478 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-18 16:15:47,478 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-18 16:15:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-18 16:15:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-18 16:15:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.065217391304348) internal successors, (49), 49 states have internal predecessors, (49), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 16:15:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-02-18 16:15:47,497 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 65 [2023-02-18 16:15:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:47,497 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-02-18 16:15:47,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 16:15:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-02-18 16:15:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-18 16:15:47,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:47,498 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:47,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:47,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:47,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 161977518, now seen corresponding path program 1 times [2023-02-18 16:15:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116762687] [2023-02-18 16:15:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:47,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:47,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950358657] [2023-02-18 16:15:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:47,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:47,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:47,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:47,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 16:15:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:47,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 16:15:47,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-18 16:15:47,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 23 proven. 41 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-18 16:15:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116762687] [2023-02-18 16:15:48,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950358657] [2023-02-18 16:15:48,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950358657] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:48,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:48,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 16:15:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231209258] [2023-02-18 16:15:48,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:48,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 16:15:48,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 16:15:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-18 16:15:48,045 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 16:15:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:48,617 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2023-02-18 16:15:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 16:15:48,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 70 [2023-02-18 16:15:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:48,618 INFO L225 Difference]: With dead ends: 111 [2023-02-18 16:15:48,618 INFO L226 Difference]: Without dead ends: 102 [2023-02-18 16:15:48,619 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-18 16:15:48,619 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-18 16:15:48,619 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-18 16:15:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-18 16:15:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-02-18 16:15:48,654 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-18 16:15:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2023-02-18 16:15:48,655 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 70 [2023-02-18 16:15:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:48,655 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2023-02-18 16:15:48,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 16:15:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2023-02-18 16:15:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-18 16:15:48,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:48,660 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-18 16:15:48,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:48,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:48,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1175438523, now seen corresponding path program 3 times [2023-02-18 16:15:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021385152] [2023-02-18 16:15:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:48,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:48,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043444389] [2023-02-18 16:15:48,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 16:15:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:48,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:48,872 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:48,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 16:15:48,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 16:15:48,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:15:48,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 16:15:48,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 16:15:49,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 16:15:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021385152] [2023-02-18 16:15:49,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043444389] [2023-02-18 16:15:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043444389] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:49,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:49,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 16:15:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256499183] [2023-02-18 16:15:49,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:49,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 16:15:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 16:15:49,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 16:15:49,300 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-18 16:15:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:50,816 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2023-02-18 16:15:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:15:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 76 [2023-02-18 16:15:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:50,818 INFO L225 Difference]: With dead ends: 124 [2023-02-18 16:15:50,818 INFO L226 Difference]: Without dead ends: 118 [2023-02-18 16:15:50,819 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-18 16:15:50,819 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-18 16:15:50,819 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-18 16:15:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-18 16:15:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-18 16:15:50,845 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-18 16:15:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2023-02-18 16:15:50,845 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 76 [2023-02-18 16:15:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:50,846 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2023-02-18 16:15:50,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 16:15:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2023-02-18 16:15:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-02-18 16:15:50,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:50,847 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:50,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:51,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 16:15:51,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:51,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1712175254, now seen corresponding path program 1 times [2023-02-18 16:15:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:51,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209432895] [2023-02-18 16:15:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:51,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:51,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172693775] [2023-02-18 16:15:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:51,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:51,061 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 16:15:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:15:51,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-18 16:15:51,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:51,206 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-18 16:15:51,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:51,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209432895] [2023-02-18 16:15:51,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:51,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172693775] [2023-02-18 16:15:51,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172693775] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:15:51,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:15:51,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 16:15:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688168444] [2023-02-18 16:15:51,287 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:51,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 16:15:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:51,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 16:15:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:15:51,290 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-18 16:15:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:51,682 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-18 16:15:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 16:15:51,683 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-18 16:15:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:51,684 INFO L225 Difference]: With dead ends: 133 [2023-02-18 16:15:51,684 INFO L226 Difference]: Without dead ends: 119 [2023-02-18 16:15:51,684 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-18 16:15:51,684 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-18 16:15:51,685 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-18 16:15:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-18 16:15:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-18 16:15:51,707 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-18 16:15:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2023-02-18 16:15:51,708 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 129 [2023-02-18 16:15:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:51,709 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2023-02-18 16:15:51,710 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-18 16:15:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2023-02-18 16:15:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-02-18 16:15:51,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:51,711 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:15:51,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:51,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:51,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1019061416, now seen corresponding path program 2 times [2023-02-18 16:15:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:51,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457025981] [2023-02-18 16:15:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:51,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068969318] [2023-02-18 16:15:51,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:15:51,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:51,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:51,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:15:51,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 16:15:51,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:15:51,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:15:51,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-18 16:15:51,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 128 proven. 74 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-02-18 16:15:52,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 128 proven. 74 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-02-18 16:15:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:52,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457025981] [2023-02-18 16:15:52,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:52,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068969318] [2023-02-18 16:15:52,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068969318] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:52,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:52,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-18 16:15:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756072255] [2023-02-18 16:15:52,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:52,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 16:15:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 16:15:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-02-18 16:15:52,702 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-18 16:15:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:15:54,586 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2023-02-18 16:15:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 16:15:54,586 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 14 states have call successors, (56), 3 states have call predecessors, (56), 2 states have return successors, (54), 12 states have call predecessors, (54), 14 states have call successors, (54) Word has length 151 [2023-02-18 16:15:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:15:54,587 INFO L225 Difference]: With dead ends: 155 [2023-02-18 16:15:54,587 INFO L226 Difference]: Without dead ends: 151 [2023-02-18 16:15:54,588 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-18 16:15:54,588 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.6s IncrementalHoareTripleChecker+Time [2023-02-18 16:15:54,588 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.6s Time] [2023-02-18 16:15:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-18 16:15:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2023-02-18 16:15:54,621 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-18 16:15:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2023-02-18 16:15:54,622 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 151 [2023-02-18 16:15:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:15:54,623 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2023-02-18 16:15:54,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 14 states have call successors, (56), 3 states have call predecessors, (56), 2 states have return successors, (54), 12 states have call predecessors, (54), 14 states have call successors, (54) [2023-02-18 16:15:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2023-02-18 16:15:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-02-18 16:15:54,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:15:54,624 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-18 16:15:54,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 16:15:54,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 16:15:54,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:15:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:15:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1062647964, now seen corresponding path program 2 times [2023-02-18 16:15:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:15:54,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483610628] [2023-02-18 16:15:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:15:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:15:54,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:15:54,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102030063] [2023-02-18 16:15:54,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:15:54,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:15:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:15:54,849 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-18 16:15:54,852 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-18 16:15:54,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:15:54,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:15:54,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-18 16:15:54,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:15:55,027 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-18 16:15:55,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:15:59,550 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-18 16:15:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:15:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483610628] [2023-02-18 16:15:59,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:15:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102030063] [2023-02-18 16:15:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102030063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:15:59,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:15:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-18 16:15:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753071530] [2023-02-18 16:15:59,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:15:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 16:15:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:15:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 16:15:59,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2023-02-18 16:15:59,553 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-18 16:16:05,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:07,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:14,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:16,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:19,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:21,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:23,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:32,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:35,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:38,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:41,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:43,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:45,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:48,098 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-18 16:16:50,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:52,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:54,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:16:56,960 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-18 16:16:58,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:17:00,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:17:07,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:17:10,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:17:13,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:17:14,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:17:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:17:14,736 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2023-02-18 16:17:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 16:17:14,736 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-18 16:17:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:17:14,736 INFO L225 Difference]: With dead ends: 161 [2023-02-18 16:17:14,737 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 16:17:14,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 263 SyntacticMatches, 28 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=151, Invalid=545, Unknown=6, NotChecked=0, Total=702 [2023-02-18 16:17:14,738 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 106 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:17:14,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 855 Invalid, 23 Unknown, 0 Unchecked, 58.1s Time] [2023-02-18 16:17:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 16:17:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 16:17:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:17:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 16:17:14,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2023-02-18 16:17:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:17:14,739 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 16:17:14,739 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-18 16:17:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 16:17:14,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 16:17:14,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 16:17:14,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 16:17:14,941 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-18 16:17:14,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 16:17:14,988 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-18 16:17:14,990 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 16:17:14,991 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-18 16:17:14,991 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-02-18 16:17:14,991 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-18 16:17:14,992 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse75 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse33 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse32 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse74 (* .cse75 6))) (let ((.cse85 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse71 (+ 1 .cse75)) (.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)) (.cse88 (+ |ULTIMATE.start_main_~a~0#1| 65536)) (.cse89 (+ .cse74 6)) (.cse42 (+ .cse33 .cse32)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse31 (* 2 .cse32)) (.cse34 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse72 (+ 6 (* 6 .cse75)))) (let ((.cse76 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse36 (not (= .cse34 .cse72))) (.cse35 (- (* 18 .cse33))) (.cse38 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse82 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse73 (- .cse31)) (.cse81 (* 2 .cse34)) (.cse84 (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse25)) (.cse69 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse43 (- (* 18 .cse42))) (.cse47 (+ .cse32 .cse89)) (.cse50 (+ 6 .cse89)) (.cse51 (not (= .cse89 .cse34))) (.cse26 (< .cse88 65536)) (.cse29 (<= 0 .cse88)) (.cse30 (let ((.cse87 (+ .cse28 65536))) (and (<= .cse87 (+ .cse27 32767)) .cse24 (<= .cse87 (+ .cse27 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) (.cse70 (+ 1 .cse71)) (.cse61 (- .cse85)) (.cse37 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse83 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse40 (+ 6 (* 6 .cse71))) (.cse41 (+ .cse32 .cse34)) (.cse39 (+ 6 .cse34)) (.cse5 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse61) (- .cse37)) .cse83) (- 10)))) (.cse53 (+ 6 (* 6 .cse70))) (.cse23 (or (and .cse26 (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) .cse29) .cse30)) (.cse57 (or (= 0 (+ (+ (+ (+ (* .cse47 .cse50) .cse43) (- (* 12 .cse47))) (* 2 .cse50)) (- 6))) .cse51)) (.cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse86 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse86 |ULTIMATE.start_main_~n~0#1|) .cse86))))) (.cse8 (= 0 (+ (+ (* .cse85 |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 .cse84 (= 0 (+ (+ (* .cse85 .cse33) (- (* .cse33 .cse34))) (* 12 .cse33))) .cse69)) (.cse10 (= .cse33 (* (* .cse75 .cse75) .cse75))) (.cse11 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse34) .cse61) .cse73) .cse81) (- 10))) .cse84 .cse69)) (.cse12 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse82) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse38) .cse82) .cse83) (- 6)))) (.cse59 (or .cse36 (= 0 (+ (+ (+ (+ (* .cse32 .cse34) .cse35) (- (* 12 .cse32))) .cse81) (- 6))))) (.cse1 (let ((.cse80 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse79 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse78 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse79 (- 6)) 0))) (and (or (not .cse78) (<= 0 .cse4) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse79 (- 5)) 0))) (not .cse80) .cse0 (or .cse78 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse80))) (.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 (+ .cse76 (- 1))) (.cse7 (+ 1 1)) (.cse2 (* .cse4 (- 1)))) (let ((.cse16 (+ 1 0)) (.cse18 (or (let ((.cse60 (<= .cse75 |ULTIMATE.start_main_~a~0#1|)) (.cse68 (<= .cse70 |ULTIMATE.start_main_~a~0#1|)) (.cse63 (<= .cse71 |ULTIMATE.start_main_~a~0#1|))) (and (let ((.cse62 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse60) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse40) .cse61) (- (* 2 (+ .cse32 .cse62)))) (* 2 .cse40)) (- 10))) (not (= .cse62 .cse34)) .cse63)) (let ((.cse67 (* .cse71 6))) (let ((.cse64 (+ 1 .cse70)) (.cse66 (+ .cse67 6))) (or (<= .cse64 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse65 (+ 6 (* 6 .cse64)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse65) .cse61) (- (* 2 (+ (+ .cse41 .cse66) (+ .cse67 12))))) (* 2 .cse65))) (- 10))) (not .cse68) .cse69 (not (= .cse66 .cse39))))) .cse57 .cse5 .cse6 .cse8 .cse9 .cse10 (or .cse60 (not (= .cse72 .cse34)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse72) .cse61) .cse73) (* 2 .cse72)) (- 10))) .cse69) .cse11 .cse12 .cse13 .cse59 .cse1 .cse14 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse53) .cse61) (- (* 2 (+ .cse47 (+ .cse74 12))))) (* 2 .cse53)) (- 10))) .cse68 (not .cse63) .cse51))) (let ((.cse77 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse2) (- 19)))) (and (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|) (<= .cse76 |ULTIMATE.start_main_~a~0#1|) .cse23 .cse57 .cse6 (= .cse77 (+ 6 (+ 6 (+ 7 (- 1))))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse59 .cse1 (= .cse4 (+ 6 .cse77)) .cse14 .cse69 (= .cse15 .cse7))))) (.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 (or (= 0 (+ (+ (+ (+ (+ (* .cse31 .cse32) (- (* (* 3 .cse33) .cse34))) .cse35) (- (* 10 .cse32))) (* 3 .cse34)) (- 10))) .cse36) (= 0 (+ (+ (+ (+ (+ (* .cse37 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse38) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse18 (or (not (= .cse39 .cse40)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse41) .cse41) (- (* (* 3 .cse42) .cse39))) .cse43) (- (* 10 .cse41))) (* 3 .cse39)) (- 10)))) (or (= 0 (+ (let ((.cse49 (+ 6 .cse50))) (let ((.cse46 (+ 6 .cse49))) (+ (let ((.cse48 (+ .cse47 .cse50))) (let ((.cse44 (+ .cse48 .cse49))) (+ (let ((.cse45 (+ (+ .cse42 .cse47) .cse48))) (+ (+ (* (* 2 .cse44) .cse44) (- (* (* 3 .cse45) .cse46))) (- (* 18 .cse45)))) (- (* 10 .cse44))))) (* 3 .cse46)))) (- 10))) .cse51) (let ((.cse52 (+ 6 .cse39))) (or (not (= .cse52 .cse53)) (= 0 (+ (+ (let ((.cse54 (+ .cse41 .cse39))) (+ (let ((.cse55 (+ .cse42 .cse41))) (+ (+ (* (* 2 .cse54) .cse54) (- (* (* 3 .cse55) .cse52))) (- (* 18 .cse55)))) (- (* 10 .cse54)))) (* 3 .cse52)) (- 10)))))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse21 8))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse56)) .cse5 .cse57 .cse6 .cse8 (let ((.cse58 (+ |ULTIMATE.start_main_~y~0#1| (* .cse56 (- 1))))) (= .cse58 (+ (+ (+ (* .cse58 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse9 .cse10 .cse11 (= .cse56 (+ 6 12)) .cse12 .cse13 .cse59 .cse1 .cse14))))))))) [2023-02-18 16:17:14,992 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 16:17:14,992 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 55) the Hoare annotation is: true [2023-02-18 16:17:14,993 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-18 16:17:14,993 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-18 16:17:14,994 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 16:17:14,994 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-18 16:17:14,995 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-18 16:17:14,996 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 16:17:14,996 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-18 16:17:14,997 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse66 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse3 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse65 (* .cse66 6))) (let ((.cse62 (+ 1 .cse66)) (.cse79 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse81 (+ .cse65 6)) (.cse12 (+ .cse3 .cse2)) (.cse1 (* 2 .cse2)) (.cse4 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse63 (+ 6 (* 6 .cse66)))) (let ((.cse67 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse30 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse26 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse6 (not (= .cse4 .cse63))) (.cse5 (- (* 18 .cse3))) (.cse8 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse76 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse64 (- .cse1)) (.cse75 (* 2 .cse4)) (.cse78 (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1))) (.cse60 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse13 (- (* 18 .cse12))) (.cse17 (+ .cse2 .cse81)) (.cse20 (+ 6 .cse81)) (.cse21 (not (= .cse81 .cse4))) (.cse52 (- .cse79)) (.cse7 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse77 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse61 (+ 1 .cse62))) (let ((.cse10 (+ 6 (* 6 .cse62))) (.cse11 (+ .cse2 .cse4)) (.cse9 (+ 6 .cse4)) (.cse23 (+ 6 (* 6 .cse61))) (.cse31 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse52) (- .cse7)) .cse77) (- 10)))) (.cse48 (or (= 0 (+ (+ (+ (+ (* .cse17 .cse20) .cse13) (- (* 12 .cse17))) (* 2 .cse20)) (- 6))) .cse21)) (.cse32 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse80 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse80 |ULTIMATE.start_main_~n~0#1|) .cse80))))) (.cse34 (= 0 (+ (+ (* .cse79 |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|)))) (.cse35 (or .cse78 (= 0 (+ (+ (* .cse79 .cse3) (- (* .cse3 .cse4))) (* 12 .cse3))) .cse60)) (.cse36 (= .cse3 (* (* .cse66 .cse66) .cse66))) (.cse37 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse4) .cse52) .cse64) .cse75) (- 10))) .cse78 .cse60)) (.cse38 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse76) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse39 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse8) .cse76) .cse77) (- 6)))) (.cse50 (or .cse6 (= 0 (+ (+ (+ (+ (* .cse2 .cse4) .cse5) (- (* 12 .cse2))) .cse75) (- 6))))) (.cse27 (let ((.cse74 (= |ULTIMATE.start_main_~z~0#1| (+ (* 6 |ULTIMATE.start_main_~n~0#1|) 6)))) (or (let ((.cse73 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse72 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse73 (- 6)) 0))) (and (or (not .cse72) (<= 0 .cse30) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse73 (- 5)) 0))) (not .cse74) .cse26 (or .cse72 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse74))) (.cse40 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse41 (+ .cse67 (- 1))) (.cse33 (+ 1 1)) (.cse28 (* .cse30 (- 1)))) (let ((.cse0 (or (let ((.cse51 (<= .cse66 |ULTIMATE.start_main_~a~0#1|)) (.cse59 (<= .cse61 |ULTIMATE.start_main_~a~0#1|)) (.cse54 (<= .cse62 |ULTIMATE.start_main_~a~0#1|))) (and (let ((.cse53 (+ (* |ULTIMATE.start_main_~n~0#1| 6) 12))) (or (not .cse51) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse10) .cse52) (- (* 2 (+ .cse2 .cse53)))) (* 2 .cse10)) (- 10))) (not (= .cse53 .cse4)) .cse54)) (let ((.cse58 (* .cse62 6))) (let ((.cse55 (+ 1 .cse61)) (.cse57 (+ .cse58 6))) (or (<= .cse55 |ULTIMATE.start_main_~a~0#1|) (= 0 (+ (let ((.cse56 (+ 6 (* 6 .cse55)))) (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse56) .cse52) (- (* 2 (+ (+ .cse11 .cse57) (+ .cse58 12))))) (* 2 .cse56))) (- 10))) (not .cse59) .cse60 (not (= .cse57 .cse9))))) .cse31 .cse48 .cse32 .cse34 .cse35 .cse36 (or .cse51 (not (= .cse63 .cse4)) (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse63) .cse52) .cse64) (* 2 .cse63)) (- 10))) .cse60) .cse37 .cse38 .cse39 .cse50 .cse27 .cse40 (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse23) .cse52) (- (* 2 (+ .cse17 (+ .cse65 12))))) (* 2 .cse23)) (- 10))) .cse59 (not .cse54) .cse21))) (let ((.cse71 (+ (+ |ULTIMATE.start_main_~y~0#1| .cse28) (- 19)))) (and (<= (+ 1 (- 1)) |ULTIMATE.start_main_~a~0#1|) (<= .cse67 |ULTIMATE.start_main_~a~0#1|) (or (let ((.cse68 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse68 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse68))) (let ((.cse69 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse70 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse69 (+ .cse70 32767)) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= .cse69 (+ .cse70 65535)) (< |ULTIMATE.start_main_~a~0#1| 65536)))) .cse31 .cse48 .cse32 (= .cse71 (+ 6 (+ 6 (+ 7 (- 1))))) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse50 .cse27 (= .cse30 (+ 6 .cse71)) .cse40 .cse60 (= .cse41 .cse33))))) (.cse46 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse42 (+ 1 0))) (or (and .cse0 (or (= 0 (+ (+ (+ (+ (+ (* .cse1 .cse2) (- (* (* 3 .cse3) .cse4))) .cse5) (- (* 10 .cse2))) (* 3 .cse4)) (- 10))) .cse6) (= 0 (+ (+ (+ (+ (+ (* .cse7 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse8) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) (or (not (= .cse9 .cse10)) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse11) .cse11) (- (* (* 3 .cse12) .cse9))) .cse13) (- (* 10 .cse11))) (* 3 .cse9)) (- 10)))) (or (= 0 (+ (let ((.cse19 (+ 6 .cse20))) (let ((.cse16 (+ 6 .cse19))) (+ (let ((.cse18 (+ .cse17 .cse20))) (let ((.cse14 (+ .cse18 .cse19))) (+ (let ((.cse15 (+ (+ .cse12 .cse17) .cse18))) (+ (+ (* (* 2 .cse14) .cse14) (- (* (* 3 .cse15) .cse16))) (- (* 18 .cse15)))) (- (* 10 .cse14))))) (* 3 .cse16)))) (- 10))) .cse21) (let ((.cse22 (+ 6 .cse9))) (or (not (= .cse22 .cse23)) (= 0 (+ (+ (let ((.cse24 (+ .cse11 .cse9))) (+ (let ((.cse25 (+ .cse12 .cse11))) (+ (+ (* (* 2 .cse24) .cse24) (- (* (* 3 .cse25) .cse22))) (- (* 18 .cse25)))) (- (* 10 .cse24)))) (* 3 .cse22)) (- 10)))))) (and .cse26 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) .cse27 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse29 (+ .cse30 (- 5)))) (and (= (+ (+ |ULTIMATE.start_main_~x~0#1| .cse28 5) (- 1)) 0) (= |ULTIMATE.start_main_~y~0#1| (+ .cse29 .cse30)) .cse31 .cse32 (= |ULTIMATE.start_main_~n~0#1| .cse33) .cse34 .cse35 .cse36 .cse37 .cse38 (= (+ .cse29 (- 1)) 6) .cse39 .cse27 .cse40)) (let ((.cse45 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| 24))) (let ((.cse43 (+ |ULTIMATE.start_main_~y~0#1| .cse46 .cse45)) (.cse44 (+ (* 7 (- 1)) (+ (+ .cse45 (- 19)) (- 7)) 6))) (and (= (+ .cse41 (- 1)) .cse42) .cse0 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse43)) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse43 (- 1))) (+ 19 (+ 6 (+ 19 (- 7))))) (= .cse44 (* (* 0 0) 0)) (>= .cse44 0)))) (let ((.cse47 (+ |ULTIMATE.start_main_~y~0#1| .cse46 8))) (and (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse47)) .cse31 .cse48 .cse32 .cse34 (let ((.cse49 (+ |ULTIMATE.start_main_~y~0#1| (* .cse47 (- 1))))) (= .cse49 (+ (+ (+ (* .cse49 (- 1)) |ULTIMATE.start_main_~x~0#1|) (- 1)) 12))) .cse35 .cse36 .cse37 (= .cse47 (+ 6 12)) .cse38 .cse39 .cse50 .cse27 .cse40)) (and .cse36 .cse39 (= .cse30 6) .cse27 .cse32 (= |ULTIMATE.start_main_~n~0#1| .cse42) .cse40 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse30)))))))))) [2023-02-18 16:17:14,998 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-18 16:17:14,998 INFO L899 garLoopResultBuilder]: For program point L37(lines 32 45) no Hoare annotation was computed. [2023-02-18 16:17:14,999 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-18 16:17:14,999 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 16:17:14,999 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 16:17:14,999 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 16:17:14,999 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 16:17:14,999 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-18 16:17:14,999 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 16:17:15,001 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 16:17:15,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 16:17:15,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:17:15 BoogieIcfgContainer [2023-02-18 16:17:15,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 16:17:15,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 16:17:15,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 16:17:15,073 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 16:17:15,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:15:39" (3/4) ... [2023-02-18 16:17:15,075 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 16:17:15,079 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 16:17:15,081 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-18 16:17:15,081 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 16:17:15,082 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 16:17:15,082 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 16:17:15,104 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 16:17:15,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 16:17:15,105 INFO L158 Benchmark]: Toolchain (without parser) took 95679.39ms. Allocated memory was 136.3MB in the beginning and 169.9MB in the end (delta: 33.6MB). Free memory was 102.5MB in the beginning and 53.8MB in the end (delta: 48.8MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2023-02-18 16:17:15,105 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 136.3MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:17:15,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.46ms. Allocated memory is still 136.3MB. Free memory was 102.2MB in the beginning and 91.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:17:15,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.70ms. Allocated memory is still 136.3MB. Free memory was 91.5MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 16:17:15,106 INFO L158 Benchmark]: Boogie Preprocessor took 13.56ms. Allocated memory is still 136.3MB. Free memory was 90.1MB in the beginning and 89.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:17:15,106 INFO L158 Benchmark]: RCFGBuilder took 203.03ms. Allocated memory is still 136.3MB. Free memory was 88.7MB in the beginning and 78.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:17:15,106 INFO L158 Benchmark]: TraceAbstraction took 95236.61ms. Allocated memory was 136.3MB in the beginning and 169.9MB in the end (delta: 33.6MB). Free memory was 77.8MB in the beginning and 56.9MB in the end (delta: 20.9MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2023-02-18 16:17:15,106 INFO L158 Benchmark]: Witness Printer took 32.11ms. Allocated memory is still 169.9MB. Free memory was 56.9MB in the beginning and 53.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 16:17:15,107 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.46ms. Allocated memory is still 136.3MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.46ms. Allocated memory is still 136.3MB. Free memory was 102.2MB in the beginning and 91.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.70ms. Allocated memory is still 136.3MB. Free memory was 91.5MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.56ms. Allocated memory is still 136.3MB. Free memory was 90.1MB in the beginning and 89.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 203.03ms. Allocated memory is still 136.3MB. Free memory was 88.7MB in the beginning and 78.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 95236.61ms. Allocated memory was 136.3MB in the beginning and 169.9MB in the end (delta: 33.6MB). Free memory was 77.8MB in the beginning and 56.9MB in the end (delta: 20.9MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 32.11ms. Allocated memory is still 169.9MB. Free memory was 56.9MB in the beginning and 53.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.1s, OverallIterations: 13, TraceHistogramMax: 29, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 84.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 66.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 815 SdHoareTripleChecker+Invalid, 65.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4352 IncrementalHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 478 mSolverCounterUnsat, 325 mSDtfsCounter, 4352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1507 GetRequests, 1272 SyntacticMatches, 43 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=12, InterpolantAutomatonStates: 131, 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, 90 PreInvPairs, 164 NumberOfFragments, 49392 HoareAnnotationTreeSize, 90 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s 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-18 16:17:15,134 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