./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.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_valuebound10.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 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 06:52:41,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:52:41,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:52:41,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:52:41,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:52:41,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:52:41,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:52:41,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:52:41,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:52:41,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:52:41,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:52:41,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:52:41,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:52:41,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:52:41,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:52:41,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:52:41,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:52:41,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:52:41,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:52:41,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:52:41,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:52:41,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:52:41,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:52:41,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:52:41,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:52:41,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:52:41,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:52:41,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:52:41,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:52:41,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:52:41,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:52:41,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:52:41,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:52:41,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:52:41,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:52:41,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:52:41,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:52:41,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:52:41,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:52:41,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:52:41,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:52:41,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:52:41,456 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:52:41,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:52:41,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:52:41,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:52:41,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:52:41,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:52:41,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:52:41,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:52:41,463 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:52:41,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:52:41,463 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:52:41,464 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:52:41,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:52:41,465 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:52:41,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:52:41,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:52:41,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:52:41,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:52:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:52:41,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:52:41,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:52:41,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:52:41,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:52:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:52:41,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:52:41,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:52:41,467 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:52:41,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:52:41,467 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:52:41,467 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 -> 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a [2023-02-17 06:52:41,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:52:41,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:52:41,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:52:41,691 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:52:41,691 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:52:41,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2023-02-17 06:52:42,656 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:52:42,805 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:52:42,806 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2023-02-17 06:52:42,810 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aec4466/8c90c3a9095744b0bf3cf61b0fab0ace/FLAGaa2a981d7 [2023-02-17 06:52:42,823 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aec4466/8c90c3a9095744b0bf3cf61b0fab0ace [2023-02-17 06:52:42,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:52:42,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:52:42,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:52:42,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:52:42,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:52:42,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:42,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b6a69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42, skipping insertion in model container [2023-02-17 06:52:42,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:42,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:52:42,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:52:42,947 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_valuebound10.c[588,601] [2023-02-17 06:52:42,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:52:42,968 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:52:42,975 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_valuebound10.c[588,601] [2023-02-17 06:52:42,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:52:42,990 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:52:42,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42 WrapperNode [2023-02-17 06:52:42,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:52:42,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:52:42,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:52:42,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:52:42,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,010 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-17 06:52:43,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:52:43,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:52:43,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:52:43,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:52:43,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,021 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:52:43,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:52:43,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:52:43,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:52:43,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (1/1) ... [2023-02-17 06:52:43,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:52:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:43,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 06:52:43,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 06:52:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:52:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:52:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:52:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:52:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 06:52:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 06:52:43,112 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:52:43,113 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:52:43,211 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:52:43,215 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:52:43,215 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 06:52:43,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:52:43 BoogieIcfgContainer [2023-02-17 06:52:43,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:52:43,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:52:43,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:52:43,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:52:43,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:52:42" (1/3) ... [2023-02-17 06:52:43,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e019c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:52:43, skipping insertion in model container [2023-02-17 06:52:43,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:52:42" (2/3) ... [2023-02-17 06:52:43,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e019c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:52:43, skipping insertion in model container [2023-02-17 06:52:43,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:52:43" (3/3) ... [2023-02-17 06:52:43,222 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound10.c [2023-02-17 06:52:43,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:52:43,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 06:52:43,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:52:43,264 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;@b968244, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:52:43,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 06:52:43,267 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-17 06:52:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 06:52:43,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:43,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:52:43,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-17 06:52:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357857817] [2023-02-17 06:52:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:52:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357857817] [2023-02-17 06:52:43,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357857817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:52:43,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:52:43,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 06:52:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356883082] [2023-02-17 06:52:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:52:43,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 06:52:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 06:52:43,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 06:52:43,421 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-17 06:52:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:43,446 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-17 06:52:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 06:52:43,448 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-17 06:52:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:43,454 INFO L225 Difference]: With dead ends: 51 [2023-02-17 06:52:43,454 INFO L226 Difference]: Without dead ends: 23 [2023-02-17 06:52:43,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 06:52:43,461 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-17 06:52:43,461 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-17 06:52:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-17 06:52:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 06:52:43,484 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-17 06:52:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-17 06:52:43,486 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-17 06:52:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:43,486 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-17 06:52:43,486 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-17 06:52:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-17 06:52:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 06:52:43,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:43,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:52:43,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 06:52:43,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-17 06:52:43,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178325696] [2023-02-17 06:52:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:52:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:43,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178325696] [2023-02-17 06:52:43,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178325696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:52:43,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:52:43,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:52:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232080641] [2023-02-17 06:52:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:52:43,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:52:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:52:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:52:43,626 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-17 06:52:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:43,729 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-17 06:52:43,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 06:52:43,729 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-17 06:52:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:43,730 INFO L225 Difference]: With dead ends: 29 [2023-02-17 06:52:43,730 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 06:52:43,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 06:52:43,731 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-17 06:52:43,731 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-17 06:52:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 06:52:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 06:52:43,740 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-17 06:52:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-17 06:52:43,741 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-17 06:52:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:43,742 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-17 06:52:43,742 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-17 06:52:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-17 06:52:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 06:52:43,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:43,742 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:52:43,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 06:52:43,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-17 06:52:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367952049] [2023-02-17 06:52:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:43,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818937639] [2023-02-17 06:52:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:43,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:43,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 06:52:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:43,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 06:52:43,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:52:43,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:52:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:43,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367952049] [2023-02-17 06:52:43,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:43,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818937639] [2023-02-17 06:52:43,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818937639] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:43,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:43,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:52:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81702345] [2023-02-17 06:52:43,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:43,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:52:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:43,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:52:43,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:52:43,969 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-17 06:52:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:44,377 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-17 06:52:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 06:52:44,377 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-17 06:52:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:44,379 INFO L225 Difference]: With dead ends: 52 [2023-02-17 06:52:44,379 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 06:52:44,380 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-17 06:52:44,380 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 19 mSolverCounterUnsat, 1 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, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:44,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 06:52:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 06:52:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-17 06:52:44,394 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-17 06:52:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-17 06:52:44,398 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-17 06:52:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:44,399 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-17 06:52:44,399 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-17 06:52:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-17 06:52:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 06:52:44,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:44,400 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:52:44,407 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-17 06:52:44,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:44,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:44,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-17 06:52:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:44,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463469555] [2023-02-17 06:52:44,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:44,622 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:44,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082960140] [2023-02-17 06:52:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:44,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:44,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:44,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:44,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 06:52:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:44,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 06:52:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 06:52:44,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 06:52:44,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:44,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463469555] [2023-02-17 06:52:44,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:44,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082960140] [2023-02-17 06:52:44,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082960140] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:44,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:44,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:52:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278112067] [2023-02-17 06:52:44,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:44,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:52:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:44,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:52:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:52:44,761 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-17 06:52:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:44,972 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-17 06:52:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 06:52:44,973 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-17 06:52:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:44,973 INFO L225 Difference]: With dead ends: 54 [2023-02-17 06:52:44,973 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 06:52:44,974 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-17 06:52:44,974 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-17 06:52:44,975 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-17 06:52:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 06:52:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-17 06:52:44,985 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-17 06:52:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-17 06:52:44,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-17 06:52:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:44,986 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-17 06:52:44,986 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-17 06:52:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-17 06:52:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 06:52:44,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:44,987 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:52:44,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-17 06:52:45,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-17 06:52:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:45,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374896035] [2023-02-17 06:52:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:45,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:45,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839649025] [2023-02-17 06:52:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:45,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:45,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:45,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:45,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 06:52:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:45,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 06:52:45,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 06:52:45,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 06:52:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374896035] [2023-02-17 06:52:45,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839649025] [2023-02-17 06:52:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839649025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:45,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:45,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:52:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474369431] [2023-02-17 06:52:45,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:45,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:52:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:52:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:52:45,395 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-17 06:52:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:45,976 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-17 06:52:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 06:52:45,976 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-17 06:52:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:45,977 INFO L225 Difference]: With dead ends: 67 [2023-02-17 06:52:45,977 INFO L226 Difference]: Without dead ends: 58 [2023-02-17 06:52:45,977 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-17 06:52:45,978 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:45,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 06:52:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-17 06:52:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-17 06:52:45,992 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-17 06:52:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-17 06:52:45,993 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-17 06:52:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:45,993 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-17 06:52:45,993 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-17 06:52:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-17 06:52:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 06:52:45,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:45,995 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-17 06:52:46,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:46,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:46,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-17 06:52:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:46,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82970261] [2023-02-17 06:52:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:46,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284334074] [2023-02-17 06:52:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:46,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:46,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 06:52:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:46,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 06:52:46,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 06:52:46,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 06:52:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82970261] [2023-02-17 06:52:46,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:46,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284334074] [2023-02-17 06:52:46,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284334074] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:46,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:46,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-17 06:52:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390557484] [2023-02-17 06:52:46,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:46,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 06:52:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 06:52:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:52:46,396 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-17 06:52:49,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:52:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:50,136 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-17 06:52:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 06:52:50,139 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-17 06:52:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:50,139 INFO L225 Difference]: With dead ends: 82 [2023-02-17 06:52:50,140 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 06:52:50,140 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-17 06:52:50,140 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.7s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:50,141 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.7s Time] [2023-02-17 06:52:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 06:52:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-17 06:52:50,154 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-17 06:52:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-17 06:52:50,155 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-17 06:52:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:50,155 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-17 06:52:50,155 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-17 06:52:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-17 06:52:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 06:52:50,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:50,156 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-17 06:52:50,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:50,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:50,363 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-17 06:52:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:50,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490747783] [2023-02-17 06:52:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:50,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:50,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790331016] [2023-02-17 06:52:50,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:52:50,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:50,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:50,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 06:52:50,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:52:50,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:52:50,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 06:52:50,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-17 06:52:50,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-17 06:52:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490747783] [2023-02-17 06:52:50,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790331016] [2023-02-17 06:52:50,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790331016] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:50,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:50,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2023-02-17 06:52:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784347398] [2023-02-17 06:52:50,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 06:52:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 06:52:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-17 06:52:50,513 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-17 06:52:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:51,192 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-17 06:52:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 06:52:51,192 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-17 06:52:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:51,193 INFO L225 Difference]: With dead ends: 86 [2023-02-17 06:52:51,193 INFO L226 Difference]: Without dead ends: 81 [2023-02-17 06:52:51,194 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-17 06:52:51,194 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:51,194 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.6s Time] [2023-02-17 06:52:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-17 06:52:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-17 06:52:51,207 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-17 06:52:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-17 06:52:51,208 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-17 06:52:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:51,208 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-17 06:52:51,208 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-17 06:52:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-17 06:52:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 06:52:51,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:51,209 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-17 06:52:51,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:51,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:51,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-17 06:52:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:51,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358553926] [2023-02-17 06:52:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:51,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444980281] [2023-02-17 06:52:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:51,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:51,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 06:52:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:51,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 06:52:51,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:51,524 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-17 06:52:51,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:51,645 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-17 06:52:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:51,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358553926] [2023-02-17 06:52:51,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:51,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444980281] [2023-02-17 06:52:51,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444980281] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:51,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:51,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-17 06:52:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233889522] [2023-02-17 06:52:51,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:51,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 06:52:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 06:52:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:52:51,648 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-17 06:52:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:52,122 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-17 06:52:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 06:52:52,123 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-17 06:52:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:52,124 INFO L225 Difference]: With dead ends: 95 [2023-02-17 06:52:52,124 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 06:52:52,124 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-17 06:52:52,124 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:52,125 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.4s Time] [2023-02-17 06:52:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 06:52:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-17 06:52:52,144 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-17 06:52:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-17 06:52:52,145 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-17 06:52:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:52,145 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-17 06:52:52,145 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-17 06:52:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-17 06:52:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 06:52:52,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:52,146 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-17 06:52:52,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 06:52:52,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:52,351 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-17 06:52:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:52,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593376753] [2023-02-17 06:52:52,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:52,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:52,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345890918] [2023-02-17 06:52:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:52,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:52,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 06:52:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:52:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 06:52:52,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:52,450 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-17 06:52:52,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593376753] [2023-02-17 06:52:52,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345890918] [2023-02-17 06:52:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345890918] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 06:52:52,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 06:52:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 06:52:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928790929] [2023-02-17 06:52:52,582 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:52,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 06:52:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 06:52:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:52:52,583 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-17 06:52:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:52,746 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-17 06:52:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 06:52:52,747 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-17 06:52:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:52,748 INFO L225 Difference]: With dead ends: 97 [2023-02-17 06:52:52,748 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 06:52:52,748 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-17 06:52:52,748 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-17 06:52:52,748 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-17 06:52:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 06:52:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-17 06:52:52,764 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-17 06:52:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-17 06:52:52,773 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-17 06:52:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:52,774 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-17 06:52:52,774 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-17 06:52:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-17 06:52:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-17 06:52:52,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:52,776 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-17 06:52:52,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:52,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-17 06:52:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:52,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285332832] [2023-02-17 06:52:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:52,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356774679] [2023-02-17 06:52:52,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 06:52:52,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:52,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:52,998 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:53,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 06:52:53,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 06:52:53,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:52:53,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 06:52:53,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-17 06:52:53,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-17 06:52:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285332832] [2023-02-17 06:52:53,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356774679] [2023-02-17 06:52:53,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356774679] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:53,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:53,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 06:52:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538400430] [2023-02-17 06:52:53,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:53,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 06:52:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 06:52:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-17 06:52:53,241 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-17 06:52:56,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:52:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:56,495 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-17 06:52:56,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 06:52:56,495 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-17 06:52:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:56,496 INFO L225 Difference]: With dead ends: 110 [2023-02-17 06:52:56,496 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 06:52:56,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-17 06:52:56,497 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:56,497 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.1s Time] [2023-02-17 06:52:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 06:52:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-17 06:52:56,515 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-17 06:52:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-17 06:52:56,516 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-17 06:52:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:56,516 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-17 06:52:56,517 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-17 06:52:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-17 06:52:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-17 06:52:56,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:56,518 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-17 06:52:56,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:56,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 06:52:56,722 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-17 06:52:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:56,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330528477] [2023-02-17 06:52:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:56,738 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445738588] [2023-02-17 06:52:56,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:52:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:56,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:56,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:56,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 06:52:56,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:52:56,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:52:56,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 06:52:56,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:56,849 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-17 06:52:56,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330528477] [2023-02-17 06:52:57,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445738588] [2023-02-17 06:52:57,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445738588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 06:52:57,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 06:52:57,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 06:52:57,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838824011] [2023-02-17 06:52:57,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:57,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 06:52:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 06:52:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-17 06:52:57,075 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-17 06:52:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:52:57,391 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-17 06:52:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 06:52:57,396 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-17 06:52:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:52:57,397 INFO L225 Difference]: With dead ends: 111 [2023-02-17 06:52:57,397 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 06:52:57,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-02-17 06:52:57,397 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.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:52:57,398 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.2s Time] [2023-02-17 06:52:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 06:52:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-17 06:52:57,417 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-17 06:52:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-17 06:52:57,417 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 99 [2023-02-17 06:52:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:52:57,418 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-17 06:52:57,418 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-17 06:52:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-17 06:52:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 06:52:57,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:52:57,419 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-17 06:52:57,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 06:52:57,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:57,624 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:52:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:52:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-17 06:52:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:52:57,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318211567] [2023-02-17 06:52:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:52:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:52:57,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:52:57,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564598069] [2023-02-17 06:52:57,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 06:52:57,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:52:57,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:52:57,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:52:57,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 06:52:57,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 06:52:57,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:52:57,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 06:52:57,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:52:57,776 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-17 06:52:57,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:57,926 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-17 06:52:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:52:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318211567] [2023-02-17 06:52:57,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:52:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564598069] [2023-02-17 06:52:57,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564598069] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:52:57,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:52:57,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-17 06:52:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677067499] [2023-02-17 06:52:57,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:52:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 06:52:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:52:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 06:52:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-02-17 06:52:57,930 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-17 06:53:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:53:00,239 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2023-02-17 06:53:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 06:53:00,240 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-17 06:53:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:53:00,240 INFO L225 Difference]: With dead ends: 123 [2023-02-17 06:53:00,241 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 06:53:00,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-02-17 06:53:00,241 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:53:00,241 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.1s Time] [2023-02-17 06:53:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 06:53:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2023-02-17 06:53:00,262 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-17 06:53:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2023-02-17 06:53:00,262 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 121 [2023-02-17 06:53:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:53:00,262 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2023-02-17 06:53:00,263 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-17 06:53:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2023-02-17 06:53:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-17 06:53:00,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:53:00,264 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-17 06:53:00,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 06:53:00,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-17 06:53:00,469 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:53:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:53:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2023-02-17 06:53:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:53:00,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048006201] [2023-02-17 06:53:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:53:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:53:00,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:53:00,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176429343] [2023-02-17 06:53:00,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 06:53:00,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:53:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:53:00,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:53:00,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 06:53:00,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 06:53:00,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 06:53:00,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 06:53:00,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:53:01,030 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-17 06:53:01,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:53:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-02-17 06:53:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:53:02,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048006201] [2023-02-17 06:53:02,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:53:02,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176429343] [2023-02-17 06:53:02,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176429343] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:53:02,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:53:02,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2023-02-17 06:53:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387818991] [2023-02-17 06:53:02,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:53:02,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 06:53:02,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:53:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 06:53:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-17 06:53:02,019 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2023-02-17 06:53:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:53:02,933 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-02-17 06:53:02,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 06:53:02,938 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) Word has length 126 [2023-02-17 06:53:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:53:02,939 INFO L225 Difference]: With dead ends: 124 [2023-02-17 06:53:02,939 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 06:53:02,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-02-17 06:53:02,941 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 06:53:02,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 57 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 06:53:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 06:53:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-17 06:53:02,972 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-17 06:53:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-02-17 06:53:02,972 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 126 [2023-02-17 06:53:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:53:02,973 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-02-17 06:53:02,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2023-02-17 06:53:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-02-17 06:53:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-17 06:53:02,975 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:53:02,975 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-17 06:53:02,982 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-17 06:53:03,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 06:53:03,181 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:53:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:53:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954085, now seen corresponding path program 1 times [2023-02-17 06:53:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:53:03,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067689244] [2023-02-17 06:53:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:53:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:53:03,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:53:03,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202147476] [2023-02-17 06:53:03,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:53:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:53:03,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:53:03,189 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-17 06:53:03,190 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-17 06:53:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:53:03,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-17 06:53:03,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:53:03,316 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-17 06:53:03,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:53:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 47 proven. 163 refuted. 4 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-17 06:53:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:53:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067689244] [2023-02-17 06:53:11,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:53:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202147476] [2023-02-17 06:53:11,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202147476] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:53:11,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:53:11,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-17 06:53:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099382286] [2023-02-17 06:53:11,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:53:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 06:53:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:53:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 06:53:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=265, Unknown=3, NotChecked=0, Total=342 [2023-02-17 06:53:11,812 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-17 06:53:17,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:19,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:24,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:26,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:28,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:30,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:32,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:34,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:36,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:38,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:40,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:49,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:52,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:54,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:56,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:58,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:53:58,251 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-02-17 06:53:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 06:53:58,251 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-17 06:53:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:53:58,252 INFO L225 Difference]: With dead ends: 123 [2023-02-17 06:53:58,252 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 06:53:58,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 240 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=102, Invalid=356, Unknown=4, NotChecked=0, Total=462 [2023-02-17 06:53:58,254 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 45 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2023-02-17 06:53:58,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 112 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 568 Invalid, 16 Unknown, 0 Unchecked, 34.9s Time] [2023-02-17 06:53:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 06:53:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 06:53:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:53:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 06:53:58,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2023-02-17 06:53:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:53:58,255 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 06:53:58,255 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-17 06:53:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 06:53:58,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 06:53:58,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 06:53:58,262 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-17 06:53:58,457 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-17 06:53:58,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 06:53:58,484 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 06:53:58,485 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse74 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse18 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse40 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse27 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse74))) (.cse1 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse50 (let ((.cse73 (= |ULTIMATE.start_main_~z~0#1| (+ .cse74 6)))) (or (let ((.cse72 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse71 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse72 (- 6)) 0))) (and (or (not .cse71) (<= 0 .cse1) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse72 (- 5)) 0))) (not .cse73) .cse49 (or .cse71 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse73))) (.cse58 (not .cse27)) (.cse32 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse48 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse70 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse22 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse25 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse36 (+ .cse18 .cse40)) (.cse17 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse3 (* (* 0 0) 0)) (.cse29 (* 6 (- 1))) (.cse16 (+ 6 6)) (.cse13 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse14 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse52 (= 0 (+ (+ (* .cse17 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse9 (+ 1 0)) (.cse42 (- (* 18 .cse36))) (.cse37 (+ .cse40 .cse19)) (.cse38 (+ 6 .cse19)) (.cse21 (or (and .cse22 .cse25 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse22) (not .cse25))))) (.cse55 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse70) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse32) .cse70) .cse48) (- 6)))) (.cse53 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse15 (let ((.cse68 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse69 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse69 |ULTIMATE.start_main_~n~0#1|) .cse69)))))) (or (and .cse50 .cse68) (and .cse50 (or .cse58 .cse68))))) (.cse41 (- (* 18 .cse18))) (.cse61 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse39 (let ((.cse65 (let ((.cse67 (+ 6 (* 6 .cse61)))) (or (= 0 (+ (+ (+ (+ (* .cse40 .cse67) .cse41) (- (* 12 .cse40))) (* 2 .cse67)) (- 6))) (not (= .cse67 .cse19)))))) (or (and .cse21 .cse22 (or .cse58 .cse8) .cse55 .cse65 .cse25 .cse53 .cse15) (and (let ((.cse66 (+ 6 (* 6 (+ 1 .cse61))))) (or (= 0 (+ (+ (+ (+ (* .cse37 .cse66) .cse42) (- (* 12 .cse37))) (* 2 .cse66)) (- 6))) (not (= .cse66 .cse38)))) .cse21 .cse22 .cse55 .cse65 .cse8 .cse25 .cse53 .cse15)))) (.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse31 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse26 (<= |ULTIMATE.start_main_~n~0#1| .cse9)) (.cse2 (= 0 (+ 12 (+ (+ (* .cse1 .cse1) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse1 (- 1)))))) (- (* 6 .cse1)))))) (.cse6 (or .cse58 .cse20 .cse52)) (.cse7 (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)) .cse14 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse63 (+ .cse64 65535)))))) (.cse11 (<= .cse13 |ULTIMATE.start_main_~a~0#1|)) (.cse45 (+ 6 .cse16)) (.cse10 (+ 1 6)) (.cse5 (= .cse18 (* (* .cse61 .cse61) .cse61))) (.cse46 (* 7 (- 1))) (.cse47 (+ .cse3 (+ 7 .cse29))) (.cse43 (* .cse16 (- 1))) (.cse28 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse30 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (let ((.cse23 (+ .cse30 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse4 (+ |ULTIMATE.start_main_~y~0#1| .cse29)) (.cse0 (* 1 (- 1))) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| .cse23 .cse28))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse0) 0) (= .cse1 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~x~0#1| (+ .cse3 .cse4)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse1)) (= .cse4 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~n~0#1| .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse11 (= .cse1 6) (= (+ .cse0 |ULTIMATE.start_main_~x~0#1|) 0) .cse12 (= .cse13 0) .cse14 .cse15 (= |ULTIMATE.start_main_~z~0#1| .cse16) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse17 .cse18) (- (* .cse18 .cse19))) (* 12 .cse18))) (not .cse20)) .cse21 .cse22 (= .cse23 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse24)) .cse25 .cse26 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse24 (- 1))) 1) .cse27))) (and .cse11 (= 0 (+ (+ (+ (+ (+ (* .cse31 |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))) .cse2 (= 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))) .cse6 .cse21 .cse22 .cse7 .cse39 .cse25 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse40) .cse40) (- (* (* 3 .cse18) .cse19))) .cse41) (- (* 10 .cse40))) (* 3 .cse19)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse37) .cse37) (- (* (* 3 .cse36) .cse38))) .cse42) (- (* 10 .cse37))) (* 3 .cse38)) (- 10))) .cse27) (let ((.cse44 (+ 7 (+ 18 (- 6))))) (and .cse11 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse2 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse43))) (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 18)) .cse21 .cse22 .cse7 .cse39 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse45)) .cse25 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse44 (- 1))) .cse46) .cse47) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse27)) (and .cse11 .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse12 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse17)) (- .cse31)) .cse48) (- 10))) .cse14 (= |ULTIMATE.start_main_~z~0#1| 6) .cse21 .cse22 .cse7 (= |ULTIMATE.start_main_~y~0#1| 1) .cse49 .cse25 .cse26 .cse50 .cse27) (let ((.cse60 (+ .cse30 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| .cse28 .cse60))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| (* .cse59 (- 1))))) (let ((.cse51 (+ (* .cse56 (- 1)) .cse60 6))) (let ((.cse54 (+ |ULTIMATE.start_main_~y~0#1| .cse43)) (.cse57 (+ .cse56 .cse51 (* .cse60 (- 1))))) (and (= .cse51 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse1)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse13 (- 1)) 0) .cse6 .cse7 (or .cse20 .cse52) .cse53 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse11 (= |ULTIMATE.start_main_~z~0#1| .cse45) (= .cse1 .cse16) .cse15 .cse21 .cse22 (= .cse54 .cse10) .cse55 .cse25 (= (+ .cse56 (* .cse57 (- 1))) 1) (or .cse58 .cse5) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse54)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse9)) (= .cse59 (+ 6 .cse57)) .cse27 (= (+ |ULTIMATE.start_main_~x~0#1| .cse46) .cse47))))))))))))) [2023-02-17 06:53:58,486 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse36 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse35 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse37 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse29 (+ .cse36 .cse35))) (let ((.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse22 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse8 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse44 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse16 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse48 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse49 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse38 (- (* 18 .cse36))) (.cse39 (- (* 18 .cse29))) (.cse30 (+ .cse35 .cse37)) (.cse31 (+ 6 .cse37)) (.cse50 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse43 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse55 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1))) (.cse42 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse51 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse4 (= 0 (+ (+ (* .cse51 |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 (= 0 (+ 12 (+ (+ (* .cse42 .cse42) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse42 (- 1)))))) (- (* 6 .cse42)))))) (.cse32 (<= (+ .cse55 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse33 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse34 (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)) .cse43 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse57 (+ .cse58 65535)))))) (.cse19 (not (<= .cse55 |ULTIMATE.start_main_~a~0#1|))) (.cse20 (let ((.cse54 (+ 6 (* 6 (+ 1 .cse50))))) (or (= 0 (+ (+ (+ (+ (* .cse30 .cse54) .cse39) (- (* 12 .cse30))) (* 2 .cse54)) (- 6))) (not (= .cse54 .cse31))))) (.cse21 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse24 (let ((.cse53 (+ 6 (* 6 .cse50)))) (or (= 0 (+ (+ (+ (+ (* .cse35 .cse53) .cse38) (- (* 12 .cse35))) (* 2 .cse53)) (- 6))) (not (= .cse53 .cse37))))) (.cse9 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse49) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse25 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse48))) (.cse3 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse52 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse52 |ULTIMATE.start_main_~n~0#1|) .cse52))))) (.cse5 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse44) (= 0 (+ (+ (* .cse51 .cse36) (- (* .cse36 .cse37))) (* 12 .cse36))) .cse16)) (.cse6 (= .cse36 (* (* .cse50 .cse50) .cse50))) (.cse7 (or (and .cse8 .cse11 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse8) (not .cse11))))) (.cse10 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse22) .cse49) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse1 (let ((.cse47 (= |ULTIMATE.start_main_~z~0#1| (+ .cse48 6)))) (or (let ((.cse46 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse45 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse46 (- 6)) 0))) (and (or (not .cse45) (<= 0 .cse42) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse46 (- 5)) 0))) (not .cse47) .cse0 (or .cse45 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse47))) (.cse15 (+ 1 0)) (.cse14 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|)))) (or (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) .cse1 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse18 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse17 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse18))) (let ((.cse12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse17 (- 1))))) (let ((.cse2 (+ (* .cse12 (- 1)) .cse18 6))) (let ((.cse13 (+ .cse12 .cse2 (* .cse18 (- 1))))) (and (= .cse2 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |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|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (+ .cse12 (* .cse13 (- 1))) 1) .cse1 .cse14 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse15)) .cse16 (= .cse17 (+ 6 .cse13)))))))) (and .cse19 .cse20 .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|))) .cse22) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse23 .cse24 (or (not .cse25) .cse4) .cse3 (= 0 (+ (let ((.cse28 (+ 6 .cse31))) (+ (let ((.cse26 (+ .cse30 .cse31))) (+ (let ((.cse27 (+ .cse29 .cse30))) (+ (+ (* (* 2 .cse26) .cse26) (- (* (* 3 .cse27) .cse28))) (- (* 18 .cse27)))) (- (* 10 .cse26)))) (* 3 .cse28))) (- 10))) .cse5 .cse6 .cse32 .cse7 .cse8 .cse33 .cse34 .cse9 .cse10 .cse11 .cse1 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse35) .cse35) (- (* (* 3 .cse36) .cse37))) .cse38) (- (* 10 .cse35))) (* 3 .cse37)) (- 10))) .cse14 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse30) .cse30) (- (* (* 3 .cse29) .cse31))) .cse39) (- (* 10 .cse30))) (* 3 .cse31)) (- 10))) .cse25) (let ((.cse41 (+ 7 (+ 18 (- 6)))) (.cse40 (+ 6 6))) (and .cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse40 (- 1))))) .cse6 .cse32 .cse33 .cse34 .cse10 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse41 (- 1))) (* 7 (- 1))) (+ (* (* 0 0) 0) (+ 7 (* 6 (- 1))))) .cse1 .cse14 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse19 .cse20 .cse21 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse24 .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ .cse41 18)) .cse5 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse40))) .cse11 .cse16 .cse25)) (and (= .cse42 (+ 6 (* 6 0))) (= .cse42 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse3 .cse43 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse42)) .cse5 .cse6 .cse7 .cse8 (<= .cse44 1) .cse10 .cse11 (<= |ULTIMATE.start_main_~n~0#1| .cse15) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse15) .cse14 (= |ULTIMATE.start_main_~x~0#1| 1))))))) [2023-02-17 06:53:58,486 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-17 06:53:58,487 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)) (.cse38 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse54 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse12 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse15 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse45 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse53 (* 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 ((.cse7 (+ .cse18 .cse17)) (.cse43 (= 0 (+ (+ (* .cse53 |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 (= .cse18 (* (* .cse45 .cse45) .cse45))) (.cse13 (or (and .cse12 .cse15 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse12) (not .cse15))))) (.cse35 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse2) .cse54) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse24 (let ((.cse58 (= |ULTIMATE.start_main_~z~0#1| (+ .cse38 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 .cse34) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse57 (- 5)) 0))) (not .cse58) .cse23 (or .cse56 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse58))) (.cse36 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse55 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse55 |ULTIMATE.start_main_~n~0#1|) .cse55))))) (.cse37 (= |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|)) (.cse42 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)))) (let ((.cse29 (let ((.cse51 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse54) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse52 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse53 .cse18) (- (* .cse18 .cse19))) (* 12 .cse18))) .cse42))) (or (and .cse33 .cse13 .cse12 .cse51 .cse35 .cse15 .cse24 .cse36 .cse37 .cse43 .cse52) (and .cse33 .cse13 .cse12 .cse51 .cse35 .cse15 .cse24 .cse36 .cse37 .cse52)))) (.cse20 (- (* 18 .cse18))) (.cse21 (- (* 18 .cse7))) (.cse8 (+ .cse17 .cse19)) (.cse9 (+ 6 .cse19)) (.cse50 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse0 (not (<= .cse50 |ULTIMATE.start_main_~a~0#1|))) (.cse1 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse3 (= 0 (+ 12 (+ (+ (* .cse34 .cse34) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse34 (- 1)))))) (- (* 6 .cse34)))))) (.cse10 (<= (+ .cse50 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse14 (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)) (<= 0 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse48 (+ .cse49 65535)))))) (.cse16 (let ((.cse39 (let ((.cse46 (+ 6 (* 6 (+ 1 .cse45))))) (or (= 0 (+ (+ (+ (+ (* .cse8 .cse46) .cse21) (- (* 12 .cse8))) (* 2 .cse46)) (- 6))) (not (= .cse46 .cse9))))) (.cse40 (let ((.cse44 (+ 6 (* 6 .cse45)))) (or (= 0 (+ (+ (+ (+ (* .cse17 .cse44) .cse20) (- (* 12 .cse17))) (* 2 .cse44)) (- 6))) (not (= .cse44 .cse19)))))) (or (let ((.cse41 (+ 6 6))) (and .cse39 .cse12 .cse13 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse40 .cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse41))) .cse15 .cse29 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse41 (- 1))))) .cse42 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))) (and .cse39 .cse12 .cse13 .cse40 .cse35 .cse15 .cse29 .cse43)))) (.cse22 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse38))) (.cse30 (+ 1 0))) (or (and .cse0 .cse1 (= 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|))) .cse2) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse3 (= 0 (+ (let ((.cse6 (+ 6 .cse9))) (+ (let ((.cse4 (+ .cse8 .cse9))) (+ (let ((.cse5 (+ .cse7 .cse8))) (+ (+ (* (* 2 .cse4) .cse4) (- (* (* 3 .cse5) .cse6))) (- (* 18 .cse5)))) (- (* 10 .cse4)))) (* 3 .cse6))) (- 10))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse17) .cse17) (- (* (* 3 .cse18) .cse19))) .cse20) (- (* 10 .cse17))) (* 3 .cse19)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse8) .cse8) (- (* (* 3 .cse7) .cse9))) .cse21) (- (* 10 .cse8))) (* 3 .cse9)) (- 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 ((.cse25 (+ 7 (+ 18 (- 6))))) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~y~0#1| (+ .cse25 18)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse25 (- 1))) (* 7 (- 1))) (+ (* (* 0 0) 0) (+ 7 (* 6 (- 1))))) .cse16 .cse22)) (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 ((.cse27 (+ |ULTIMATE.start_main_~y~0#1| (* .cse31 (- 1))))) (let ((.cse26 (+ (* .cse27 (- 1)) .cse32 6))) (let ((.cse28 (+ .cse27 .cse26 (* .cse32 (- 1))))) (and (= .cse26 0) .cse12 .cse13 .cse15 (= (+ .cse27 (* .cse28 (- 1))) 1) .cse29 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse30)) (= .cse31 (+ 6 .cse28)))))))) (and .cse33 (= .cse34 (+ 6 (* 6 0))) .cse35 (= .cse34 6) .cse24 .cse36 (= |ULTIMATE.start_main_~n~0#1| .cse30) .cse37 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse34)))))))) [2023-02-17 06:53:58,487 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse33 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse32 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse26 (+ .cse33 .cse32)) (.cse40 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse43 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse21 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse57 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse8 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse48 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse42 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse34 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse16 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse58 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse3 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse59 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse59 |ULTIMATE.start_main_~n~0#1|) .cse59))))) (.cse4 (= 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|)))) (.cse5 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse42) (= 0 (+ (+ (* .cse58 .cse33) (- (* .cse33 .cse34))) (* 12 .cse33))) .cse16)) (.cse6 (= .cse33 (* (* .cse48 .cse48) .cse48))) (.cse7 (or (and .cse8 .cse11 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse8) (not .cse11))))) (.cse9 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse57) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse10 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse21) .cse57) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse1 (let ((.cse56 (= |ULTIMATE.start_main_~z~0#1| (+ .cse43 6)))) (or (let ((.cse55 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse54 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse55 (- 6)) 0))) (and (or (not .cse54) (<= 0 .cse40) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse55 (- 5)) 0))) (not .cse56) .cse0 (or .cse54 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse56))) (.cse14 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse35 (- (* 18 .cse33))) (.cse36 (- (* 18 .cse26))) (.cse27 (+ .cse32 .cse34)) (.cse28 (+ 6 .cse34)) (.cse41 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse53 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse19 (not (<= .cse53 |ULTIMATE.start_main_~a~0#1|))) (.cse20 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse22 (= 0 (+ 12 (+ (+ (* .cse40 .cse40) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse40 (- 1)))))) (- (* 6 .cse40)))))) (.cse29 (<= (+ .cse53 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse30 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse31 (or (let ((.cse50 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse50 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse50))) (let ((.cse51 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse52 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse51 (+ .cse52 32767)) .cse41 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse51 (+ .cse52 65535)))))) (.cse37 (let ((.cse44 (let ((.cse49 (+ 6 (* 6 (+ 1 .cse48))))) (or (= 0 (+ (+ (+ (+ (* .cse27 .cse49) .cse36) (- (* 12 .cse27))) (* 2 .cse49)) (- 6))) (not (= .cse49 .cse28))))) (.cse45 (let ((.cse47 (+ 6 (* 6 .cse48)))) (or (= 0 (+ (+ (+ (+ (* .cse32 .cse47) .cse35) (- (* 12 .cse32))) (* 2 .cse47)) (- 6))) (not (= .cse47 .cse34)))))) (or (let ((.cse46 (+ 6 6))) (and .cse44 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse45 .cse3 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse46 (- 1))))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse46))) .cse11 .cse1 .cse14 .cse16 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))) (and .cse44 .cse45 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse14)))) (.cse38 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse43))) (.cse15 (+ 1 0))) (or (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (= |ULTIMATE.start_main_~x~0#1| 0) .cse1 (= |ULTIMATE.start_main_~z~0#1| 6)) (let ((.cse18 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse17 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse18))) (let ((.cse12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse17 (- 1))))) (let ((.cse2 (+ (* .cse12 (- 1)) .cse18 6))) (let ((.cse13 (+ .cse12 .cse2 (* .cse18 (- 1))))) (and (= .cse2 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |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|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (+ .cse12 (* .cse13 (- 1))) 1) .cse1 .cse14 (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse15)) .cse16 (= .cse17 (+ 6 .cse13)))))))) (and .cse19 .cse20 (= 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|))) .cse21) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse22 (= 0 (+ (let ((.cse25 (+ 6 .cse28))) (+ (let ((.cse23 (+ .cse27 .cse28))) (+ (let ((.cse24 (+ .cse26 .cse27))) (+ (+ (* (* 2 .cse23) .cse23) (- (* (* 3 .cse24) .cse25))) (- (* 18 .cse24)))) (- (* 10 .cse23)))) (* 3 .cse25))) (- 10))) .cse29 .cse30 .cse8 .cse7 .cse31 .cse11 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse32) .cse32) (- (* (* 3 .cse33) .cse34))) .cse35) (- (* 10 .cse32))) (* 3 .cse34)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse27) .cse27) (- (* (* 3 .cse26) .cse28))) .cse36) (- (* 10 .cse27))) (* 3 .cse28)) (- 10))) .cse37 .cse38) (let ((.cse39 (+ 7 (+ 18 (- 6))))) (and .cse19 .cse20 .cse22 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~y~0#1| (+ .cse39 18)) .cse29 .cse30 .cse8 .cse7 .cse31 .cse11 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse39 (- 1))) (* 7 (- 1))) (+ (* (* 0 0) 0) (+ 7 (* 6 (- 1))))) .cse37 .cse38)) (and (= .cse40 (+ 6 (* 6 0))) (= .cse40 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse3 .cse41 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse40)) .cse5 .cse6 .cse7 .cse8 (<= .cse42 1) .cse10 .cse11 (<= |ULTIMATE.start_main_~n~0#1| .cse15) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse15) .cse14 (= |ULTIMATE.start_main_~x~0#1| 1))))))) [2023-02-17 06:53:58,488 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 06:53:58,488 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 06:53:58,488 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-17 06:53:58,488 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-17 06:53:58,489 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse23 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse24 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse10 (+ .cse23 .cse22)) (.cse30 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse37 (* (* 0 0) 0)) (.cse47 (* 6 (- 1))) (.cse15 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse42 (+ 6 6)) (.cse41 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse33 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse32 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse28 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse43 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse55 (= 0 (+ (+ (* .cse30 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse36 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse61 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse31 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse25 (- (* 18 .cse23))) (.cse27 (- (* 18 .cse10))) (.cse11 (+ .cse22 .cse24)) (.cse12 (+ 6 .cse24)) (.cse70 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse39 (+ 1 0))) (let ((.cse2 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse29 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse34 (<= |ULTIMATE.start_main_~n~0#1| .cse39)) (.cse0 (let ((.cse72 (+ 6 (* 6 (+ 1 .cse70))))) (or (= 0 (+ (+ (+ (+ (* .cse11 .cse72) .cse27) (- (* 12 .cse11))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse12))))) (.cse5 (let ((.cse71 (+ 6 (* 6 .cse70)))) (or (= 0 (+ (+ (+ (+ (* .cse22 .cse71) .cse25) (- (* 12 .cse22))) (* 2 .cse71)) (- 6))) (not (= .cse71 .cse24))))) (.cse19 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse3) .cse61) .cse31) (- 6)))) (.cse4 (= 0 (+ 12 (+ (+ (* .cse36 .cse36) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse36 (- 1)))))) (- (* 6 .cse36)))))) (.cse13 (= .cse23 (* (* .cse70 .cse70) .cse70))) (.cse16 (or (not .cse28) .cse43 .cse55)) (.cse17 (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)) .cse32 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse68 (+ .cse69 65535)))))) (.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 .cse36) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse33 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse26 (= |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 (<= .cse41 |ULTIMATE.start_main_~a~0#1|)) (.cse51 (+ 6 .cse42)) (.cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse62 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse62 |ULTIMATE.start_main_~n~0#1|) .cse62))))) (.cse14 (or (and .cse15 .cse20 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse15) (not .cse20))))) (.cse40 (+ 1 6)) (.cse18 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse61) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse52 (* 7 (- 1))) (.cse53 (+ .cse37 (+ 7 .cse47))) (.cse49 (* .cse42 (- 1))) (.cse46 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse48 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and .cse0 .cse1 (= 0 (+ (+ (+ (+ (+ (* .cse2 |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 .cse6 (= 0 (+ (let ((.cse9 (+ 6 .cse12))) (+ (let ((.cse7 (+ .cse11 .cse12))) (+ (let ((.cse8 (+ .cse10 .cse11))) (+ (+ (* (* 2 .cse7) .cse7) (- (* (* 3 .cse8) .cse9))) (- (* 18 .cse8)))) (- (* 10 .cse7)))) (* 3 .cse9))) (- 10))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse22) .cse22) (- (* (* 3 .cse23) .cse24))) .cse25) (- (* 10 .cse22))) (* 3 .cse24)) (- 10))) .cse26 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse11) .cse11) (- (* (* 3 .cse10) .cse12))) .cse27) (- (* 10 .cse11))) (* 3 .cse12)) (- 10))) .cse28) (and .cse1 .cse4 (= |ULTIMATE.start_main_~x~0#1| 0) .cse29 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse30)) (- .cse2)) .cse31) (- 10))) .cse32 (= |ULTIMATE.start_main_~z~0#1| 6) .cse14 .cse15 .cse17 (= |ULTIMATE.start_main_~y~0#1| 1) .cse33 .cse20 .cse34 .cse21 .cse28) (let ((.cse44 (+ .cse48 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse38 (+ |ULTIMATE.start_main_~y~0#1| .cse47)) (.cse35 (* 1 (- 1))) (.cse45 (+ |ULTIMATE.start_main_~y~0#1| .cse44 .cse46))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse35) 0) (= .cse36 (+ 6 (* 6 0))) .cse4 (= |ULTIMATE.start_main_~x~0#1| (+ .cse37 .cse38)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse36)) (= .cse38 1) .cse13 .cse16 .cse17 .cse19 .cse21 (= |ULTIMATE.start_main_~n~0#1| .cse39) .cse26 (= |ULTIMATE.start_main_~y~0#1| .cse40) .cse1 (= .cse36 6) (= (+ .cse35 |ULTIMATE.start_main_~x~0#1|) 0) .cse29 (= .cse41 0) .cse6 .cse32 (= |ULTIMATE.start_main_~z~0#1| .cse42) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse30 .cse23) (- (* .cse23 .cse24))) (* 12 .cse23))) (not .cse43)) .cse14 .cse15 (= .cse44 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse45)) .cse20 .cse34 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse45 (- 1))) 1) .cse28))) (let ((.cse50 (+ 7 (+ 18 (- 6))))) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse4 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) .cse5 .cse6 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse49))) (= |ULTIMATE.start_main_~y~0#1| (+ .cse50 18)) .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse51)) .cse20 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse50 (- 1))) .cse52) .cse53) .cse21 .cse26 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse28)) (let ((.cse60 (+ .cse48 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| .cse46 .cse60))) (let ((.cse57 (+ |ULTIMATE.start_main_~y~0#1| (* .cse59 (- 1))))) (let ((.cse54 (+ (* .cse57 (- 1)) .cse60 6))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse49)) (.cse58 (+ .cse57 .cse54 (* .cse60 (- 1))))) (and (= .cse54 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse36)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse4 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse41 (- 1)) 0) .cse13 .cse16 .cse17 (or .cse43 .cse55) .cse21 .cse26 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 (= |ULTIMATE.start_main_~z~0#1| .cse51) (= .cse36 .cse42) .cse6 .cse14 .cse15 (= .cse56 .cse40) .cse18 .cse20 (= (+ .cse57 (* .cse58 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse56)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse39)) (= .cse59 (+ 6 .cse58)) .cse28 (= (+ |ULTIMATE.start_main_~x~0#1| .cse52) .cse53)))))))))))) [2023-02-17 06:53:58,489 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse74 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse18 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse40 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse27 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse74))) (.cse1 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse50 (let ((.cse73 (= |ULTIMATE.start_main_~z~0#1| (+ .cse74 6)))) (or (let ((.cse72 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse71 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse72 (- 6)) 0))) (and (or (not .cse71) (<= 0 .cse1) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse72 (- 5)) 0))) (not .cse73) .cse49 (or .cse71 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse73))) (.cse58 (not .cse27)) (.cse32 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse48 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse70 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse22 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse25 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse36 (+ .cse18 .cse40)) (.cse17 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse3 (* (* 0 0) 0)) (.cse29 (* 6 (- 1))) (.cse16 (+ 6 6)) (.cse13 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse14 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse52 (= 0 (+ (+ (* .cse17 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse9 (+ 1 0)) (.cse42 (- (* 18 .cse36))) (.cse37 (+ .cse40 .cse19)) (.cse38 (+ 6 .cse19)) (.cse21 (or (and .cse22 .cse25 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse22) (not .cse25))))) (.cse55 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse70) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse32) .cse70) .cse48) (- 6)))) (.cse53 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse15 (let ((.cse68 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse69 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse69 |ULTIMATE.start_main_~n~0#1|) .cse69)))))) (or (and .cse50 .cse68) (and .cse50 (or .cse58 .cse68))))) (.cse41 (- (* 18 .cse18))) (.cse61 (+ 1 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse39 (let ((.cse65 (let ((.cse67 (+ 6 (* 6 .cse61)))) (or (= 0 (+ (+ (+ (+ (* .cse40 .cse67) .cse41) (- (* 12 .cse40))) (* 2 .cse67)) (- 6))) (not (= .cse67 .cse19)))))) (or (and .cse21 .cse22 (or .cse58 .cse8) .cse55 .cse65 .cse25 .cse53 .cse15) (and (let ((.cse66 (+ 6 (* 6 (+ 1 .cse61))))) (or (= 0 (+ (+ (+ (+ (* .cse37 .cse66) .cse42) (- (* 12 .cse37))) (* 2 .cse66)) (- 6))) (not (= .cse66 .cse38)))) .cse21 .cse22 .cse55 .cse65 .cse8 .cse25 .cse53 .cse15)))) (.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse31 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse26 (<= |ULTIMATE.start_main_~n~0#1| .cse9)) (.cse2 (= 0 (+ 12 (+ (+ (* .cse1 .cse1) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse1 (- 1)))))) (- (* 6 .cse1)))))) (.cse6 (or .cse58 .cse20 .cse52)) (.cse7 (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)) .cse14 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse63 (+ .cse64 65535)))))) (.cse11 (<= .cse13 |ULTIMATE.start_main_~a~0#1|)) (.cse45 (+ 6 .cse16)) (.cse10 (+ 1 6)) (.cse5 (= .cse18 (* (* .cse61 .cse61) .cse61))) (.cse46 (* 7 (- 1))) (.cse47 (+ .cse3 (+ 7 .cse29))) (.cse43 (* .cse16 (- 1))) (.cse28 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse30 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (let ((.cse23 (+ .cse30 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse4 (+ |ULTIMATE.start_main_~y~0#1| .cse29)) (.cse0 (* 1 (- 1))) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| .cse23 .cse28))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse0) 0) (= .cse1 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~x~0#1| (+ .cse3 .cse4)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse1)) (= .cse4 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~n~0#1| .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse11 (= .cse1 6) (= (+ .cse0 |ULTIMATE.start_main_~x~0#1|) 0) .cse12 (= .cse13 0) .cse14 .cse15 (= |ULTIMATE.start_main_~z~0#1| .cse16) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse17 .cse18) (- (* .cse18 .cse19))) (* 12 .cse18))) (not .cse20)) .cse21 .cse22 (= .cse23 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse24)) .cse25 .cse26 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse24 (- 1))) 1) .cse27))) (and .cse11 (= 0 (+ (+ (+ (+ (+ (* .cse31 |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))) .cse2 (= 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))) .cse6 .cse21 .cse22 .cse7 .cse39 .cse25 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse40) .cse40) (- (* (* 3 .cse18) .cse19))) .cse41) (- (* 10 .cse40))) (* 3 .cse19)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse37) .cse37) (- (* (* 3 .cse36) .cse38))) .cse42) (- (* 10 .cse37))) (* 3 .cse38)) (- 10))) .cse27) (let ((.cse44 (+ 7 (+ 18 (- 6))))) (and .cse11 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse2 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse43))) (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 18)) .cse21 .cse22 .cse7 .cse39 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse45)) .cse25 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse44 (- 1))) .cse46) .cse47) (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse27)) (and .cse11 .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse12 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse17)) (- .cse31)) .cse48) (- 10))) .cse14 (= |ULTIMATE.start_main_~z~0#1| 6) .cse21 .cse22 .cse7 (= |ULTIMATE.start_main_~y~0#1| 1) .cse49 .cse25 .cse26 .cse50 .cse27) (let ((.cse60 (+ .cse30 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| .cse28 .cse60))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| (* .cse59 (- 1))))) (let ((.cse51 (+ (* .cse56 (- 1)) .cse60 6))) (let ((.cse54 (+ |ULTIMATE.start_main_~y~0#1| .cse43)) (.cse57 (+ .cse56 .cse51 (* .cse60 (- 1))))) (and (= .cse51 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse1)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse13 (- 1)) 0) .cse6 .cse7 (or .cse20 .cse52) .cse53 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse11 (= |ULTIMATE.start_main_~z~0#1| .cse45) (= .cse1 .cse16) .cse15 .cse21 .cse22 (= .cse54 .cse10) .cse55 .cse25 (= (+ .cse56 (* .cse57 (- 1))) 1) (or .cse58 .cse5) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse54)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse9)) (= .cse59 (+ 6 .cse57)) .cse27 (= (+ |ULTIMATE.start_main_~x~0#1| .cse46) .cse47))))))))))))) [2023-02-17 06:53:58,490 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse22 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse21 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse23 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse10 (+ .cse22 .cse21)) (.cse39 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse30 (* (* 0 0) 0)) (.cse45 (* 6 (- 1))) (.cse14 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse19 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse38 (+ 6 6)) (.cse36 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse48 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse37 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse27 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse40 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse55 (= 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|)))) (.cse29 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse61 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse47 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse24 (- (* 18 .cse22))) (.cse26 (- (* 18 .cse10))) (.cse11 (+ .cse21 .cse23)) (.cse12 (+ 6 .cse23)) (.cse70 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse33 (+ 1 0))) (let ((.cse35 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse2 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse43 (<= |ULTIMATE.start_main_~n~0#1| .cse33)) (.cse0 (let ((.cse72 (+ 6 (* 6 (+ 1 .cse70))))) (or (= 0 (+ (+ (+ (+ (* .cse11 .cse72) .cse26) (- (* 12 .cse11))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse12))))) (.cse5 (let ((.cse71 (+ 6 (* 6 .cse70)))) (or (= 0 (+ (+ (+ (+ (* .cse21 .cse71) .cse24) (- (* 12 .cse21))) (* 2 .cse71)) (- 6))) (not (= .cse71 .cse23))))) (.cse18 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse3) .cse61) .cse47) (- 6)))) (.cse4 (= 0 (+ 12 (+ (+ (* .cse29 .cse29) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse29 (- 1)))))) (- (* 6 .cse29)))))) (.cse32 (= .cse22 (* (* .cse70 .cse70) .cse70))) (.cse15 (or (not .cse27) .cse40 .cse55)) (.cse16 (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)))))) (.cse20 (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 .cse29) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse48 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse25 (= |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 (<= .cse36 |ULTIMATE.start_main_~a~0#1|)) (.cse51 (+ 6 .cse38)) (.cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse62 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse62 |ULTIMATE.start_main_~n~0#1|) .cse62))))) (.cse13 (or (and .cse14 .cse19 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse14) (not .cse19))))) (.cse34 (+ 1 6)) (.cse17 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse61) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse52 (* 7 (- 1))) (.cse53 (+ .cse30 (+ 7 .cse45))) (.cse49 (* .cse38 (- 1))) (.cse44 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse46 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and .cse0 .cse1 (= 0 (+ (+ (+ (+ (+ (* .cse2 |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 .cse6 (= 0 (+ (let ((.cse9 (+ 6 .cse12))) (+ (let ((.cse7 (+ .cse11 .cse12))) (+ (let ((.cse8 (+ .cse10 .cse11))) (+ (+ (* (* 2 .cse7) .cse7) (- (* (* 3 .cse8) .cse9))) (- (* 18 .cse8)))) (- (* 10 .cse7)))) (* 3 .cse9))) (- 10))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse21) .cse21) (- (* (* 3 .cse22) .cse23))) .cse24) (- (* 10 .cse21))) (* 3 .cse23)) (- 10))) .cse25 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse11) .cse11) (- (* (* 3 .cse10) .cse12))) .cse26) (- (* 10 .cse11))) (* 3 .cse12)) (- 10))) .cse27) (let ((.cse41 (+ .cse46 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse31 (+ |ULTIMATE.start_main_~y~0#1| .cse45)) (.cse28 (* 1 (- 1))) (.cse42 (+ |ULTIMATE.start_main_~y~0#1| .cse41 .cse44))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse28) 0) (= .cse29 (+ 6 (* 6 0))) .cse4 (= |ULTIMATE.start_main_~x~0#1| (+ .cse30 .cse31)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse29)) (= .cse31 1) .cse32 .cse15 .cse16 .cse18 .cse20 (= |ULTIMATE.start_main_~n~0#1| .cse33) (= |ULTIMATE.start_main_~y~0#1| .cse34) .cse1 (= .cse29 6) (= (+ .cse28 |ULTIMATE.start_main_~x~0#1|) 0) .cse35 (= .cse36 0) .cse6 .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 .cse22) (- (* .cse22 .cse23))) (* 12 .cse22))) (not .cse40)) .cse13 .cse14 (= .cse41 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse42)) .cse19 .cse43 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse42 (- 1))) 1) .cse27))) (and .cse1 .cse4 (= |ULTIMATE.start_main_~x~0#1| 0) .cse35 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse39)) (- .cse2)) .cse47) (- 10))) .cse37 (= |ULTIMATE.start_main_~z~0#1| 6) .cse13 .cse14 .cse16 (= |ULTIMATE.start_main_~y~0#1| 1) .cse48 .cse19 .cse43 .cse20 .cse27) (let ((.cse50 (+ 7 (+ 18 (- 6))))) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse4 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) .cse5 .cse6 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse49))) (= |ULTIMATE.start_main_~y~0#1| (+ .cse50 18)) .cse13 .cse14 .cse16 .cse17 .cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse51)) .cse19 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse50 (- 1))) .cse52) .cse53) .cse20 .cse25 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse27)) (let ((.cse60 (+ .cse46 |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 ((.cse54 (+ (* .cse57 (- 1)) .cse60 6))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse49)) (.cse58 (+ .cse57 .cse54 (* .cse60 (- 1))))) (and (= .cse54 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse29)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse4 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse36 (- 1)) 0) .cse32 .cse15 .cse16 (or .cse40 .cse55) .cse20 .cse25 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse1 (= |ULTIMATE.start_main_~z~0#1| .cse51) (= .cse29 .cse38) .cse6 .cse13 .cse14 (= .cse56 .cse34) .cse17 .cse19 (= (+ .cse57 (* .cse58 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse56)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse33)) (= .cse59 (+ 6 .cse58)) .cse27 (= (+ |ULTIMATE.start_main_~x~0#1| .cse52) .cse53)))))))))))) [2023-02-17 06:53:58,490 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 06:53:58,490 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 06:53:58,490 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-17 06:53:58,491 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-17 06:53:58,491 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse39 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse19 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse31 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse34 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse23 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse42 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse55 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse12 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse15 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse48 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse56 (* 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 ((.cse7 (+ .cse18 .cse17)) (.cse46 (= 0 (+ (+ (* .cse56 |ULTIMATE.start_main_~x~0#1|) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 12 |ULTIMATE.start_main_~x~0#1|)))) (.cse38 (= .cse18 (* (* .cse48 .cse48) .cse48))) (.cse13 (or (and .cse12 .cse15 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse12) (not .cse15))))) (.cse40 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse2) .cse55) (* 2 |ULTIMATE.start_main_~z~0#1|)) (- 6)))) (.cse24 (let ((.cse60 (= |ULTIMATE.start_main_~z~0#1| (+ .cse42 6)))) (or (let ((.cse59 (* (- 6) |ULTIMATE.start_main_~n~0#1|))) (let ((.cse58 (<= (+ |ULTIMATE.start_main_~z~0#1| .cse59 (- 6)) 0))) (and (or (not .cse58) (<= 0 .cse34) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse59 (- 5)) 0))) (not .cse60) .cse23 (or .cse58 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse60))) (.cse35 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse57 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse57 |ULTIMATE.start_main_~n~0#1|) .cse57))))) (.cse41 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse37 (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) .cse39) (= 0 (+ (+ (* .cse56 .cse18) (- (* .cse18 .cse19))) (* 12 .cse18))) .cse31))) (let ((.cse27 (let ((.cse54 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse55) (- (* 6 |ULTIMATE.start_main_~z~0#1|))))))) (or (and .cse38 .cse13 .cse12 .cse54 .cse40 .cse15 .cse24 .cse35 .cse41 .cse46 .cse37) (and .cse38 .cse13 .cse12 .cse54 .cse40 .cse15 .cse24 .cse35 .cse41 .cse37)))) (.cse20 (- (* 18 .cse18))) (.cse21 (- (* 18 .cse7))) (.cse8 (+ .cse17 .cse19)) (.cse9 (+ 6 .cse19)) (.cse36 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse53 (+ (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)) (- 1)))) (let ((.cse0 (not (<= .cse53 |ULTIMATE.start_main_~a~0#1|))) (.cse1 (<= (+ |ULTIMATE.start_main_~n~0#1| (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse3 (= 0 (+ 12 (+ (+ (* .cse34 .cse34) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse34 (- 1)))))) (- (* 6 .cse34)))))) (.cse10 (<= (+ .cse53 (- 1)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (= (mod (* |ULTIMATE.start_main_~z~0#1| 5) 6) 0)) (.cse14 (or (let ((.cse50 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse50 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse50))) (let ((.cse51 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse52 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse51 (+ .cse52 32767)) .cse36 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse51 (+ .cse52 65535)))))) (.cse16 (let ((.cse43 (let ((.cse49 (+ 6 (* 6 (+ 1 .cse48))))) (or (= 0 (+ (+ (+ (+ (* .cse8 .cse49) .cse21) (- (* 12 .cse8))) (* 2 .cse49)) (- 6))) (not (= .cse49 .cse9))))) (.cse44 (let ((.cse47 (+ 6 (* 6 .cse48)))) (or (= 0 (+ (+ (+ (+ (* .cse17 .cse47) .cse20) (- (* 12 .cse17))) (* 2 .cse47)) (- 6))) (not (= .cse47 .cse19)))))) (or (let ((.cse45 (+ 6 6))) (and .cse43 .cse12 .cse13 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse44 .cse40 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ 6 .cse45))) .cse15 .cse27 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 (* .cse45 (- 1))))) .cse31 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)))) (and .cse43 .cse12 .cse13 .cse44 .cse40 .cse15 .cse27 .cse46)))) (.cse22 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse42))) (.cse30 (+ 1 0))) (or (and .cse0 .cse1 (= 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|))) .cse2) (- (* 10 |ULTIMATE.start_main_~y~0#1|))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10))) .cse3 (= 0 (+ (let ((.cse6 (+ 6 .cse9))) (+ (let ((.cse4 (+ .cse8 .cse9))) (+ (let ((.cse5 (+ .cse7 .cse8))) (+ (+ (* (* 2 .cse4) .cse4) (- (* (* 3 .cse5) .cse6))) (- (* 18 .cse5)))) (- (* 10 .cse4)))) (* 3 .cse6))) (- 10))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse17) .cse17) (- (* (* 3 .cse18) .cse19))) .cse20) (- (* 10 .cse17))) (* 3 .cse19)) (- 10))) (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse8) .cse8) (- (* (* 3 .cse7) .cse9))) .cse21) (- (* 10 .cse8))) (* 3 .cse9)) (- 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 ((.cse25 (+ 7 (+ 18 (- 6))))) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) (= |ULTIMATE.start_main_~y~0#1| (+ .cse25 18)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse25 (- 1))) (* 7 (- 1))) (+ (* (* 0 0) 0) (+ 7 (* 6 (- 1))))) .cse16 .cse22)) (let ((.cse33 (+ (* |ULTIMATE.start_main_~y~0#1| (- 1)) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse32 (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~x~0#1| (- 1)) .cse33))) (let ((.cse28 (+ |ULTIMATE.start_main_~y~0#1| (* .cse32 (- 1))))) (let ((.cse26 (+ (* .cse28 (- 1)) .cse33 6))) (let ((.cse29 (+ .cse28 .cse26 (* .cse33 (- 1))))) (and (= .cse26 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse27 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse12 .cse13 .cse15 (= (+ .cse28 (* .cse29 (- 1))) 1) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse30)) .cse31 (= .cse32 (+ 6 .cse29)))))))) (and (= .cse34 (+ 6 (* 6 0))) (= .cse34 6) (= (+ (* 1 (- 1)) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) .cse35 .cse36 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse34)) .cse37 .cse38 .cse13 .cse12 (<= .cse39 1) .cse40 .cse15 (<= |ULTIMATE.start_main_~n~0#1| .cse30) .cse24 (= |ULTIMATE.start_main_~n~0#1| .cse30) .cse41 (= |ULTIMATE.start_main_~x~0#1| 1))))))) [2023-02-17 06:53:58,491 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 06:53:58,492 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (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|))) (let ((.cse49 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse64 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse45 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse40 (+ .cse44 .cse43))) (let ((.cse52 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse55 (* (* 0 0) 0)) (.cse59 (* 6 (- 1))) (.cse35 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse50 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse65 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse51 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse17 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse21 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse14 (+ 6 6)) (.cse46 (- (* 18 .cse44))) (.cse1 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse47 (- (* 18 .cse40))) (.cse41 (+ .cse43 .cse45)) (.cse42 (+ 6 .cse45)) (.cse69 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse24 (+ 1 0)) (.cse26 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse64))) (.cse8 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse9 (= 0 (+ (+ (* .cse49 |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|))))) (let ((.cse34 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse5 (or (not .cse26) .cse8 .cse9)) (.cse19 (+ 1 6)) (.cse48 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse53 (<= |ULTIMATE.start_main_~n~0#1| .cse24)) (.cse31 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse32 (* |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse33 (let ((.cse72 (+ 6 (* 6 (+ 1 .cse69))))) (or (= 0 (+ (+ (+ (+ (* .cse41 .cse72) .cse47) (- (* 12 .cse41))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse42))))) (.cse12 (<= .cse3 |ULTIMATE.start_main_~a~0#1|)) (.cse2 (= 0 (+ 12 (+ (+ (* .cse1 .cse1) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse1 (- 1)))))) (- (* 6 .cse1)))))) (.cse36 (let ((.cse71 (+ 6 (* 6 .cse69)))) (or (= 0 (+ (+ (+ (+ (* .cse43 .cse71) .cse46) (- (* 12 .cse43))) (* 2 .cse71)) (- 6))) (not (= .cse71 .cse45))))) (.cse15 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse70 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse70 |ULTIMATE.start_main_~n~0#1|) .cse70))))) (.cse30 (* .cse14 (- 1))) (.cse4 (= .cse44 (* (* .cse69 .cse69) .cse69))) (.cse16 (or (and .cse17 .cse21 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse17) (not .cse21))))) (.cse6 (or (let ((.cse66 (+ |ULTIMATE.start_main_~a~0#1| 65536))) (and (< .cse66 65536) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767)) (<= 0 .cse66))) (let ((.cse67 (+ (* (div (+ (- |ULTIMATE.start_main_~a~0#1|) (- 1)) 65536) 65536) 65536)) (.cse68 (* |ULTIMATE.start_main_~a~0#1| (- 1)))) (and (<= .cse67 (+ .cse68 32767)) .cse51 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse67 (+ .cse68 65535)))))) (.cse20 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse65) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse7 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse35) .cse65) .cse50) (- 6)))) (.cse13 (+ 6 .cse14)) (.cse27 (* 7 (- 1))) (.cse28 (+ .cse55 (+ 7 .cse59))) (.cse10 (let ((.cse63 (= |ULTIMATE.start_main_~z~0#1| (+ .cse64 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 .cse1) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse62 (- 5)) 0))) (not .cse63) .cse52 (or .cse61 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse63))) (.cse11 (= |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 ((.cse29 (+ .cse32 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse25 (+ |ULTIMATE.start_main_~y~0#1| .cse31 .cse29))) (let ((.cse22 (+ |ULTIMATE.start_main_~y~0#1| (* .cse25 (- 1))))) (let ((.cse0 (+ (* .cse22 (- 1)) .cse29 6))) (let ((.cse18 (+ |ULTIMATE.start_main_~y~0#1| .cse30)) (.cse23 (+ .cse22 .cse0 (* .cse29 (- 1))))) (and (= .cse0 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse1)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse3 (- 1)) 0) .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse9) .cse10 .cse11 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse12 (= |ULTIMATE.start_main_~z~0#1| .cse13) (= .cse1 .cse14) .cse15 .cse16 .cse17 (= .cse18 .cse19) .cse20 .cse21 (= (+ .cse22 (* .cse23 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse18)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse24)) (= .cse25 (+ 6 .cse23)) .cse26 (= (+ |ULTIMATE.start_main_~x~0#1| .cse27) .cse28))))))) (and .cse33 .cse12 (= 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))) .cse2 .cse36 .cse15 (= 0 (+ (let ((.cse39 (+ 6 .cse42))) (+ (let ((.cse37 (+ .cse41 .cse42))) (+ (let ((.cse38 (+ .cse40 .cse41))) (+ (+ (* (* 2 .cse37) .cse37) (- (* (* 3 .cse38) .cse39))) (- (* 18 .cse38)))) (- (* 10 .cse37)))) (* 3 .cse39))) (- 10))) .cse4 .cse16 .cse17 .cse5 .cse6 .cse20 .cse7 .cse21 .cse10 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse43) .cse43) (- (* (* 3 .cse44) .cse45))) .cse46) (- (* 10 .cse43))) (* 3 .cse45)) (- 10))) .cse11 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse41) .cse41) (- (* (* 3 .cse40) .cse42))) .cse47) (- (* 10 .cse41))) (* 3 .cse42)) (- 10))) .cse26) (and .cse12 .cse2 (= |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))) .cse51 (= |ULTIMATE.start_main_~z~0#1| 6) .cse16 .cse17 .cse6 (= |ULTIMATE.start_main_~y~0#1| 1) .cse52 .cse21 .cse53 .cse10 .cse26) (let ((.cse57 (+ .cse32 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse59)) (.cse54 (* 1 (- 1))) (.cse58 (+ |ULTIMATE.start_main_~y~0#1| .cse57 .cse31))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse54) 0) (= .cse1 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~x~0#1| (+ .cse55 .cse56)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse1)) (= .cse56 1) .cse4 .cse5 .cse6 .cse7 .cse10 (= |ULTIMATE.start_main_~n~0#1| .cse24) .cse11 (= |ULTIMATE.start_main_~y~0#1| .cse19) .cse12 (= .cse1 6) (= (+ .cse54 |ULTIMATE.start_main_~x~0#1|) 0) .cse48 (= .cse3 0) .cse15 .cse51 (= |ULTIMATE.start_main_~z~0#1| .cse14) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse49 .cse44) (- (* .cse44 .cse45))) (* 12 .cse44))) (not .cse8)) .cse16 .cse17 (= .cse57 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse58)) .cse21 .cse53 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse58 (- 1))) 1) .cse26))) (let ((.cse60 (+ 7 (+ 18 (- 6))))) (and .cse33 .cse12 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse2 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) .cse36 .cse15 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse30))) (= |ULTIMATE.start_main_~y~0#1| (+ .cse60 18)) .cse4 .cse16 .cse17 .cse6 .cse20 .cse7 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse13)) .cse21 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse60 (- 1))) .cse27) .cse28) .cse10 .cse11 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse26))))))) [2023-02-17 06:53:58,493 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse19 (+ |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|))) (let ((.cse20 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse39 (+ .cse19 .cse43)) (.cse18 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse66 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse3 (* (* 0 0) 0)) (.cse30 (* 6 (- 1))) (.cse23 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse26 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse17 (+ 6 6)) (.cse14 (+ |ULTIMATE.start_main_~n~0#1| (- 1))) (.cse48 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse16 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse28 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse66))) (.cse21 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse55 (= 0 (+ (+ (* .cse18 |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 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse34 (- (* 18 |ULTIMATE.start_main_~x~0#1|))) (.cse61 (- (* 12 |ULTIMATE.start_main_~y~0#1|))) (.cse47 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse44 (- (* 18 .cse19))) (.cse46 (- (* 18 .cse39))) (.cse40 (+ .cse43 .cse20)) (.cse41 (+ 6 .cse20)) (.cse70 (+ 1 |ULTIMATE.start_main_~n~0#1|)) (.cse10 (+ 1 0))) (let ((.cse13 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (+ |ULTIMATE.start_main_~y~0#1| (- 1))))) (.cse33 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse27 (<= |ULTIMATE.start_main_~n~0#1| .cse10)) (.cse32 (let ((.cse72 (+ 6 (* 6 (+ 1 .cse70))))) (or (= 0 (+ (+ (+ (+ (* .cse40 .cse72) .cse46) (- (* 12 .cse40))) (* 2 .cse72)) (- 6))) (not (= .cse72 .cse41))))) (.cse35 (let ((.cse71 (+ 6 (* 6 .cse70)))) (or (= 0 (+ (+ (+ (+ (* .cse43 .cse71) .cse44) (- (* 12 .cse43))) (* 2 .cse71)) (- 6))) (not (= .cse71 .cse20))))) (.cse8 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) .cse34) .cse61) .cse47) (- 6)))) (.cse2 (= 0 (+ 12 (+ (+ (* .cse1 .cse1) (- (* 12 (+ |ULTIMATE.start_main_~y~0#1| (* .cse1 (- 1)))))) (- (* 6 .cse1)))))) (.cse5 (= .cse19 (* (* .cse70 .cse70) .cse70))) (.cse6 (or (not .cse28) .cse21 .cse55)) (.cse7 (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)) .cse16 (< |ULTIMATE.start_main_~a~0#1| 65536) (<= .cse68 (+ .cse69 65535)))))) (.cse9 (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 .cse1) (not (<= (+ |ULTIMATE.start_main_~z~0#1| .cse64 (- 5)) 0))) (not .cse65) .cse48 (or .cse63 (<= |ULTIMATE.start_main_~z~0#1| 6))))) .cse65))) (.cse45 (= |ULTIMATE.start_main_~x~0#1| (* (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~n~0#1|))) (.cse12 (<= .cse14 |ULTIMATE.start_main_~a~0#1|)) (.cse51 (+ 6 .cse17)) (.cse15 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (let ((.cse62 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ (* .cse62 |ULTIMATE.start_main_~n~0#1|) .cse62))))) (.cse22 (or (and .cse23 .cse26 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse23) (not .cse26))))) (.cse11 (+ 1 6)) (.cse42 (= 0 (+ 12 (+ (+ (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) .cse61) (- (* 6 |ULTIMATE.start_main_~z~0#1|)))))) (.cse52 (* 7 (- 1))) (.cse53 (+ .cse3 (+ 7 .cse30))) (.cse49 (* .cse17 (- 1))) (.cse29 (* |ULTIMATE.start_main_~x~0#1| (- 1))) (.cse31 (* |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (let ((.cse24 (+ .cse31 |ULTIMATE.start_main_~x~0#1| 6))) (let ((.cse4 (+ |ULTIMATE.start_main_~y~0#1| .cse30)) (.cse0 (* 1 (- 1))) (.cse25 (+ |ULTIMATE.start_main_~y~0#1| .cse24 .cse29))) (and (= (+ |ULTIMATE.start_main_~x~0#1| .cse0) 0) (= .cse1 (+ 6 (* 6 0))) .cse2 (= |ULTIMATE.start_main_~x~0#1| (+ .cse3 .cse4)) (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse1)) (= .cse4 1) .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~n~0#1| .cse10) (= |ULTIMATE.start_main_~y~0#1| .cse11) .cse12 (= .cse1 6) (= (+ .cse0 |ULTIMATE.start_main_~x~0#1|) 0) .cse13 (= .cse14 0) .cse15 .cse16 (= |ULTIMATE.start_main_~z~0#1| .cse17) (or (< (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= 0 (+ (+ (* .cse18 .cse19) (- (* .cse19 .cse20))) (* 12 .cse19))) (not .cse21)) .cse22 .cse23 (= .cse24 0) (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse25)) .cse26 .cse27 (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ |ULTIMATE.start_main_~y~0#1| (* .cse25 (- 1))) 1) .cse28))) (and .cse32 .cse12 (= 0 (+ (+ (+ (+ (+ (* .cse33 |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))) .cse2 .cse35 .cse15 (= 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))) .cse5 .cse22 .cse23 .cse6 .cse7 .cse42 .cse8 .cse26 .cse9 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse43) .cse43) (- (* (* 3 .cse19) .cse20))) .cse44) (- (* 10 .cse43))) (* 3 .cse20)) (- 10))) .cse45 (= 0 (+ (+ (+ (+ (+ (* (* 2 .cse40) .cse40) (- (* (* 3 .cse39) .cse41))) .cse46) (- (* 10 .cse40))) (* 3 .cse41)) (- 10))) .cse28) (and .cse12 .cse2 (= |ULTIMATE.start_main_~x~0#1| 0) .cse13 (= 0 (+ (+ (+ (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse18)) (- .cse33)) .cse47) (- 10))) .cse16 (= |ULTIMATE.start_main_~z~0#1| 6) .cse22 .cse23 .cse7 (= |ULTIMATE.start_main_~y~0#1| 1) .cse48 .cse26 .cse27 .cse9 .cse28) (let ((.cse50 (+ 7 (+ 18 (- 6))))) (and .cse32 .cse12 (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse2 (= |ULTIMATE.start_main_~z~0#1| (+ 6 18)) .cse35 .cse15 (= (+ |ULTIMATE.start_main_~x~0#1| (* 19 (- 1))) (+ 1 (+ 19 .cse49))) (= |ULTIMATE.start_main_~y~0#1| (+ .cse50 18)) .cse5 .cse22 .cse23 .cse7 .cse42 .cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse51)) .cse26 (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* .cse50 (- 1))) .cse52) .cse53) .cse9 .cse45 (<= |ULTIMATE.start_main_~n~0#1| (+ 1 2)) .cse28)) (let ((.cse60 (+ .cse31 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse59 (+ |ULTIMATE.start_main_~y~0#1| .cse29 .cse60))) (let ((.cse57 (+ |ULTIMATE.start_main_~y~0#1| (* .cse59 (- 1))))) (let ((.cse54 (+ (* .cse57 (- 1)) .cse60 6))) (let ((.cse56 (+ |ULTIMATE.start_main_~y~0#1| .cse49)) (.cse58 (+ .cse57 .cse54 (* .cse60 (- 1))))) (and (= .cse54 0) (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse1)) (= |ULTIMATE.start_main_~y~0#1| (+ (+ 1 (+ 12 (- 6))) 12)) .cse2 (= |ULTIMATE.start_main_~n~0#1| (+ 1 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= (+ .cse14 (- 1)) 0) .cse5 .cse6 .cse7 (or .cse21 .cse55) .cse9 .cse45 (= |ULTIMATE.start_main_~z~0#1| (+ 6 12)) .cse12 (= |ULTIMATE.start_main_~z~0#1| .cse51) (= .cse1 .cse17) .cse15 .cse22 .cse23 (= .cse56 .cse11) .cse42 .cse26 (= (+ .cse57 (* .cse58 (- 1))) 1) (= |ULTIMATE.start_main_~x~0#1| (+ 1 .cse56)) (= |ULTIMATE.start_main_~n~0#1| (+ 1 .cse10)) (= .cse59 (+ 6 .cse58)) .cse28 (= (+ |ULTIMATE.start_main_~x~0#1| .cse52) .cse53)))))))))))) [2023-02-17 06:53:58,493 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 06:53:58,493 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 06:53:58,493 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 06:53:58,493 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 06:53:58,493 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 06:53:58,493 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 06:53:58,496 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 06:53:58,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 06:53:58,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 06:53:58 BoogieIcfgContainer [2023-02-17 06:53:58,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 06:53:58,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 06:53:58,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 06:53:58,531 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 06:53:58,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:52:43" (3/4) ... [2023-02-17 06:53:58,539 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 06:53:58,543 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 06:53:58,545 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 06:53:58,545 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 06:53:58,546 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 06:53:58,546 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 06:53:58,573 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 06:53:58,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 06:53:58,574 INFO L158 Benchmark]: Toolchain (without parser) took 75748.18ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 90.5MB in the beginning and 131.0MB in the end (delta: -40.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:53:58,574 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:53:58,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.22ms. Allocated memory is still 136.3MB. Free memory was 90.5MB in the beginning and 79.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:53:58,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.53ms. Allocated memory is still 136.3MB. Free memory was 79.5MB in the beginning and 77.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:53:58,575 INFO L158 Benchmark]: Boogie Preprocessor took 11.82ms. Allocated memory is still 136.3MB. Free memory was 77.9MB in the beginning and 76.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 06:53:58,575 INFO L158 Benchmark]: RCFGBuilder took 193.52ms. Allocated memory is still 136.3MB. Free memory was 76.9MB in the beginning and 66.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 06:53:58,575 INFO L158 Benchmark]: TraceAbstraction took 75312.52ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 65.3MB in the beginning and 134.2MB in the end (delta: -68.8MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2023-02-17 06:53:58,576 INFO L158 Benchmark]: Witness Printer took 42.55ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 131.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 06:53:58,580 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.22ms. Allocated memory is still 136.3MB. Free memory was 90.5MB in the beginning and 79.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.53ms. Allocated memory is still 136.3MB. Free memory was 79.5MB in the beginning and 77.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.82ms. Allocated memory is still 136.3MB. Free memory was 77.9MB in the beginning and 76.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 193.52ms. Allocated memory is still 136.3MB. Free memory was 76.9MB in the beginning and 66.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 75312.52ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 65.3MB in the beginning and 134.2MB in the end (delta: -68.8MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * Witness Printer took 42.55ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 131.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: 75.2s, OverallIterations: 14, TraceHistogramMax: 24, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 59.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 47.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 46.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 750 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4033 IncrementalHoareTripleChecker+Invalid, 4562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 379 mSDtfsCounter, 4033 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1656 GetRequests, 1430 SyntacticMatches, 23 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 22.6s 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 74 PreInvPairs, 130 NumberOfFragments, 29585 HoareAnnotationTreeSize, 74 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 871 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1529 ConstructedInterpolants, 0 QuantifiedInterpolants, 13752 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1837 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 8060/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: ((((((((((((((((((((((((((((((((x + 1 * -1 == 0 && z + -6 == 6 + 6 * 0) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && x == 0 * 0 * 0 + (y + 6 * -1)) && y == 1 + (z + -6)) && y + 6 * -1 == 1) && 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) && y == 1 + 6) && n + -1 <= a) && z + -6 == 6) && 1 * -1 + x == 0) && z == 6 + (y + -1)) && n + -1 == 0) && 0 <= a) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) && z == 6 + 6) && ((n + 1 < a + 1 || 0 == 6 * a * (x + y) + -((x + y) * (6 + z)) + 12 * (x + y)) || !(n <= a))) && (((a <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && 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) || ((((((((((((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 == 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 <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && (((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 <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0)))) && a <= 10) && (!(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) && x == n * n * n) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || (((((((((0 == (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 <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && 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) && 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) && 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)) || ((((((((((((((n + -1 <= a && 2 <= a) && 0 == 12 + ((z + -6) * (z + -6) + -(12 * (y + (z + -6) * -1)) + -(6 * (z + -6)))) && z == 6 + 18) && x + 19 * -1 == 1 + (19 + (6 + 6) * -1)) && y == 7 + (18 + -6) + 18) && (((a <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && (((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 <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0)))) && a <= 10) && (!(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) && x == n * n * n) && ((((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && y == 1 + (3 * n * n + 3 * n)) || (((((((!(z + -6 * n + -6 <= 0) || 0 <= z + -6) || !(z + -6 * n + -5 <= 0)) && !(z == 6 * n + 6)) && n == 0) && (z + -6 * n + -6 <= 0 || z <= 6)) || z == 6 * n + 6) && (!(z == 6 + 6 * n) || y == 1 + (3 * n * n + 3 * n))))) || (((((((((0 == (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 <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && 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) && 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))))))) && z == 6 + (6 + (6 + 6))) && a >= 0) && x + (7 + (18 + -6)) * -1 + 7 * -1 == 0 * 0 * 0 + (7 + 6 * -1)) && n <= 1 + 2) && z == 6 + 6 * n)) || (((((((((((((((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) && 0 <= a) && z == 6) && (((a <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && (((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)) || ((((((((((((((((((((((((((((y + (y + x * -1 + (y * -1 + x + z + -6)) * -1) * -1 + (y * -1 + x + z + -6) + 6 == 0 && y == 7 + (z + -6)) && 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) && z == 6 + 12) && n + -1 <= a) && z == 6 + (6 + 6)) && z + -6 == 6 + 6) && ((((((((!(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 <= 10 && a >= 0) && cond == 1) || (cond == 0 && (!(a <= 10) || !(a >= 0))))) && a <= 10) && 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) && x + 7 * -1 == 0 * 0 * 0 + (7 + 6 * -1)) RESULT: Ultimate proved your program to be correct! [2023-02-17 06:53:58,609 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