./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound20.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-scaling/cohencu-ll_valuebound20.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 d3c61dee0c4c48de96844df391dc470a843cae078bb175116ed4a6b789669168 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 16:37:04,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 16:37:04,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 16:37:04,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 16:37:04,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 16:37:04,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 16:37:04,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 16:37:04,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 16:37:04,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 16:37:04,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 16:37:04,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 16:37:04,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 16:37:04,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 16:37:04,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 16:37:04,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 16:37:04,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 16:37:04,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 16:37:04,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 16:37:04,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 16:37:04,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 16:37:04,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 16:37:04,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 16:37:04,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 16:37:04,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 16:37:04,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 16:37:04,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 16:37:04,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 16:37:04,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 16:37:04,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 16:37:04,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 16:37:04,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 16:37:04,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 16:37:04,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 16:37:04,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 16:37:04,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 16:37:04,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 16:37:04,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 16:37:04,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 16:37:04,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 16:37:04,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 16:37:04,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 16:37:04,186 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:37:04,210 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 16:37:04,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 16:37:04,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 16:37:04,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 16:37:04,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 16:37:04,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 16:37:04,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 16:37:04,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 16:37:04,212 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 16:37:04,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 16:37:04,212 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 16:37:04,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 16:37:04,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 16:37:04,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:37:04,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 16:37:04,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 16:37:04,215 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 16:37:04,215 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 -> d3c61dee0c4c48de96844df391dc470a843cae078bb175116ed4a6b789669168 [2023-02-18 16:37:04,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 16:37:04,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 16:37:04,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 16:37:04,471 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 16:37:04,472 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 16:37:04,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound20.c [2023-02-18 16:37:05,616 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 16:37:05,809 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 16:37:05,809 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound20.c [2023-02-18 16:37:05,815 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46eb0c55d/67a71ee3bb8f4075b5d8b6776453501d/FLAGd4a0dc110 [2023-02-18 16:37:05,829 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46eb0c55d/67a71ee3bb8f4075b5d8b6776453501d [2023-02-18 16:37:05,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 16:37:05,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 16:37:05,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 16:37:05,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 16:37:05,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 16:37:05,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:37:05" (1/1) ... [2023-02-18 16:37:05,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac1fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:05, skipping insertion in model container [2023-02-18 16:37:05,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:37:05" (1/1) ... [2023-02-18 16:37:05,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 16:37:05,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 16:37:06,025 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-scaling/cohencu-ll_valuebound20.c[588,601] [2023-02-18 16:37:06,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:37:06,072 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 16:37:06,083 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-scaling/cohencu-ll_valuebound20.c[588,601] [2023-02-18 16:37:06,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:37:06,100 INFO L208 MainTranslator]: Completed translation [2023-02-18 16:37:06,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06 WrapperNode [2023-02-18 16:37:06,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 16:37:06,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 16:37:06,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 16:37:06,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 16:37:06,105 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:37:06" (1/1) ... [2023-02-18 16:37:06,110 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:37:06" (1/1) ... [2023-02-18 16:37:06,124 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-18 16:37:06,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 16:37:06,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 16:37:06,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 16:37:06,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 16:37:06,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,140 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 16:37:06,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 16:37:06,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 16:37:06,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 16:37:06,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (1/1) ... [2023-02-18 16:37:06,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:37:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:06,172 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:37:06,185 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:37:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 16:37:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 16:37:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 16:37:06,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 16:37:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 16:37:06,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 16:37:06,253 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 16:37:06,257 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 16:37:06,367 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 16:37:06,372 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 16:37:06,372 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 16:37:06,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:37:06 BoogieIcfgContainer [2023-02-18 16:37:06,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 16:37:06,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 16:37:06,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 16:37:06,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 16:37:06,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:37:05" (1/3) ... [2023-02-18 16:37:06,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ecec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:37:06, skipping insertion in model container [2023-02-18 16:37:06,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:37:06" (2/3) ... [2023-02-18 16:37:06,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ecec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:37:06, skipping insertion in model container [2023-02-18 16:37:06,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:37:06" (3/3) ... [2023-02-18 16:37:06,382 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound20.c [2023-02-18 16:37:06,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 16:37:06,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 16:37:06,437 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 16:37:06,443 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;@3016d714, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 16:37:06,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 16:37:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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:37:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 16:37:06,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:06,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:06,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-18 16:37:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:06,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919548123] [2023-02-18 16:37:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:06,620 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:37:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:06,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919548123] [2023-02-18 16:37:06,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919548123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:37:06,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:37:06,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 16:37:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138338453] [2023-02-18 16:37:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:37:06,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 16:37:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 16:37:06,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 16:37:06,663 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:37:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:06,695 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-18 16:37:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 16:37:06,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2023-02-18 16:37:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:06,704 INFO L225 Difference]: With dead ends: 51 [2023-02-18 16:37:06,704 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 16:37:06,708 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:37:06,712 INFO L413 NwaCegarLoop]: 37 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, 37 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:37:06,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:37:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 16:37:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 16:37:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 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:37:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-18 16:37:06,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-18 16:37:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:06,752 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-18 16:37:06,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:37:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-18 16:37:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 16:37:06,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:06,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 16:37:06,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-18 16:37:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:06,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980012773] [2023-02-18 16:37:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:07,038 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:37:07,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:07,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980012773] [2023-02-18 16:37:07,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980012773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:37:07,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:37:07,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 16:37:07,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894745579] [2023-02-18 16:37:07,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:37:07,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 16:37:07,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 16:37:07,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 16:37:07,059 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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:37:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:07,179 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-18 16:37:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 16:37:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-02-18 16:37:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:07,181 INFO L225 Difference]: With dead ends: 29 [2023-02-18 16:37:07,181 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 16:37:07,182 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:37:07,183 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:07,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 16:37:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 16:37:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 16:37:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:37:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-18 16:37:07,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-18 16:37:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:07,199 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-18 16:37:07,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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:37:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-18 16:37:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 16:37:07,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:07,203 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:07,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 16:37:07,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-18 16:37:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:07,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969520903] [2023-02-18 16:37:07,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:07,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:07,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536615446] [2023-02-18 16:37:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:07,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:07,224 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:37:07,233 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:37:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:07,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 16:37:07,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:07,376 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:37:07,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:07,500 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:37:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:07,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969520903] [2023-02-18 16:37:07,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:07,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536615446] [2023-02-18 16:37:07,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536615446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:07,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:07,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:37:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442625707] [2023-02-18 16:37:07,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:07,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:37:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:07,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:37:07,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:37:07,509 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:37:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:07,943 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-18 16:37:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:37:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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 14 [2023-02-18 16:37:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:07,945 INFO L225 Difference]: With dead ends: 52 [2023-02-18 16:37:07,945 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 16:37:07,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 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:37:07,947 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:07,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 16:37:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 16:37:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-18 16:37:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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:37:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-18 16:37:07,983 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-18 16:37:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:07,983 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-18 16:37:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:37:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-18 16:37:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 16:37:07,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:07,985 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:07,995 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:37:08,190 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:37:08,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-18 16:37:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:08,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064209097] [2023-02-18 16:37:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:08,200 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:08,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003995137] [2023-02-18 16:37:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:08,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:08,204 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:37:08,213 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:37:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:08,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 16:37:08,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:08,309 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:37:08,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:08,393 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:37:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:08,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064209097] [2023-02-18 16:37:08,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:08,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003995137] [2023-02-18 16:37:08,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003995137] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:08,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:08,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:37:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260996056] [2023-02-18 16:37:08,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:08,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:37:08,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:08,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:37:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:37:08,398 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:37:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:08,619 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-18 16:37:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 16:37:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 19 [2023-02-18 16:37:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:08,621 INFO L225 Difference]: With dead ends: 54 [2023-02-18 16:37:08,621 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 16:37:08,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 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:37:08,622 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:08,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 16:37:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 16:37:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-18 16:37:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 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:37:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-18 16:37:08,637 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-18 16:37:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:08,637 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-18 16:37:08,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:37:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-18 16:37:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 16:37:08,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:08,638 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:08,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 16:37:08,844 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:37:08,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-18 16:37:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:08,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061925719] [2023-02-18 16:37:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:08,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:08,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609314032] [2023-02-18 16:37:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:08,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:08,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:08,865 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:37:08,868 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:37:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:08,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 16:37:08,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:08,945 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:37:08,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:09,017 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:37:09,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061925719] [2023-02-18 16:37:09,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609314032] [2023-02-18 16:37:09,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609314032] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:09,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:09,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 16:37:09,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102981978] [2023-02-18 16:37:09,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:09,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 16:37:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 16:37:09,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 16:37:09,021 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:37:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:10,298 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-18 16:37:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 16:37:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 24 [2023-02-18 16:37:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:10,299 INFO L225 Difference]: With dead ends: 67 [2023-02-18 16:37:10,300 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 16:37:10,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 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:37:10,301 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:10,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-18 16:37:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 16:37:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-18 16:37:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 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:37:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-18 16:37:10,318 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-18 16:37:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:10,318 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-18 16:37:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:37:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-18 16:37:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 16:37:10,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:10,320 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:10,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 16:37:10,529 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:37:10,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-18 16:37:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:10,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183871720] [2023-02-18 16:37:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:10,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:10,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078705597] [2023-02-18 16:37:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:10,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:10,544 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:37:10,547 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:37:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:10,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 16:37:10,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:10,649 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:37:10,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:10,747 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:37:10,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183871720] [2023-02-18 16:37:10,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078705597] [2023-02-18 16:37:10,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078705597] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:10,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:10,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 16:37:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586216116] [2023-02-18 16:37:10,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:10,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 16:37:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 16:37:10,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:10,750 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 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:37:14,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:14,284 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-18 16:37:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:37:14,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 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 46 [2023-02-18 16:37:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:14,289 INFO L225 Difference]: With dead ends: 82 [2023-02-18 16:37:14,289 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 16:37:14,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 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:37:14,290 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:14,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2023-02-18 16:37:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 16:37:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-18 16:37:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 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:37:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-18 16:37:14,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-18 16:37:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:14,318 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-18 16:37:14,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 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:37:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-18 16:37:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 16:37:14,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:14,320 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:14,326 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:37:14,526 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:37:14,526 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-18 16:37:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:14,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336008734] [2023-02-18 16:37:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:14,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:14,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873198357] [2023-02-18 16:37:14,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:37:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:14,537 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:37:14,543 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:37:14,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:37:14,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:14,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 16:37:14,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:14,631 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:37:14,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:14,697 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:37:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336008734] [2023-02-18 16:37:14,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873198357] [2023-02-18 16:37:14,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873198357] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:14,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2023-02-18 16:37:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75414112] [2023-02-18 16:37:14,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:14,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 16:37:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 16:37:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-18 16:37:14,701 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 16:37:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:15,541 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-18 16:37:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:37:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 56 [2023-02-18 16:37:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:15,542 INFO L225 Difference]: With dead ends: 86 [2023-02-18 16:37:15,543 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 16:37:15,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-18 16:37:15,544 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:15,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 74 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 16:37:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 16:37:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 16:37:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 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:37:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-18 16:37:15,562 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-18 16:37:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:15,562 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-18 16:37:15,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 16:37:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-18 16:37:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 16:37:15,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:15,564 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, 1, 1] [2023-02-18 16:37:15,575 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:37:15,775 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:37:15,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-18 16:37:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:15,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647968098] [2023-02-18 16:37:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:15,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498067565] [2023-02-18 16:37:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:15,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:15,791 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:37:15,794 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:37:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:15,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 16:37:15,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 16:37:15,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 16:37:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:16,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647968098] [2023-02-18 16:37:16,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:16,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498067565] [2023-02-18 16:37:16,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498067565] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:16,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:16,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 16:37:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778363798] [2023-02-18 16:37:16,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:16,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 16:37:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 16:37:16,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:16,051 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 16:37:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:16,430 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-18 16:37:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 16:37:16,431 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2023-02-18 16:37:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:16,432 INFO L225 Difference]: With dead ends: 95 [2023-02-18 16:37:16,432 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 16:37:16,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-18 16:37:16,433 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:16,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 157 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 16:37:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 16:37:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-18 16:37:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 16:37:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-18 16:37:16,462 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-18 16:37:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:16,463 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-18 16:37:16,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 16:37:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-18 16:37:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 16:37:16,464 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:16,465 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, 1, 1] [2023-02-18 16:37:16,472 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:37:16,670 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:37:16,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-18 16:37:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261621850] [2023-02-18 16:37:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:16,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:16,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690261276] [2023-02-18 16:37:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:16,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:16,681 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:37:16,689 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:37:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:16,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 16:37:16,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 16:37:16,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:16,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:16,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261621850] [2023-02-18 16:37:16,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:16,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690261276] [2023-02-18 16:37:16,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690261276] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:37:16,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:37:16,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 16:37:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045320827] [2023-02-18 16:37:16,946 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:16,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 16:37:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 16:37:16,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:37:16,949 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 16:37:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:17,144 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-18 16:37:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 16:37:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2023-02-18 16:37:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:17,149 INFO L225 Difference]: With dead ends: 97 [2023-02-18 16:37:17,149 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 16:37:17,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-18 16:37:17,152 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:17,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 107 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 16:37:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 16:37:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 16:37:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 16:37:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-18 16:37:17,184 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-18 16:37:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:17,184 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-18 16:37:17,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 16:37:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-18 16:37:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 16:37:17,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:17,189 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:17,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 16:37:17,395 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:37:17,396 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-18 16:37:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830475351] [2023-02-18 16:37:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:17,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:17,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494998725] [2023-02-18 16:37:17,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 16:37:17,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:17,418 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:37:17,439 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:37:17,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 16:37:17,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:17,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 16:37:17,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:17,544 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:37:17,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:17,697 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:37:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:17,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830475351] [2023-02-18 16:37:17,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:17,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494998725] [2023-02-18 16:37:17,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494998725] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:17,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:17,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 16:37:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269182727] [2023-02-18 16:37:17,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:17,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 16:37:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:17,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 16:37:17,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 16:37:17,702 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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:37:20,871 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:37:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:21,182 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-18 16:37:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:37:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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 78 [2023-02-18 16:37:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:21,184 INFO L225 Difference]: With dead ends: 110 [2023-02-18 16:37:21,184 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 16:37:21,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-18 16:37:21,185 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:21,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 99 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2023-02-18 16:37:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 16:37:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-18 16:37:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 16:37:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-18 16:37:21,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-18 16:37:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:21,211 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-18 16:37:21,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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:37:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-18 16:37:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 16:37:21,215 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:21,215 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:21,223 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:37:21,420 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:37:21,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-18 16:37:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:21,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840908554] [2023-02-18 16:37:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:21,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:21,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010174641] [2023-02-18 16:37:21,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:37:21,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:21,437 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:37:21,442 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:37:21,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:37:21,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:21,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 16:37:21,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 78 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-18 16:37:21,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:22,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840908554] [2023-02-18 16:37:22,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:22,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010174641] [2023-02-18 16:37:22,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010174641] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:37:22,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:37:22,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 16:37:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643835205] [2023-02-18 16:37:22,127 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:22,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 16:37:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 16:37:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-18 16:37:22,131 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 16:37:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:22,432 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-18 16:37:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 16:37:22,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2023-02-18 16:37:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:22,434 INFO L225 Difference]: With dead ends: 111 [2023-02-18 16:37:22,434 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 16:37:22,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-02-18 16:37:22,435 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:22,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 16:37:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 16:37:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-18 16:37:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 16:37:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-18 16:37:22,459 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 99 [2023-02-18 16:37:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:22,459 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-18 16:37:22,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 16:37:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-18 16:37:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-18 16:37:22,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:22,461 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:37:22,469 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:37:22,669 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:37:22,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-18 16:37:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:22,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323331295] [2023-02-18 16:37:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:22,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:22,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054395405] [2023-02-18 16:37:22,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 16:37:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:22,680 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:37:22,686 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:37:22,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 16:37:22,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:22,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-18 16:37:22,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-02-18 16:37:22,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2023-02-18 16:37:23,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323331295] [2023-02-18 16:37:23,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054395405] [2023-02-18 16:37:23,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054395405] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:23,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-18 16:37:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056308542] [2023-02-18 16:37:23,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:23,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 16:37:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:23,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 16:37:23,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-02-18 16:37:23,496 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 16:37:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:25,898 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2023-02-18 16:37:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 16:37:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 121 [2023-02-18 16:37:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:25,900 INFO L225 Difference]: With dead ends: 123 [2023-02-18 16:37:25,900 INFO L226 Difference]: Without dead ends: 121 [2023-02-18 16:37:25,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-02-18 16:37:25,901 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:25,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-18 16:37:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-18 16:37:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2023-02-18 16:37:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 71 states have internal predecessors, (72), 30 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-02-18 16:37:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2023-02-18 16:37:25,932 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 121 [2023-02-18 16:37:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:25,933 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2023-02-18 16:37:25,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 16:37:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2023-02-18 16:37:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-18 16:37:25,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:25,934 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 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:37:25,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 16:37:26,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 16:37:26,141 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2023-02-18 16:37:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:26,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818416163] [2023-02-18 16:37:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:26,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:26,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:26,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104241569] [2023-02-18 16:37:26,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 16:37:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:26,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:26,151 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:37:26,153 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:37:26,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 16:37:26,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 16:37:26,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-18 16:37:26,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-02-18 16:37:27,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:30,322 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (div (- |c_ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (let ((.cse0 (+ 6 |c_ULTIMATE.start_main_~z~0#1|))) (+ (+ (+ (* |c_ULTIMATE.start_main_~a~0#1| .cse0) (- (* 6 |c_ULTIMATE.start_main_~a~0#1|))) (- (* 2 (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|)))) (* 2 .cse0))) (- 10))) (not (= (mod (* |c_ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (not (<= .cse1 |c_ULTIMATE.start_main_~a~0#1|)) (not (= 0 (+ 12 (+ (+ (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (- (* 12 |c_ULTIMATE.start_main_~y~0#1|))) (- (* 6 |c_ULTIMATE.start_main_~z~0#1|)))))) (<= (+ 1 .cse1) |c_ULTIMATE.start_main_~a~0#1|))) is different from true [2023-02-18 16:37:32,433 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (+ 6 |c_ULTIMATE.start_main_~z~0#1|)) (.cse3 (+ (+ (div (- |c_ULTIMATE.start_main_~z~0#1|) (- 6)) 1) (- 1)))) (or (not (= (mod (* |c_ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (not (= 0 (+ 12 (+ (+ (* .cse0 .cse0) (- (* 12 .cse1))) (- (* 6 .cse0)))))) (= 0 (+ (let ((.cse2 (+ 6 .cse0))) (+ (+ (+ (* |c_ULTIMATE.start_main_~a~0#1| .cse2) (- (* 6 |c_ULTIMATE.start_main_~a~0#1|))) (- (* 2 (+ .cse1 .cse0)))) (* 2 .cse2))) (- 10))) (<= (+ 1 .cse3) |c_ULTIMATE.start_main_~a~0#1|) (not (<= .cse3 |c_ULTIMATE.start_main_~a~0#1|)))) is different from true [2023-02-18 16:37:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 153 proven. 39 refuted. 0 times theorem prover too weak. 810 trivial. 8 not checked. [2023-02-18 16:37:32,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818416163] [2023-02-18 16:37:32,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:32,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104241569] [2023-02-18 16:37:32,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104241569] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:32,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:32,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-18 16:37:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794860789] [2023-02-18 16:37:32,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:32,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 16:37:32,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:32,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 16:37:32,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=249, Unknown=2, NotChecked=66, Total=380 [2023-02-18 16:37:32,491 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2023-02-18 16:37:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:37:35,189 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-02-18 16:37:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:37:35,189 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) Word has length 126 [2023-02-18 16:37:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:37:35,190 INFO L225 Difference]: With dead ends: 124 [2023-02-18 16:37:35,190 INFO L226 Difference]: Without dead ends: 120 [2023-02-18 16:37:35,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 226 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=121, Invalid=437, Unknown=2, NotChecked=90, Total=650 [2023-02-18 16:37:35,191 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-18 16:37:35,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 57 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 225 Invalid, 0 Unknown, 75 Unchecked, 1.9s Time] [2023-02-18 16:37:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-18 16:37:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-18 16:37:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 30 states have call successors, (30), 19 states have call predecessors, (30), 18 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-02-18 16:37:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-02-18 16:37:35,235 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 126 [2023-02-18 16:37:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:37:35,235 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-02-18 16:37:35,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2023-02-18 16:37:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-02-18 16:37:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-18 16:37:35,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:37:35,237 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, 1, 1] [2023-02-18 16:37:35,246 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:37:35,444 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:37:35,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:37:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:37:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954085, now seen corresponding path program 1 times [2023-02-18 16:37:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:37:35,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328780167] [2023-02-18 16:37:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:37:35,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 16:37:35,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072771505] [2023-02-18 16:37:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:37:35,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:37:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:37:35,465 INFO L229 MonitoredProcess]: Starting monitored process 13 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:37:35,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 16:37:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:37:35,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-18 16:37:35,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:37:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 47 proven. 167 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-18 16:37:35,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 16:37:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 47 proven. 165 refuted. 2 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-18 16:37:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:37:38,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328780167] [2023-02-18 16:37:38,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 16:37:38,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072771505] [2023-02-18 16:37:38,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072771505] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 16:37:38,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 16:37:38,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-18 16:37:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733721588] [2023-02-18 16:37:38,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 16:37:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 16:37:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:37:38,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 16:37:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=267, Unknown=1, NotChecked=0, Total=342 [2023-02-18 16:37:38,786 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2023-02-18 16:37:43,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:51,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:37:53,768 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:37:55,800 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:37:57,802 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:38:00,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:03,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 16:38:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:38:03,493 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-02-18 16:38:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:38:03,494 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 131 [2023-02-18 16:38:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:38:03,494 INFO L225 Difference]: With dead ends: 123 [2023-02-18 16:38:03,494 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 16:38:03,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 240 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=102, Invalid=358, Unknown=2, NotChecked=0, Total=462 [2023-02-18 16:38:03,495 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 48 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-02-18 16:38:03,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 115 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 581 Invalid, 6 Unknown, 0 Unchecked, 14.3s Time] [2023-02-18 16:38:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 16:38:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 16:38:03,496 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:38:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 16:38:03,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2023-02-18 16:38:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:38:03,497 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 16:38:03,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2023-02-18 16:38:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 16:38:03,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 16:38:03,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 16:38:03,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 16:38:03,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 16:38:03,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 16:38:03,741 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 16:38:03,742 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse75 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse44 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse43 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse13 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse75))) (.cse12 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse52 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse54 (let ((.cse74 (= |ULTIMATE.start_main_~z~0#1| (+ .cse75 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 .cse12) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse73 (- 5)) 0))) (not .cse74) .cse52 (or .cse72 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse74))) (.cse27 (not .cse13)) (.cse35 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse71 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse50 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse45 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse39 (+ .cse44 .cse43)) (.cse58 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse29 (+ 1 0)) (.cse15 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse49 (- .cse58)) (.cse42 (* 2 .cse43)) (.cse51 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse17 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse18 (= 0 (+ (+ (* .cse58 |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|)))) (.cse8 (+ |ULTIMATE.start_main_~y~0#1| (* .cse12 (- 1)))) (.cse47 (- (* 18 .cse39))) (.cse40 (+ .cse43 .cse45)) (.cse41 (+ 6 .cse45)) (.cse1 (or (and .cse11 .cse5 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse5) (not .cse11)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse56 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse35) .cse71) .cse50) (- 6)))) (.cse24 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse71) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse19 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse21 (let ((.cse69 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse70 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse70 |ULTIMATE.start_main_~n~0#1|) .cse70)))))) (or (and .cse54 .cse69) (and .cse54 (or .cse27 .cse69))))) (.cse46 (- (* 18 .cse44))) (.cse65 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse57 (+ 6 6))) (let ((.cse10 (+ 6 .cse57)) (.cse6 (* .cse57 (- 1))) (.cse4 (let ((.cse67 (let ((.cse68 (+ 6 (* 6 .cse65)))) (or (= 0 (+ (+ (+ (+ (* .cse43 .cse68) .cse46) (- (* 12 .cse43))) (* 2 .cse68)) (- 6))) (not (= .cse68 .cse45)))))) (or (and (let ((.cse66 (+ 6 (* 6 (+ 1 .cse65))))) (or (= 0 (+ (+ (+ (+ (* .cse40 .cse66) .cse47) (- (* 12 .cse40))) (* 2 .cse66)) (- 6))) (not (= .cse66 .cse41)))) .cse1 .cse24 .cse67 .cse56 .cse11 .cse5 .cse19 .cse21) (and .cse1 (or .cse27 .cse56) .cse24 .cse67 .cse11 .cse5 .cse19 .cse21)))) (.cse34 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse3 (= 0 (+ 12 (+ (+ (* .cse12 .cse12) (- (* 12 .cse8))) (- (* 6 .cse12)))))) (.cse28 (= .cse44 (* (* .cse65 .cse65) .cse65))) (.cse16 (or .cse27 .cse17 .cse18)) (.cse9 (or (let ((.cse62 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse62 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse62))) (let ((.cse63 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse64 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse63 (+ .cse64 32767)) .cse51 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse63 (+ .cse64 65535)))))) (.cse0 (let ((.cse61 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse45) .cse49) (- .cse42)) (* 2 .cse45)) (- 10))) (not (<= .cse61 |ULTIMATE.start_main_~a~0#1|)) (not .cse24) (not (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (<= (+ 1 .cse61) |ULTIMATE.start_main_~a~0#1|)))) (.cse23 (+ 1 6)) (.cse2 (<= .cse15 |ULTIMATE.start_main_~a~0#1|)) (.cse48 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse53 (<= |ULTIMATE.start_main_~n~0#1| .cse29)) (.cse32 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse33 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (let ((.cse7 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse3 .cse4 .cse5 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse6))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse7 .cse8)) .cse9 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse10)) .cse11 (= .cse12 .cse10) (= (+ .cse7 (* (+ .cse8 .cse6) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse13)) (let ((.cse31 (+ .cse33 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| .cse32 .cse31))) (let ((.cse25 (+ |ULTIMATE.start_main_~y~0#1| (* .cse30 (- 1))))) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| .cse6)) (.cse14 (+ (* .cse25 (- 1)) .cse31 6))) (let ((.cse26 (+ .cse25 .cse14 (* .cse31 (- 1)))) (.cse20 (+ |ULTIMATE.start_main_~x~0#1| (* .cse22 (- 1))))) (and (= .cse14 0) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse3 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse15 (- 1)) 0) .cse16 .cse9 (or .cse17 .cse18) .cse19 (= .cse20 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 .cse0 .cse2 (= |ULTIMATE.start_main_~z~0#1| .cse10) .cse5 .cse21 (= .cse22 .cse23) .cse24 .cse11 (= (+ .cse25 (* .cse26 (- 1))) 1) (or .cse27 .cse28) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse22)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse29)) (= .cse30 (+ 6 .cse26)) .cse13 (= .cse22 (+ .cse20 6)))))))) (and .cse0 .cse1 .cse2 (= 0 (+ (+ (+ (+ (+ (* .cse34 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse35) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse3 .cse4 .cse5 (= 0 (+ (let ((.cse38 (+ 6 .cse41))) (+ (let ((.cse36 (+ .cse40 .cse41))) (+ (let ((.cse37 (+ .cse39 .cse40))) (+ (+ (* (* 2 .cse36) .cse36) (- (* (* 3 .cse37) .cse38))) (- (* 18 .cse37)))) (- (* 10 .cse36)))) (* 3 .cse38))) (- 10))) .cse16 .cse9 .cse11 (= 0 (+ (+ (+ (+ (+ (* .cse42 .cse43) (- (* (* 3 .cse44) .cse45))) .cse46) (- (* 10 .cse43))) (* 3 .cse45)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse40) .cse40) (- (* (* 3 .cse39) .cse41))) .cse47) (- (* 10 .cse40))) (* 3 .cse41)) (- 10))) .cse13) (and .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) .cse48 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse49) (- .cse34)) .cse50) (- 10))) .cse5 .cse51 (= |ULTIMATE.start_main_~z~0#1| 6) .cse9 (= |ULTIMATE.start_main_~y~0#1| 1) .cse52 .cse11 .cse53 .cse54 .cse13) (let ((.cse59 (+ .cse33 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse55 (* 1 (- 1))) (.cse60 (+ |ULTIMATE.start_main_~y~0#1| .cse59 .cse32))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse55) 0) (= .cse12 (+ 6 (* 6 0))) .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 6)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse12)) .cse28 .cse16 .cse9 .cse56 (= |ULTIMATE.start_main_~n~0#1| .cse29) .cse1 .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse23) .cse2 (= .cse12 6) (= (+ .cse55 |ULTIMATE.start_main_~x~0#1|) 0) .cse48 (= .cse15 0) .cse5 .cse51 .cse21 (= |ULTIMATE.start_main_~z~0#1| .cse57) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse58 .cse44) (- (* .cse44 .cse45))) (* 12 .cse44))) (not .cse17)) (= .cse59 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse60)) .cse11 .cse53 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse60 (- 1))) 1) .cse13))))))))) [2023-02-18 16:38:03,743 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse42 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse41 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse43 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse38 (+ .cse42 .cse41)) (.cse26 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse18 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse34 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse47 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse15 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse51 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse52 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse46 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse54 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse44 (- (* 18 .cse42))) (.cse22 (+ |ULTIMATE.start_main_~y~0#1| (* .cse26 (- 1)))) (.cse45 (- (* 18 .cse38))) (.cse39 (+ .cse41 .cse43)) (.cse40 (+ 6 .cse43)) (.cse53 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse59 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse28 (not (<= .cse59 |ULTIMATE.start_main_~a~0#1|))) (.cse29 (let ((.cse61 (+ 6 (* 6 (+ 1 .cse53))))) (or (= 0 (+ (+ (+ (+ (* .cse39 .cse61) .cse45) (- (* 12 .cse39))) (* 2 .cse61)) (- 6))) (not (= .cse61 .cse40))))) (.cse30 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse19 (= 0 (+ 12 (+ (+ (* .cse26 .cse26) (- (* 12 .cse22))) (- (* 6 .cse26)))))) (.cse31 (let ((.cse60 (+ 6 (* 6 .cse53)))) (or (= 0 (+ (+ (+ (+ (* .cse41 .cse60) .cse44) (- (* 12 .cse41))) (* 2 .cse60)) (- 6))) (not (= .cse60 .cse43))))) (.cse4 (= 0 (+ (+ (* .cse54 |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|)))) (.cse23 (<= (+ .cse59 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse24 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse25 (or (let ((.cse56 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse56 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse56))) (let ((.cse57 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse58 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse57 (+ .cse58 32767)) .cse46 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse57 (+ .cse58 65535)))))) (.cse7 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse52) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse32 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse51))) (.cse1 (or (and .cse9 .cse3 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse3) (not .cse9)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse55 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse55 |ULTIMATE.start_main_~n~0#1|) .cse55))))) (.cse5 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse47) (= 0 (+ (+ (* .cse54 .cse42) (- (* .cse42 .cse43))) (* 12 .cse42))) .cse15)) (.cse6 (= .cse42 (* (* .cse53 .cse53) .cse53))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse34) .cse52) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse12 (let ((.cse50 (= |ULTIMATE.start_main_~z~0#1| (+ .cse51 6)))) (or (let ((.cse49 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse48 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse49 (- 6)) 0))) (and (or (not .cse48) (<= 0 .cse26) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse49 (- 5)) 0))) (not .cse50) .cse18 (or .cse48 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse50))) (.cse14 (+ 1 0)) (.cse13 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|)))) (or (let ((.cse17 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse17))) (let ((.cse10 (+ |ULTIMATE.start_main_~y~0#1| (* .cse16 (- 1))))) (let ((.cse0 (+ (* .cse10 (- 1)) .cse17 6))) (let ((.cse11 (+ .cse10 .cse0 (* .cse17 (- 1))))) (and (= .cse0 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 .cse3 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (+ .cse10 (* .cse11 (- 1))) 1) .cse12 .cse13 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse14)) .cse15 (= .cse16 (+ 6 .cse11)))))))) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse18 (= |ULTIMATE.start_main_~x~0#1| 0) .cse12 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse33 (+ 6 6))) (let ((.cse21 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18))) (.cse20 (* .cse33 (- 1))) (.cse27 (+ 6 .cse33))) (and .cse19 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse20))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse21 .cse22)) .cse6 .cse23 .cse24 .cse25 .cse8 .cse12 .cse13 (= .cse26 .cse27) (= (+ .cse21 (* (+ .cse22 .cse20) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse28 .cse29 .cse1 .cse30 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse31 .cse2 .cse3 .cse5 .cse7 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse27)) .cse9 .cse15 .cse32))) (and .cse28 .cse29 .cse1 .cse30 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse34) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse19 .cse31 (or (not .cse32) .cse4) .cse2 .cse3 (= 0 (+ (let ((.cse37 (+ 6 .cse40))) (+ (let ((.cse35 (+ .cse39 .cse40))) (+ (let ((.cse36 (+ .cse38 .cse39))) (+ (+ (* (* 2 .cse35) .cse35) (- (* (* 3 .cse36) .cse37))) (- (* 18 .cse36)))) (- (* 10 .cse35)))) (* 3 .cse37))) (- 10))) .cse5 .cse6 .cse23 .cse24 .cse25 .cse7 .cse8 .cse9 .cse12 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse41) .cse41) (- (* (* 3 .cse42) .cse43))) .cse44) (- (* 10 .cse41))) (* 3 .cse43)) (- 10))) .cse13 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse39) .cse39) (- (* (* 3 .cse38) .cse40))) .cse45) (- (* 10 .cse39))) (* 3 .cse40)) (- 10))) .cse32) (and .cse1 (= .cse26 (+ 6 (* 6 0))) (= .cse26 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse2 .cse3 .cse46 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse26)) .cse5 .cse6 (<= .cse47 1) .cse8 .cse9 (<= |ULTIMATE.start_main_~n~0#1| .cse14) .cse12 (= |ULTIMATE.start_main_~n~0#1| .cse14) .cse13 (= |ULTIMATE.start_main_~x~0#1| 1))))))) [2023-02-18 16:38:03,743 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~z~0#1| 6)) (.cse2 (= |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) .cse2 (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 .cse2 .cse3 .cse5 .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 .cse1 .cse2 .cse3 .cse4) (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))))))) [2023-02-18 16:38:03,743 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse34 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse23 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse41 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse56 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse16 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse50 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse55 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse18 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse9 (+ .cse18 .cse17)) (.cse47 (= 0 (+ (+ (* .cse55 |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|)))) (.cse37 (= .cse18 (* (* .cse50 .cse50) .cse50))) (.cse1 (or (and .cse16 .cse5 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse5) (not .cse16)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse38 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse3) .cse56) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse24 (let ((.cse61 (= |ULTIMATE.start_main_~z~0#1| (+ .cse41 6)))) (or (let ((.cse60 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse59 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse60 (- 6)) 0))) (and (or (not .cse59) (<= 0 .cse34) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse60 (- 5)) 0))) (not .cse61) .cse23 (or .cse59 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse61))) (.cse39 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse58 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse58 |ULTIMATE.start_main_~n~0#1|) .cse58))))) (.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|))) (.cse19 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse48 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse57 (+ 6 6))) (let ((.cse35 (+ 6 .cse57)) (.cse36 (* .cse57 (- 1))) (.cse28 (let ((.cse53 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse56) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse54 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse55 .cse18) (- (* .cse18 .cse19))) (* 12 .cse18))) .cse48))) (or (and .cse37 .cse1 .cse53 .cse38 .cse16 .cse24 .cse39 .cse5 .cse40 .cse47 .cse54) (and .cse37 .cse1 .cse53 .cse38 .cse16 .cse24 .cse39 .cse5 .cse40 .cse54)))) (.cse20 (- (* 18 .cse18))) (.cse21 (- (* 18 .cse9))) (.cse10 (+ .cse17 .cse19)) (.cse11 (+ 6 .cse19)) (.cse33 (+ |ULTIMATE.start_main_~y~0#1| (* .cse34 (- 1)))) (.cse52 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse0 (not (<= .cse52 |ULTIMATE.start_main_~a~0#1|))) (.cse2 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse4 (= 0 (+ 12 (+ (+ (* .cse34 .cse34) (- (* 12 .cse33))) (- (* 6 .cse34)))))) (.cse12 (<= (+ .cse52 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse13 (let ((.cse45 (let ((.cse51 (+ 6 (* 6 (+ 1 .cse50))))) (or (= 0 (+ (+ (+ (+ (* .cse10 .cse51) .cse21) (- (* 12 .cse10))) (* 2 .cse51)) (- 6))) (not (= .cse51 .cse11))))) (.cse46 (let ((.cse49 (+ 6 (* 6 .cse50)))) (or (= 0 (+ (+ (+ (+ (* .cse17 .cse49) .cse20) (- (* 12 .cse17))) (* 2 .cse49)) (- 6))) (not (= .cse49 .cse19)))))) (or (and .cse45 .cse1 .cse46 .cse38 .cse16 .cse5 .cse47 .cse28) (and .cse45 .cse1 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse46 .cse38 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse35)) .cse16 .cse5 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse36))) .cse28 .cse48 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))))) (.cse14 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse15 (or (let ((.cse42 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse42 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse42))) (let ((.cse43 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse44 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse43 (+ .cse44 32767)) (<= 0 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse43 (+ .cse44 65535)))))) (.cse22 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse41))) (.cse29 (+ 1 0))) (or (and .cse0 .cse1 .cse2 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse3) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse4 .cse5 (= 0 (+ (let ((.cse8 (+ 6 .cse11))) (+ (let ((.cse6 (+ .cse10 .cse11))) (+ (let ((.cse7 (+ .cse9 .cse10))) (+ (+ (* (* 2 .cse6) .cse6) (- (* (* 3 .cse7) .cse8))) (- (* 18 .cse7)))) (- (* 10 .cse6)))) (* 3 .cse8))) (- 10))) .cse12 .cse13 .cse14 .cse15 .cse16 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse17) .cse17) (- (* (* 3 .cse18) .cse19))) .cse20) (- (* 10 .cse17))) (* 3 .cse19)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse10) .cse10) (- (* (* 3 .cse9) .cse11))) .cse21) (- (* 10 .cse10))) (* 3 .cse11)) (- 10))) .cse22) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse23 (= |ULTIMATE.start_main_~x~0#1| 0) .cse24 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse31 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse31))) (let ((.cse26 (+ |ULTIMATE.start_main_~y~0#1| (* .cse30 (- 1))))) (let ((.cse25 (+ (* .cse26 (- 1)) .cse31 6))) (let ((.cse27 (+ .cse26 .cse25 (* .cse31 (- 1))))) (and (= .cse25 0) .cse1 .cse16 (= (+ .cse26 (* .cse27 (- 1))) 1) .cse5 .cse28 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse29)) (= .cse30 (+ 6 .cse27)))))))) (let ((.cse32 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse32 .cse33)) .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse34 .cse35) (= (+ .cse32 (* (+ .cse33 .cse36) (- 1))) 1) .cse22)) (and .cse37 (= .cse34 (+ 6 (* 6 0))) .cse38 (= .cse34 6) .cse24 .cse39 (= |ULTIMATE.start_main_~n~0#1| .cse29) .cse40 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse34)))))))) [2023-02-18 16:38:03,744 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse40 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse39 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse36 (+ .cse40 .cse39)) (.cse18 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse46 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse32 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse60 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse54 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse45 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse41 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse15 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse59 (+ 6 6)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse61 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse28 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse44 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| (* .cse28 (- 1)))) (.cse4 (= 0 (+ (+ (* .cse61 |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|)))) (.cse1 (or (and .cse9 .cse3 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse3) (not .cse9)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse62 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse62 |ULTIMATE.start_main_~n~0#1|) .cse62))))) (.cse30 (* .cse59 (- 1))) (.cse5 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse45) (= 0 (+ (+ (* .cse61 .cse40) (- (* .cse40 .cse41))) (* 12 .cse40))) .cse15)) (.cse6 (= .cse40 (* (* .cse54 .cse54) .cse54))) (.cse7 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse60) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse32) .cse60) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse29 (+ 6 .cse59)) (.cse12 (let ((.cse58 (= |ULTIMATE.start_main_~z~0#1| (+ .cse46 6)))) (or (let ((.cse57 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse56 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse57 (- 6)) 0))) (and (or (not .cse56) (<= 0 .cse28) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse57 (- 5)) 0))) (not .cse58) .cse18 (or .cse56 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse58))) (.cse13 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse42 (- (* 18 .cse40))) (.cse43 (- (* 18 .cse36))) (.cse37 (+ .cse39 .cse41)) (.cse38 (+ 6 .cse41)) (.cse50 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse19 (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|))) (.cse20 (let ((.cse51 (let ((.cse55 (+ 6 (* 6 (+ 1 .cse54))))) (or (= 0 (+ (+ (+ (+ (* .cse37 .cse55) .cse43) (- (* 12 .cse37))) (* 2 .cse55)) (- 6))) (not (= .cse55 .cse38))))) (.cse52 (let ((.cse53 (+ 6 (* 6 .cse54)))) (or (= 0 (+ (+ (+ (+ (* .cse39 .cse53) .cse42) (- (* 12 .cse39))) (* 2 .cse53)) (- 6))) (not (= .cse53 .cse41)))))) (or (and .cse51 .cse1 .cse52 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (and .cse51 .cse1 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse52 .cse2 .cse3 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse30))) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse29)) .cse9 .cse12 .cse13 .cse15 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))))) (.cse21 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse22 (= 0 (+ 12 (+ (+ (* .cse28 .cse28) (- (* 12 .cse24))) (- (* 6 .cse28)))))) (.cse25 (<= (+ .cse50 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse26 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse27 (or (let ((.cse47 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse47 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse47))) (let ((.cse48 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse49 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse48 (+ .cse49 32767)) .cse44 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse48 (+ .cse49 65535)))))) (.cse31 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse46))) (.cse14 (+ 1 0))) (or (let ((.cse17 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse17))) (let ((.cse10 (+ |ULTIMATE.start_main_~y~0#1| (* .cse16 (- 1))))) (let ((.cse0 (+ (* .cse10 (- 1)) .cse17 6))) (let ((.cse11 (+ .cse10 .cse0 (* .cse17 (- 1))))) (and (= .cse0 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 .cse3 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (+ .cse10 (* .cse11 (- 1))) 1) .cse12 .cse13 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse14)) .cse15 (= .cse16 (+ 6 .cse11)))))))) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse18 (= |ULTIMATE.start_main_~x~0#1| 0) .cse12 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse23 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse19 .cse20 .cse1 .cse21 .cse22 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ .cse23 .cse24)) .cse25 .cse26 .cse27 .cse9 (= .cse28 .cse29) (= (+ .cse23 (* (+ .cse24 .cse30) (- 1))) 1) .cse31)) (and .cse19 .cse20 .cse1 .cse21 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse32) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse22 .cse3 (= 0 (+ (let ((.cse35 (+ 6 .cse38))) (+ (let ((.cse33 (+ .cse37 .cse38))) (+ (let ((.cse34 (+ .cse36 .cse37))) (+ (+ (* (* 2 .cse33) .cse33) (- (* (* 3 .cse34) .cse35))) (- (* 18 .cse34)))) (- (* 10 .cse33)))) (* 3 .cse35))) (- 10))) .cse25 .cse26 .cse27 .cse9 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse39) .cse39) (- (* (* 3 .cse40) .cse41))) .cse42) (- (* 10 .cse39))) (* 3 .cse41)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse37) .cse37) (- (* (* 3 .cse36) .cse38))) .cse43) (- (* 10 .cse37))) (* 3 .cse38)) (- 10))) .cse31) (and .cse1 (= .cse28 (+ 6 (* 6 0))) (= .cse28 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse2 .cse3 .cse44 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse28)) .cse5 .cse6 (<= .cse45 1) .cse8 .cse9 (<= |ULTIMATE.start_main_~n~0#1| .cse14) .cse12 (= |ULTIMATE.start_main_~n~0#1| .cse14) .cse13 (= |ULTIMATE.start_main_~x~0#1| 1))))))) [2023-02-18 16:38:03,744 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 16:38:03,744 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 16:38:03,744 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-18 16:38:03,744 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-18 16:38:03,745 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse25 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse26 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse13 (+ .cse25 .cse24)) (.cse32 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse71 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse39 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse38 (+ 6 6)) (.cse36 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse50 (- .cse39)) (.cse23 (* 2 .cse24)) (.cse19 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse71) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse9 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse21 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse52 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse37 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse30 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse40 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse54 (= 0 (+ (+ (* .cse39 |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|)))) (.cse48 (+ |ULTIMATE.start_main_~y~0#1| (* .cse32 (- 1)))) (.cse33 (+ 1 0)) (.cse5 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse51 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse27 (- (* 18 .cse25))) (.cse29 (- (* 18 .cse13))) (.cse14 (+ .cse24 .cse26)) (.cse15 (+ 6 .cse26)) (.cse70 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse0 (let ((.cse73 (+ 6 (* 6 (+ 1 .cse70))))) (or (= 0 (+ (+ (+ (+ (* .cse14 .cse73) .cse29) (- (* 12 .cse14))) (* 2 .cse73)) (- 6))) (not (= .cse73 .cse15))))) (.cse7 (let ((.cse72 (+ 6 (* 6 .cse70)))) (or (= 0 (+ (+ (+ (+ (* .cse24 .cse72) .cse27) (- (* 12 .cse24))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse26))))) (.cse20 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse5) .cse71) .cse51) (- 6)))) (.cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse4 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse43 (<= |ULTIMATE.start_main_~n~0#1| .cse33)) (.cse6 (= 0 (+ 12 (+ (+ (* .cse32 .cse32) (- (* 12 .cse48))) (- (* 6 .cse32)))))) (.cse16 (= .cse25 (* (* .cse70 .cse70) .cse70))) (.cse17 (or (not .cse30) .cse40 .cse54)) (.cse18 (or (let ((.cse67 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse67 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse67))) (let ((.cse68 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse69 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse68 (+ .cse69 32767)) .cse37 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse68 (+ .cse69 65535)))))) (.cse22 (let ((.cse65 (= |ULTIMATE.start_main_~z~0#1| (+ .cse66 6)))) (or (let ((.cse64 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse63 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 6)) 0))) (and (or (not .cse63) (<= 0 .cse32) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse52 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse28 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse1 (or (and .cse21 .cse9 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse21)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse2 (let ((.cse62 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse26) .cse50) (- .cse23)) (* 2 .cse26)) (- 10))) (not (<= .cse62 |ULTIMATE.start_main_~a~0#1|)) (not .cse19) (not (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (<= (+ 1 .cse62) |ULTIMATE.start_main_~a~0#1|)))) (.cse3 (<= .cse36 |ULTIMATE.start_main_~a~0#1|)) (.cse49 (+ 6 .cse38)) (.cse8 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse61 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse61 |ULTIMATE.start_main_~n~0#1|) .cse61))))) (.cse34 (+ 1 6)) (.cse46 (* .cse38 (- 1))) (.cse44 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse45 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 (+ (+ (+ (+ (+ (* .cse4 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse5) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse6 .cse7 .cse8 .cse9 (= 0 (+ (let ((.cse12 (+ 6 .cse15))) (+ (let ((.cse10 (+ .cse14 .cse15))) (+ (let ((.cse11 (+ .cse13 .cse14))) (+ (+ (* (* 2 .cse10) .cse10) (- (* (* 3 .cse11) .cse12))) (- (* 18 .cse11)))) (- (* 10 .cse10)))) (* 3 .cse12))) (- 10))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= 0 (+ (+ (+ (+ (+ (* .cse23 .cse24) (- (* (* 3 .cse25) .cse26))) .cse27) (- (* 10 .cse24))) (* 3 .cse26)) (- 10))) .cse28 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse14) .cse14) (- (* (* 3 .cse13) .cse15))) .cse29) (- (* 10 .cse14))) (* 3 .cse15)) (- 10))) .cse30) (let ((.cse41 (+ .cse45 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse31 (* 1 (- 1))) (.cse42 (+ |ULTIMATE.start_main_~y~0#1| .cse41 .cse44))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse31) 0) (= .cse32 (+ 6 (* 6 0))) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 6)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse32)) .cse16 .cse17 .cse18 .cse20 .cse22 (= |ULTIMATE.start_main_~n~0#1| .cse33) .cse28 .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse34) .cse3 (= .cse32 6) (= (+ .cse31 |ULTIMATE.start_main_~x~0#1|) 0) .cse35 (= .cse36 0) .cse8 .cse9 .cse37 (= |ULTIMATE.start_main_~z~0#1| .cse38) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse39 .cse25) (- (* .cse25 .cse26))) (* 12 .cse25))) (not .cse40)) (= .cse41 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse42)) .cse21 .cse43 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse42 (- 1))) 1) .cse30))) (let ((.cse47 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse6 .cse7 .cse8 .cse9 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse46))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse47 .cse48)) .cse16 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse49)) .cse21 .cse22 .cse28 (= .cse32 .cse49) (= (+ .cse47 (* (+ .cse48 .cse46) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse30)) (and .cse1 .cse3 .cse6 (= |ULTIMATE.start_main_~x~0#1| 0) .cse35 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse50) (- .cse4)) .cse51) (- 10))) .cse9 .cse37 (= |ULTIMATE.start_main_~z~0#1| 6) .cse18 (= |ULTIMATE.start_main_~y~0#1| 1) .cse52 .cse21 .cse43 .cse22 .cse30) (let ((.cse60 (+ .cse45 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| .cse44 .cse60))) (let ((.cse57 (+ |ULTIMATE.start_main_~y~0#1| (* .cse59 (- 1))))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse46)) (.cse53 (+ (* .cse57 (- 1)) .cse60 6))) (let ((.cse58 (+ .cse57 .cse53 (* .cse60 (- 1)))) (.cse55 (+ |ULTIMATE.start_main_~x~0#1| (* .cse56 (- 1))))) (and (= .cse53 0) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse6 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse36 (- 1)) 0) .cse16 .cse17 .cse18 (or .cse40 .cse54) .cse22 .cse28 (= .cse55 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| .cse49) .cse8 .cse9 (= .cse56 .cse34) .cse19 .cse21 (= (+ .cse57 (* .cse58 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse56)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse33)) (= .cse59 (+ 6 .cse58)) .cse30 (= .cse56 (+ .cse55 6))))))))))))) [2023-02-18 16:38:03,746 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse75 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse44 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse43 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse13 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse75))) (.cse12 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse52 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse54 (let ((.cse74 (= |ULTIMATE.start_main_~z~0#1| (+ .cse75 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 .cse12) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse73 (- 5)) 0))) (not .cse74) .cse52 (or .cse72 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse74))) (.cse27 (not .cse13)) (.cse35 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse71 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse50 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse45 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse39 (+ .cse44 .cse43)) (.cse58 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse29 (+ 1 0)) (.cse15 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse49 (- .cse58)) (.cse42 (* 2 .cse43)) (.cse51 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse17 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse18 (= 0 (+ (+ (* .cse58 |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|)))) (.cse8 (+ |ULTIMATE.start_main_~y~0#1| (* .cse12 (- 1)))) (.cse47 (- (* 18 .cse39))) (.cse40 (+ .cse43 .cse45)) (.cse41 (+ 6 .cse45)) (.cse1 (or (and .cse11 .cse5 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse5) (not .cse11)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse56 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse35) .cse71) .cse50) (- 6)))) (.cse24 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse71) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse19 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse21 (let ((.cse69 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse70 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse70 |ULTIMATE.start_main_~n~0#1|) .cse70)))))) (or (and .cse54 .cse69) (and .cse54 (or .cse27 .cse69))))) (.cse46 (- (* 18 .cse44))) (.cse65 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse57 (+ 6 6))) (let ((.cse10 (+ 6 .cse57)) (.cse6 (* .cse57 (- 1))) (.cse4 (let ((.cse67 (let ((.cse68 (+ 6 (* 6 .cse65)))) (or (= 0 (+ (+ (+ (+ (* .cse43 .cse68) .cse46) (- (* 12 .cse43))) (* 2 .cse68)) (- 6))) (not (= .cse68 .cse45)))))) (or (and (let ((.cse66 (+ 6 (* 6 (+ 1 .cse65))))) (or (= 0 (+ (+ (+ (+ (* .cse40 .cse66) .cse47) (- (* 12 .cse40))) (* 2 .cse66)) (- 6))) (not (= .cse66 .cse41)))) .cse1 .cse24 .cse67 .cse56 .cse11 .cse5 .cse19 .cse21) (and .cse1 (or .cse27 .cse56) .cse24 .cse67 .cse11 .cse5 .cse19 .cse21)))) (.cse34 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse3 (= 0 (+ 12 (+ (+ (* .cse12 .cse12) (- (* 12 .cse8))) (- (* 6 .cse12)))))) (.cse28 (= .cse44 (* (* .cse65 .cse65) .cse65))) (.cse16 (or .cse27 .cse17 .cse18)) (.cse9 (or (let ((.cse62 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse62 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse62))) (let ((.cse63 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse64 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse63 (+ .cse64 32767)) .cse51 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse63 (+ .cse64 65535)))))) (.cse0 (let ((.cse61 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse45) .cse49) (- .cse42)) (* 2 .cse45)) (- 10))) (not (<= .cse61 |ULTIMATE.start_main_~a~0#1|)) (not .cse24) (not (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (<= (+ 1 .cse61) |ULTIMATE.start_main_~a~0#1|)))) (.cse23 (+ 1 6)) (.cse2 (<= .cse15 |ULTIMATE.start_main_~a~0#1|)) (.cse48 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse53 (<= |ULTIMATE.start_main_~n~0#1| .cse29)) (.cse32 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse33 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (let ((.cse7 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse3 .cse4 .cse5 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse6))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse7 .cse8)) .cse9 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse10)) .cse11 (= .cse12 .cse10) (= (+ .cse7 (* (+ .cse8 .cse6) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse13)) (let ((.cse31 (+ .cse33 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse30 (+ |ULTIMATE.start_main_~y~0#1| .cse32 .cse31))) (let ((.cse25 (+ |ULTIMATE.start_main_~y~0#1| (* .cse30 (- 1))))) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| .cse6)) (.cse14 (+ (* .cse25 (- 1)) .cse31 6))) (let ((.cse26 (+ .cse25 .cse14 (* .cse31 (- 1)))) (.cse20 (+ |ULTIMATE.start_main_~x~0#1| (* .cse22 (- 1))))) (and (= .cse14 0) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse3 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse15 (- 1)) 0) .cse16 .cse9 (or .cse17 .cse18) .cse19 (= .cse20 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 .cse0 .cse2 (= |ULTIMATE.start_main_~z~0#1| .cse10) .cse5 .cse21 (= .cse22 .cse23) .cse24 .cse11 (= (+ .cse25 (* .cse26 (- 1))) 1) (or .cse27 .cse28) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse22)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse29)) (= .cse30 (+ 6 .cse26)) .cse13 (= .cse22 (+ .cse20 6)))))))) (and .cse0 .cse1 .cse2 (= 0 (+ (+ (+ (+ (+ (* .cse34 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse35) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse3 .cse4 .cse5 (= 0 (+ (let ((.cse38 (+ 6 .cse41))) (+ (let ((.cse36 (+ .cse40 .cse41))) (+ (let ((.cse37 (+ .cse39 .cse40))) (+ (+ (* (* 2 .cse36) .cse36) (- (* (* 3 .cse37) .cse38))) (- (* 18 .cse37)))) (- (* 10 .cse36)))) (* 3 .cse38))) (- 10))) .cse16 .cse9 .cse11 (= 0 (+ (+ (+ (+ (+ (* .cse42 .cse43) (- (* (* 3 .cse44) .cse45))) .cse46) (- (* 10 .cse43))) (* 3 .cse45)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse40) .cse40) (- (* (* 3 .cse39) .cse41))) .cse47) (- (* 10 .cse40))) (* 3 .cse41)) (- 10))) .cse13) (and .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) .cse48 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse49) (- .cse34)) .cse50) (- 10))) .cse5 .cse51 (= |ULTIMATE.start_main_~z~0#1| 6) .cse9 (= |ULTIMATE.start_main_~y~0#1| 1) .cse52 .cse11 .cse53 .cse54 .cse13) (let ((.cse59 (+ .cse33 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse55 (* 1 (- 1))) (.cse60 (+ |ULTIMATE.start_main_~y~0#1| .cse59 .cse32))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse55) 0) (= .cse12 (+ 6 (* 6 0))) .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 6)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse12)) .cse28 .cse16 .cse9 .cse56 (= |ULTIMATE.start_main_~n~0#1| .cse29) .cse1 .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse23) .cse2 (= .cse12 6) (= (+ .cse55 |ULTIMATE.start_main_~x~0#1|) 0) .cse48 (= .cse15 0) .cse5 .cse51 .cse21 (= |ULTIMATE.start_main_~z~0#1| .cse57) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse58 .cse44) (- (* .cse44 .cse45))) (* 12 .cse44))) (not .cse17)) (= .cse59 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse60)) .cse11 .cse53 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse60 (- 1))) 1) .cse13))))))))) [2023-02-18 16:38:03,747 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse24 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse23 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse25 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse13 (+ .cse24 .cse23)) (.cse34 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse67 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse58 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse51 (+ 1 0)) (.cse42 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse36 (- .cse58)) (.cse22 (* 2 .cse23)) (.cse18 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse67) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse9 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse39 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse37 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse38 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse29 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse44 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse45 (= 0 (+ (+ (* .cse58 |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|)))) (.cse32 (+ |ULTIMATE.start_main_~y~0#1| (* .cse34 (- 1)))) (.cse57 (+ 6 6)) (.cse26 (- (* 18 .cse24))) (.cse28 (- (* 18 .cse13))) (.cse14 (+ .cse23 .cse25)) (.cse15 (+ 6 .cse25)) (.cse71 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse0 (let ((.cse73 (+ 6 (* 6 (+ 1 .cse71))))) (or (= 0 (+ (+ (+ (+ (* .cse14 .cse73) .cse28) (- (* 12 .cse14))) (* 2 .cse73)) (- 6))) (not (= .cse73 .cse15))))) (.cse7 (let ((.cse72 (+ 6 (* 6 .cse71)))) (or (= 0 (+ (+ (+ (+ (* .cse23 .cse72) .cse26) (- (* 12 .cse23))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse25))))) (.cse4 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse27 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse33 (+ 6 .cse57)) (.cse30 (* .cse57 (- 1))) (.cse6 (= 0 (+ 12 (+ (+ (* .cse34 .cse34) (- (* 12 .cse32))) (- (* 6 .cse34)))))) (.cse43 (= .cse24 (* (* .cse71 .cse71) .cse71))) (.cse16 (or (not .cse29) .cse44 .cse45)) (.cse17 (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)) .cse38 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse69 (+ .cse70 65535)))))) (.cse19 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse5) .cse67) .cse37) (- 6)))) (.cse21 (let ((.cse65 (= |ULTIMATE.start_main_~z~0#1| (+ .cse66 6)))) (or (let ((.cse64 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse63 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 6)) 0))) (and (or (not .cse63) (<= 0 .cse34) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse39 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse1 (or (and .cse20 .cse9 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse20)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse2 (let ((.cse62 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse25) .cse36) (- .cse22)) (* 2 .cse25)) (- 10))) (not (<= .cse62 |ULTIMATE.start_main_~a~0#1|)) (not .cse18) (not (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (<= (+ 1 .cse62) |ULTIMATE.start_main_~a~0#1|)))) (.cse48 (+ 1 6)) (.cse3 (<= .cse42 |ULTIMATE.start_main_~a~0#1|)) (.cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse8 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse61 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse61 |ULTIMATE.start_main_~n~0#1|) .cse61))))) (.cse40 (<= |ULTIMATE.start_main_~n~0#1| .cse51)) (.cse54 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse55 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 (+ (+ (+ (+ (+ (* .cse4 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse5) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse6 .cse7 .cse8 .cse9 (= 0 (+ (let ((.cse12 (+ 6 .cse15))) (+ (let ((.cse10 (+ .cse14 .cse15))) (+ (let ((.cse11 (+ .cse13 .cse14))) (+ (+ (* (* 2 .cse10) .cse10) (- (* (* 3 .cse11) .cse12))) (- (* 18 .cse11)))) (- (* 10 .cse10)))) (* 3 .cse12))) (- 10))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= 0 (+ (+ (+ (+ (+ (* .cse22 .cse23) (- (* (* 3 .cse24) .cse25))) .cse26) (- (* 10 .cse23))) (* 3 .cse25)) (- 10))) .cse27 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse14) .cse14) (- (* (* 3 .cse13) .cse15))) .cse28) (- (* 10 .cse14))) (* 3 .cse15)) (- 10))) .cse29) (let ((.cse31 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse6 .cse7 .cse8 .cse9 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse30))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse31 .cse32)) .cse17 .cse18 .cse19 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse33)) .cse20 .cse21 .cse27 (= .cse34 .cse33) (= (+ .cse31 (* (+ .cse32 .cse30) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse29)) (and .cse1 .cse3 .cse6 (= |ULTIMATE.start_main_~x~0#1| 0) .cse35 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse36) (- .cse4)) .cse37) (- 10))) .cse9 .cse38 (= |ULTIMATE.start_main_~z~0#1| 6) .cse17 (= |ULTIMATE.start_main_~y~0#1| 1) .cse39 .cse20 .cse40 .cse21 .cse29) (let ((.cse53 (+ .cse55 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse52 (+ |ULTIMATE.start_main_~y~0#1| .cse54 .cse53))) (let ((.cse49 (+ |ULTIMATE.start_main_~y~0#1| (* .cse52 (- 1))))) (let ((.cse47 (+ |ULTIMATE.start_main_~y~0#1| .cse30)) (.cse41 (+ (* .cse49 (- 1)) .cse53 6))) (let ((.cse50 (+ .cse49 .cse41 (* .cse53 (- 1)))) (.cse46 (+ |ULTIMATE.start_main_~x~0#1| (* .cse47 (- 1))))) (and (= .cse41 0) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse6 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse42 (- 1)) 0) .cse43 .cse16 .cse17 (or .cse44 .cse45) .cse21 .cse27 (= .cse46 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| .cse33) .cse8 .cse9 (= .cse47 .cse48) .cse18 .cse20 (= (+ .cse49 (* .cse50 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse47)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse51)) (= .cse52 (+ 6 .cse50)) .cse29 (= .cse47 (+ .cse46 6)))))))) (let ((.cse59 (+ .cse55 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse56 (* 1 (- 1))) (.cse60 (+ |ULTIMATE.start_main_~y~0#1| .cse59 .cse54))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse56) 0) (= .cse34 (+ 6 (* 6 0))) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 6)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse34)) .cse43 .cse16 .cse17 .cse19 .cse21 (= |ULTIMATE.start_main_~n~0#1| .cse51) .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse48) .cse3 (= .cse34 6) (= (+ .cse56 |ULTIMATE.start_main_~x~0#1|) 0) .cse35 (= .cse42 0) .cse8 .cse9 .cse38 (= |ULTIMATE.start_main_~z~0#1| .cse57) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse58 .cse24) (- (* .cse24 .cse25))) (* 12 .cse24))) (not .cse44)) (= .cse59 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse60)) .cse20 .cse40 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse60 (- 1))) 1) .cse29)))))))) [2023-02-18 16:38:03,747 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 16:38:03,747 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 16:38:03,747 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-18 16:38:03,747 INFO L895 garLoopResultBuilder]: At program point L51(line 51) 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 (= |ULTIMATE.start_main_~y~0#1| 1) .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse3 (= |ULTIMATE.start_main_~z~0#1| 6)) (and (= .cse4 (+ 6 (* 6 0))) (= .cse4 6) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse4))))))) [2023-02-18 16:38:03,748 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse42 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse19 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse30 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse35 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse23 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse45 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse3 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse57 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse16 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse53 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse59 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse18 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse9 (+ .cse18 .cse17)) (.cse51 (= 0 (+ (+ (* .cse59 |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|)))) (.cse41 (= .cse18 (* (* .cse53 .cse53) .cse53))) (.cse1 (or (and .cse16 .cse5 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse5) (not .cse16)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse43 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse3) .cse57) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse24 (let ((.cse63 (= |ULTIMATE.start_main_~z~0#1| (+ .cse45 6)))) (or (let ((.cse62 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse61 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse62 (- 6)) 0))) (and (or (not .cse61) (<= 0 .cse35) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse62 (- 5)) 0))) (not .cse63) .cse23 (or .cse61 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse63))) (.cse38 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse60 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse60 |ULTIMATE.start_main_~n~0#1|) .cse60))))) (.cse44 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse40 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse42) (= 0 (+ (+ (* .cse59 .cse18) (- (* .cse18 .cse19))) (* 12 .cse18))) .cse30)) (.cse58 (+ 6 6))) (let ((.cse39 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse36 (+ 6 .cse58)) (.cse37 (* .cse58 (- 1))) (.cse28 (let ((.cse56 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse57) (- (* 6 |ULTIMATE.start_main_~z~0#1|))))))) (or (and .cse41 .cse1 .cse56 .cse43 .cse16 .cse24 .cse38 .cse5 .cse44 .cse51 .cse40) (and .cse41 .cse1 .cse56 .cse43 .cse16 .cse24 .cse38 .cse5 .cse44 .cse40)))) (.cse20 (- (* 18 .cse18))) (.cse21 (- (* 18 .cse9))) (.cse10 (+ .cse17 .cse19)) (.cse11 (+ 6 .cse19)) (.cse34 (+ |ULTIMATE.start_main_~y~0#1| (* .cse35 (- 1)))) (.cse55 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse0 (not (<= .cse55 |ULTIMATE.start_main_~a~0#1|))) (.cse2 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse4 (= 0 (+ 12 (+ (+ (* .cse35 .cse35) (- (* 12 .cse34))) (- (* 6 .cse35)))))) (.cse12 (<= (+ .cse55 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse13 (let ((.cse49 (let ((.cse54 (+ 6 (* 6 (+ 1 .cse53))))) (or (= 0 (+ (+ (+ (+ (* .cse10 .cse54) .cse21) (- (* 12 .cse10))) (* 2 .cse54)) (- 6))) (not (= .cse54 .cse11))))) (.cse50 (let ((.cse52 (+ 6 (* 6 .cse53)))) (or (= 0 (+ (+ (+ (+ (* .cse17 .cse52) .cse20) (- (* 12 .cse17))) (* 2 .cse52)) (- 6))) (not (= .cse52 .cse19)))))) (or (and .cse49 .cse1 .cse50 .cse43 .cse16 .cse5 .cse51 .cse28) (and .cse49 .cse1 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse50 .cse43 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse36)) .cse16 .cse5 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse37))) .cse28 .cse30 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))))) (.cse14 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse15 (or (let ((.cse46 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse46 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse46))) (let ((.cse47 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse48 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse47 (+ .cse48 32767)) .cse39 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse47 (+ .cse48 65535)))))) (.cse22 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse45))) (.cse29 (+ 1 0))) (or (and .cse0 .cse1 .cse2 (= 0 (+ (+ (+ (+ (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse3) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse4 .cse5 (= 0 (+ (let ((.cse8 (+ 6 .cse11))) (+ (let ((.cse6 (+ .cse10 .cse11))) (+ (let ((.cse7 (+ .cse9 .cse10))) (+ (+ (* (* 2 .cse6) .cse6) (- (* (* 3 .cse7) .cse8))) (- (* 18 .cse7)))) (- (* 10 .cse6)))) (* 3 .cse8))) (- 10))) .cse12 .cse13 .cse14 .cse15 .cse16 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse17) .cse17) (- (* (* 3 .cse18) .cse19))) .cse20) (- (* 10 .cse17))) (* 3 .cse19)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse10) .cse10) (- (* (* 3 .cse9) .cse11))) .cse21) (- (* 10 .cse10))) (* 3 .cse11)) (- 10))) .cse22) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse23 (= |ULTIMATE.start_main_~x~0#1| 0) .cse24 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse32 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse31 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse32))) (let ((.cse26 (+ |ULTIMATE.start_main_~y~0#1| (* .cse31 (- 1))))) (let ((.cse25 (+ (* .cse26 (- 1)) .cse32 6))) (let ((.cse27 (+ .cse26 .cse25 (* .cse32 (- 1))))) (and (= .cse25 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse5 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse16 (= (+ .cse26 (* .cse27 (- 1))) 1) .cse28 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse29)) .cse30 (= .cse31 (+ 6 .cse27)))))))) (let ((.cse33 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse33 .cse34)) .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse35 .cse36) (= (+ .cse33 (* (+ .cse34 .cse37) (- 1))) 1) .cse22)) (and .cse1 (= .cse35 (+ 6 (* 6 0))) (= .cse35 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse38 .cse5 .cse39 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse35)) .cse40 .cse41 (<= .cse42 1) .cse43 .cse16 (<= |ULTIMATE.start_main_~n~0#1| .cse29) .cse24 (= |ULTIMATE.start_main_~n~0#1| .cse29) .cse44 (= |ULTIMATE.start_main_~x~0#1| 1))))))) [2023-02-18 16:38:03,748 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 16:38:03,749 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse25 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse26 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse13 (+ .cse25 .cse24)) (.cse32 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse67 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse39 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse38 (+ 6 6)) (.cse36 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse50 (- .cse39)) (.cse23 (* 2 .cse24)) (.cse19 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse67) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse9 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse21 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse52 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse51 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse37 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse30 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse40 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse54 (= 0 (+ (+ (* .cse39 |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|)))) (.cse48 (+ |ULTIMATE.start_main_~y~0#1| (* .cse32 (- 1)))) (.cse33 (+ 1 0)) (.cse27 (- (* 18 .cse25))) (.cse29 (- (* 18 .cse13))) (.cse14 (+ .cse24 .cse26)) (.cse15 (+ 6 .cse26)) (.cse71 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse0 (let ((.cse73 (+ 6 (* 6 (+ 1 .cse71))))) (or (= 0 (+ (+ (+ (+ (* .cse14 .cse73) .cse29) (- (* 12 .cse14))) (* 2 .cse73)) (- 6))) (not (= .cse73 .cse15))))) (.cse7 (let ((.cse72 (+ 6 (* 6 .cse71)))) (or (= 0 (+ (+ (+ (+ (* .cse24 .cse72) .cse27) (- (* 12 .cse24))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse26))))) (.cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse4 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse43 (<= |ULTIMATE.start_main_~n~0#1| .cse33)) (.cse6 (= 0 (+ 12 (+ (+ (* .cse32 .cse32) (- (* 12 .cse48))) (- (* 6 .cse32)))))) (.cse16 (= .cse25 (* (* .cse71 .cse71) .cse71))) (.cse17 (or (not .cse30) .cse40 .cse54)) (.cse18 (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)) .cse37 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse69 (+ .cse70 65535)))))) (.cse20 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse5) .cse67) .cse51) (- 6)))) (.cse22 (let ((.cse65 (= |ULTIMATE.start_main_~z~0#1| (+ .cse66 6)))) (or (let ((.cse64 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse63 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 6)) 0))) (and (or (not .cse63) (<= 0 .cse32) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse52 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse28 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse1 (or (and .cse21 .cse9 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse21)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse2 (let ((.cse62 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse26) .cse50) (- .cse23)) (* 2 .cse26)) (- 10))) (not (<= .cse62 |ULTIMATE.start_main_~a~0#1|)) (not .cse19) (not (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (<= (+ 1 .cse62) |ULTIMATE.start_main_~a~0#1|)))) (.cse3 (<= .cse36 |ULTIMATE.start_main_~a~0#1|)) (.cse49 (+ 6 .cse38)) (.cse8 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse61 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse61 |ULTIMATE.start_main_~n~0#1|) .cse61))))) (.cse34 (+ 1 6)) (.cse46 (* .cse38 (- 1))) (.cse44 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse45 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 (+ (+ (+ (+ (+ (* .cse4 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse5) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse6 .cse7 .cse8 .cse9 (= 0 (+ (let ((.cse12 (+ 6 .cse15))) (+ (let ((.cse10 (+ .cse14 .cse15))) (+ (let ((.cse11 (+ .cse13 .cse14))) (+ (+ (* (* 2 .cse10) .cse10) (- (* (* 3 .cse11) .cse12))) (- (* 18 .cse11)))) (- (* 10 .cse10)))) (* 3 .cse12))) (- 10))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= 0 (+ (+ (+ (+ (+ (* .cse23 .cse24) (- (* (* 3 .cse25) .cse26))) .cse27) (- (* 10 .cse24))) (* 3 .cse26)) (- 10))) .cse28 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse14) .cse14) (- (* (* 3 .cse13) .cse15))) .cse29) (- (* 10 .cse14))) (* 3 .cse15)) (- 10))) .cse30) (let ((.cse41 (+ .cse45 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse31 (* 1 (- 1))) (.cse42 (+ |ULTIMATE.start_main_~y~0#1| .cse41 .cse44))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse31) 0) (= .cse32 (+ 6 (* 6 0))) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 6)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse32)) .cse16 .cse17 .cse18 .cse20 .cse22 (= |ULTIMATE.start_main_~n~0#1| .cse33) .cse28 .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse34) .cse3 (= .cse32 6) (= (+ .cse31 |ULTIMATE.start_main_~x~0#1|) 0) .cse35 (= .cse36 0) .cse8 .cse9 .cse37 (= |ULTIMATE.start_main_~z~0#1| .cse38) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse39 .cse25) (- (* .cse25 .cse26))) (* 12 .cse25))) (not .cse40)) (= .cse41 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse42)) .cse21 .cse43 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse42 (- 1))) 1) .cse30))) (let ((.cse47 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse6 .cse7 .cse8 .cse9 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse46))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse47 .cse48)) .cse16 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse49)) .cse21 .cse22 .cse28 (= .cse32 .cse49) (= (+ .cse47 (* (+ .cse48 .cse46) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse30)) (and .cse1 .cse3 .cse6 (= |ULTIMATE.start_main_~x~0#1| 0) .cse35 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse50) (- .cse4)) .cse51) (- 10))) .cse9 .cse37 (= |ULTIMATE.start_main_~z~0#1| 6) .cse18 (= |ULTIMATE.start_main_~y~0#1| 1) .cse52 .cse21 .cse43 .cse22 .cse30) (let ((.cse60 (+ .cse45 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| .cse44 .cse60))) (let ((.cse57 (+ |ULTIMATE.start_main_~y~0#1| (* .cse59 (- 1))))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse46)) (.cse53 (+ (* .cse57 (- 1)) .cse60 6))) (let ((.cse58 (+ .cse57 .cse53 (* .cse60 (- 1)))) (.cse55 (+ |ULTIMATE.start_main_~x~0#1| (* .cse56 (- 1))))) (and (= .cse53 0) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse6 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse36 (- 1)) 0) .cse16 .cse17 .cse18 .cse20 (or .cse40 .cse54) .cse22 .cse28 (= .cse55 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| .cse49) .cse8 .cse9 (= .cse56 .cse34) .cse19 .cse21 (= (+ .cse57 (* .cse58 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse56)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse33)) (= .cse59 (+ 6 .cse58)) .cse30 (= .cse56 (+ .cse55 6))))))))))))) [2023-02-18 16:38:03,750 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse25 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse26 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse13 (+ .cse25 .cse24)) (.cse35 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse67 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse58 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse45 (+ 1 0)) (.cse37 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse51 (- .cse58)) (.cse23 (* 2 .cse24)) (.cse19 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse67) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse9 (<= |ULTIMATE.start_main_~a~0#1| 20)) (.cse21 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse54 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse52 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse53 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse30 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse38 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse39 (= 0 (+ (+ (* .cse58 |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|)))) (.cse33 (+ |ULTIMATE.start_main_~y~0#1| (* .cse35 (- 1)))) (.cse57 (+ 6 6)) (.cse27 (- (* 18 .cse25))) (.cse29 (- (* 18 .cse13))) (.cse14 (+ .cse24 .cse26)) (.cse15 (+ 6 .cse26)) (.cse71 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse0 (let ((.cse73 (+ 6 (* 6 (+ 1 .cse71))))) (or (= 0 (+ (+ (+ (+ (* .cse14 .cse73) .cse29) (- (* 12 .cse14))) (* 2 .cse73)) (- 6))) (not (= .cse73 .cse15))))) (.cse7 (let ((.cse72 (+ 6 (* 6 .cse71)))) (or (= 0 (+ (+ (+ (+ (* .cse24 .cse72) .cse27) (- (* 12 .cse24))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse26))))) (.cse28 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse34 (+ 6 .cse57)) (.cse31 (* .cse57 (- 1))) (.cse4 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse6 (= 0 (+ 12 (+ (+ (* .cse35 .cse35) (- (* 12 .cse33))) (- (* 6 .cse35)))))) (.cse16 (= .cse25 (* (* .cse71 .cse71) .cse71))) (.cse17 (or (not .cse30) .cse38 .cse39)) (.cse18 (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)) .cse53 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse69 (+ .cse70 65535)))))) (.cse20 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse5) .cse67) .cse52) (- 6)))) (.cse22 (let ((.cse65 (= |ULTIMATE.start_main_~z~0#1| (+ .cse66 6)))) (or (let ((.cse64 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse63 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 6)) 0))) (and (or (not .cse63) (<= 0 .cse35) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse54 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse1 (or (and .cse21 .cse9 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (or (not .cse9) (not .cse21)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse2 (let ((.cse62 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (or (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| .cse26) .cse51) (- .cse23)) (* 2 .cse26)) (- 10))) (not (<= .cse62 |ULTIMATE.start_main_~a~0#1|)) (not .cse19) (not (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (<= (+ 1 .cse62) |ULTIMATE.start_main_~a~0#1|)))) (.cse42 (+ 1 6)) (.cse3 (<= .cse37 |ULTIMATE.start_main_~a~0#1|)) (.cse50 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse8 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse61 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse61 |ULTIMATE.start_main_~n~0#1|) .cse61))))) (.cse55 (<= |ULTIMATE.start_main_~n~0#1| .cse45)) (.cse48 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse49 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 (+ (+ (+ (+ (+ (* .cse4 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))) .cse5) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse6 .cse7 .cse8 .cse9 (= 0 (+ (let ((.cse12 (+ 6 .cse15))) (+ (let ((.cse10 (+ .cse14 .cse15))) (+ (let ((.cse11 (+ .cse13 .cse14))) (+ (+ (* (* 2 .cse10) .cse10) (- (* (* 3 .cse11) .cse12))) (- (* 18 .cse11)))) (- (* 10 .cse10)))) (* 3 .cse12))) (- 10))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= 0 (+ (+ (+ (+ (+ (* .cse23 .cse24) (- (* (* 3 .cse25) .cse26))) .cse27) (- (* 10 .cse24))) (* 3 .cse26)) (- 10))) .cse28 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse14) .cse14) (- (* (* 3 .cse13) .cse15))) .cse29) (- (* 10 .cse14))) (* 3 .cse15)) (- 10))) .cse30) (let ((.cse32 (+ (* |ULTIMATE.start_main_~y~0#1| 2) (* |ULTIMATE.start_main_~z~0#1| (- 2)) (- 18)))) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse6 .cse7 .cse8 .cse9 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse31))) (= |ULTIMATE.start_main_~x~0#1| (+ .cse32 .cse33)) .cse16 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse34)) .cse21 .cse22 .cse28 (= .cse35 .cse34) (= (+ .cse32 (* (+ .cse33 .cse31) (- 1))) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse30)) (let ((.cse47 (+ .cse49 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse46 (+ |ULTIMATE.start_main_~y~0#1| .cse48 .cse47))) (let ((.cse43 (+ |ULTIMATE.start_main_~y~0#1| (* .cse46 (- 1))))) (let ((.cse41 (+ |ULTIMATE.start_main_~y~0#1| .cse31)) (.cse36 (+ (* .cse43 (- 1)) .cse47 6))) (let ((.cse44 (+ .cse43 .cse36 (* .cse47 (- 1)))) (.cse40 (+ |ULTIMATE.start_main_~x~0#1| (* .cse41 (- 1))))) (and (= .cse36 0) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse6 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse37 (- 1)) 0) .cse16 .cse17 .cse18 (or .cse38 .cse39) .cse22 .cse28 (= .cse40 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~z~0#1| .cse34) .cse8 .cse9 (= .cse41 .cse42) .cse19 .cse21 (= (+ .cse43 (* .cse44 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse41)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse45)) (= .cse46 (+ 6 .cse44)) .cse30 (= .cse41 (+ .cse40 6)))))))) (and .cse1 .cse3 .cse6 (= |ULTIMATE.start_main_~x~0#1| 0) .cse50 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) .cse51) (- .cse4)) .cse52) (- 10))) .cse9 .cse53 (= |ULTIMATE.start_main_~z~0#1| 6) .cse18 (= |ULTIMATE.start_main_~y~0#1| 1) .cse54 .cse21 .cse55 .cse22 .cse30) (let ((.cse59 (+ .cse49 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse56 (* 1 (- 1))) (.cse60 (+ |ULTIMATE.start_main_~y~0#1| .cse59 .cse48))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse56) 0) (= .cse35 (+ 6 (* 6 0))) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 6)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse35)) .cse16 .cse17 .cse18 .cse20 .cse22 (= |ULTIMATE.start_main_~n~0#1| .cse45) .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse42) .cse3 (= .cse35 6) (= (+ .cse56 |ULTIMATE.start_main_~x~0#1|) 0) .cse50 (= .cse37 0) .cse8 .cse9 .cse53 (= |ULTIMATE.start_main_~z~0#1| .cse57) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse58 .cse25) (- (* .cse25 .cse26))) (* 12 .cse25))) (not .cse38)) (= .cse59 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse60)) .cse21 .cse55 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse60 (- 1))) 1) .cse30)))))))) [2023-02-18 16:38:03,751 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 16:38:03,751 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 16:38:03,751 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 16:38:03,751 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 16:38:03,751 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 16:38:03,751 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 16:38:03,754 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 16:38:03,756 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 16:38:03,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:38:03 BoogieIcfgContainer [2023-02-18 16:38:03,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 16:38:03,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 16:38:03,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 16:38:03,816 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 16:38:03,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:37:06" (3/4) ... [2023-02-18 16:38:03,818 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 16:38:03,823 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 16:38:03,827 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 16:38:03,827 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 16:38:03,828 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 16:38:03,828 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 16:38:03,864 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 16:38:03,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 16:38:03,866 INFO L158 Benchmark]: Toolchain (without parser) took 58032.97ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 107.2MB in the beginning and 150.0MB in the end (delta: -42.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:38:03,867 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:38:03,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.66ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 96.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:38:03,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.27ms. Allocated memory is still 153.1MB. Free memory was 96.3MB in the beginning and 94.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 16:38:03,868 INFO L158 Benchmark]: Boogie Preprocessor took 17.44ms. Allocated memory is still 153.1MB. Free memory was 94.7MB in the beginning and 93.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:38:03,868 INFO L158 Benchmark]: RCFGBuilder took 231.44ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 82.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:38:03,868 INFO L158 Benchmark]: TraceAbstraction took 57438.93ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 81.8MB in the beginning and 153.2MB in the end (delta: -71.4MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2023-02-18 16:38:03,869 INFO L158 Benchmark]: Witness Printer took 48.97ms. Allocated memory is still 184.5MB. Free memory was 153.2MB in the beginning and 150.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 16:38:03,875 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.17ms. Allocated memory is still 153.1MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.66ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 96.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.27ms. Allocated memory is still 153.1MB. Free memory was 96.3MB in the beginning and 94.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.44ms. Allocated memory is still 153.1MB. Free memory was 94.7MB in the beginning and 93.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 231.44ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 82.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 57438.93ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 81.8MB in the beginning and 153.2MB in the end (delta: -71.4MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * Witness Printer took 48.97ms. Allocated memory is still 184.5MB. Free memory was 153.2MB in the beginning and 150.0MB 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.3s, OverallIterations: 14, TraceHistogramMax: 24, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 28.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 1132 SdHoareTripleChecker+Invalid, 28.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75 IncrementalHoareTripleChecker+Unchecked, 753 mSDsCounter, 513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4047 IncrementalHoareTripleChecker+Invalid, 4643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 513 mSolverCounterUnsat, 379 mSDtfsCounter, 4047 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1658 GetRequests, 1428 SyntacticMatches, 25 SemanticMatches, 205 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 74 PreInvPairs, 130 NumberOfFragments, 31405 HoareAnnotationTreeSize, 74 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 871 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1529 ConstructedInterpolants, 0 QuantifiedInterpolants, 14416 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1837 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 8052/8766 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == a * (6 + z) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + z) + -10 || !(-z / -6 + -1 <= a)) || !(0 == 12 + (z * z + -(12 * y) + -(6 * z)))) || !(z * 5 % 6 == 0)) || 1 + (-z / -6 + -1) <= a) && (((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0))) && n + -1 <= a) && 2 <= a) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && (((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 20) && 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))))) || ((((((((((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0)) && (!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6)) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 20) && 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))))))) && a <= 20) && x + 19 * -1 == 1 + (19 + (6 + 6) * -1)) && x == y * 2 + z * -2 + -18 + (y + (z + -6) * -1)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && z == 6 + (6 + (6 + 6))) && a >= 0) && z + -6 == 6 + (6 + 6)) && y * 2 + z * -2 + -18 + (y + (z + -6) * -1 + (6 + 6) * -1) * -1 == 1) && n <= 1 + 2) && z == 6 + 6 * n) || ((((((((((((((((((((((((((((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6 == 0 && y == 1 + (12 + -6) + 12) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && n == 1 + 1) && 1 <= a) && n + -1 + -1 == 0) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && (n <= a || 0 == 6 * a * x + -(x * z) + 12 * x)) && x == n * n * n) && x + (y + (6 + 6) * -1) * -1 == 1) && z == 6 + 12) && (((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0))) && ((((0 == a * (6 + z) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + z) + -10 || !(-z / -6 + -1 <= a)) || !(0 == 12 + (z * z + -(12 * y) + -(6 * z)))) || !(z * 5 % 6 == 0)) || 1 + (-z / -6 + -1) <= a)) && n + -1 <= a) && z == 6 + (6 + 6)) && a <= 20) && ((((((((!(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 + (6 + 6) * -1 == 1 + 6) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && a >= 0) && y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + (y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + ((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6) + (y * -1 + x + z + -6) * -1) * -1 == 1) && (!(z == 6 + 6 * n) || x + y == (1 + n) * (1 + n) * (1 + n))) && x == 1 + (y + (6 + 6) * -1)) && n == 1 + (1 + 0)) && y + x * -1 + (y * -1 + x + z + -6) == 6 + (y + (y + x * -1 + (y * -1 + x + z + -6)) * -1 + ((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6) + (y * -1 + x + z + -6) * -1)) && z == 6 + 6 * n) && y + (6 + 6) * -1 == x + (y + (6 + 6) * -1) * -1 + 6)) || (((((((((((((((((0 == a * (6 + z) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + z) + -10 || !(-z / -6 + -1 <= a)) || !(0 == 12 + (z * z + -(12 * y) + -(6 * z)))) || !(z * 5 % 6 == 0)) || 1 + (-z / -6 + -1) <= a) && (((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0))) && n + -1 <= a) && 0 == 2 * y * y + -(3 * x * z) + -(18 * x) + -(10 * y) + 3 * z + -10) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && ((((((((((0 == (y + z + (6 + z)) * (6 + 6 * (1 + (1 + n))) + -(18 * (x + y + (y + z))) + -(12 * (y + z + (6 + z))) + 2 * (6 + 6 * (1 + (1 + n))) + -6 || !(6 + 6 * (1 + (1 + n)) == 6 + (6 + z))) && (((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0))) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && a >= 0) && a <= 20) && 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))))) || ((((((((((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0)) && (!(z == 6 + 6 * n) || 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6)) && 0 == 12 + (z * z + -(12 * y) + -(6 * z))) && (0 == (y + z) * (6 + 6 * (1 + n)) + -(18 * (x + y)) + -(12 * (y + z)) + 2 * (6 + 6 * (1 + n)) + -6 || !(6 + 6 * (1 + n) == 6 + z))) && a >= 0) && a <= 20) && 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))))))) && a <= 20) && 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) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && a >= 0) && 0 == 2 * (y + z) * (y + z) + -(3 * (x + y) * (6 + z)) + -(18 * (x + y)) + -(10 * (y + z)) + 3 * (6 + z) + -10) && 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)) || ((((((((((((((((((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0)) && n + -1 <= a) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && x == 0) && z == 6 + (y + -1)) && 0 == a * z + -(6 * a) + -(2 * y) + 2 * z + -10) && a <= 20) && 0 <= a) && z == 6) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && y == 1) && n == 0) && a >= 0) && n <= 1 + 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)) && z == 6 + 6 * n)) || (((((((((((((((((((((((((((((x + 1 * -1 == 0 && z + -6 == 6 + 6 * 0) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && y == x + 6) && y == 1 + (z + -6)) && x + y == (1 + n) * (1 + n) * (1 + n)) && ((!(z == 6 + 6 * n) || n <= a) || 0 == 6 * a * x + -(x * z) + 12 * x)) && (((a + 65536 < 65536 && !(a % 65536 <= 32767)) && 0 <= a + 65536) || ((((-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 32767 && 0 <= a) && a < 65536) && (-a + -1) / 65536 * 65536 + 65536 <= a * -1 + 65535))) && 0 == y * z + -(18 * x) + -(12 * y) + 2 * z + -6) && n == 1 + 0) && (((a >= 0 && a <= 20) && cond == 1) || ((!(a <= 20) || !(a >= 0)) && cond == 0))) && ((((0 == a * (6 + z) + -(6 * a) + -(2 * (y + z)) + 2 * (6 + z) + -10 || !(-z / -6 + -1 <= a)) || !(0 == 12 + (z * z + -(12 * y) + -(6 * z)))) || !(z * 5 % 6 == 0)) || 1 + (-z / -6 + -1) <= a)) && y == 1 + 6) && n + -1 <= a) && z + -6 == 6) && 1 * -1 + x == 0) && z == 6 + (y + -1)) && n + -1 == 0) && a <= 20) && 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) && ((n + 1 < a + 1 || 0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || !(n <= a))) && y * -1 + x + 6 == 0) && z == 6 + (y + (y * -1 + x + 6) + x * -1)) && a >= 0) && n <= 1 + 0) && x == 1) && y + (y + (y * -1 + x + 6) + x * -1) * -1 == 1) && z == 6 + 6 * n) RESULT: Ultimate proved your program to be correct! [2023-02-18 16:38:03,907 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