./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.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 942b28ff7c0583b7db8395d2c315e70afc8fe68ba69d39faf867ac75d7628edb --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:20:15,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:20:15,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:20:16,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:20:16,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:20:16,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:20:16,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:20:16,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:20:16,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:20:16,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:20:16,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:20:16,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:20:16,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:20:16,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:20:16,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:20:16,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:20:16,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:20:16,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:20:16,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:20:16,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:20:16,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:20:16,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:20:16,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:20:16,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:20:16,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:20:16,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:20:16,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:20:16,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:20:16,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:20:16,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:20:16,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:20:16,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:20:16,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:20:16,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:20:16,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:20:16,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:20:16,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:20:16,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:20:16,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:20:16,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:20:16,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:20:16,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:20:16,044 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:20:16,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:20:16,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:20:16,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:20:16,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:20:16,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:20:16,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:20:16,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:20:16,058 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:20:16,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:20:16,059 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:20:16,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:20:16,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:20:16,060 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:20:16,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:20:16,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:20:16,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:20:16,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:20:16,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:20:16,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:20:16,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:20:16,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:20:16,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:20:16,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:20:16,062 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:20:16,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:20:16,063 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:20:16,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:20:16,063 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:20:16,063 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 -> 942b28ff7c0583b7db8395d2c315e70afc8fe68ba69d39faf867ac75d7628edb [2023-02-18 01:20:16,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:20:16,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:20:16,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:20:16,234 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:20:16,235 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:20:16,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c [2023-02-18 01:20:17,140 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:20:17,328 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:20:17,330 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound2.c [2023-02-18 01:20:17,334 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60b7f637/89325dd17ed945aa8edbee5aa53eeb1c/FLAGdfa4432f6 [2023-02-18 01:20:17,751 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60b7f637/89325dd17ed945aa8edbee5aa53eeb1c [2023-02-18 01:20:17,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:20:17,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:20:17,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:20:17,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:20:17,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:20:17,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdb451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17, skipping insertion in model container [2023-02-18 01:20:17,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:20:17,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:20:17,858 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_valuebound2.c[588,601] [2023-02-18 01:20:17,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:20:17,892 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:20:17,901 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_valuebound2.c[588,601] [2023-02-18 01:20:17,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:20:17,923 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:20:17,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17 WrapperNode [2023-02-18 01:20:17,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:20:17,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:20:17,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:20:17,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:20:17,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,953 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-18 01:20:17,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:20:17,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:20:17,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:20:17,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:20:17,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,966 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:20:17,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:20:17,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:20:17,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:20:17,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (1/1) ... [2023-02-18 01:20:17,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:20:17,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:17,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 01:20:17,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 01:20:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:20:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:20:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:20:18,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:20:18,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:20:18,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:20:18,078 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:20:18,079 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:20:18,248 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:20:18,252 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:20:18,268 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:20:18,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:20:18 BoogieIcfgContainer [2023-02-18 01:20:18,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:20:18,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:20:18,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:20:18,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:20:18,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:20:17" (1/3) ... [2023-02-18 01:20:18,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d321f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:20:18, skipping insertion in model container [2023-02-18 01:20:18,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:17" (2/3) ... [2023-02-18 01:20:18,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d321f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:20:18, skipping insertion in model container [2023-02-18 01:20:18,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:20:18" (3/3) ... [2023-02-18 01:20:18,275 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound2.c [2023-02-18 01:20:18,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:20:18,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:20:18,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:20:18,336 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;@4faa651, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:20:18,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:20:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:20:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:20:18,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:18,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:18,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-18 01:20:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:18,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599441215] [2023-02-18 01:20:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:18,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599441215] [2023-02-18 01:20:18,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599441215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:20:18,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:20:18,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:20:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229769849] [2023-02-18 01:20:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:20:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:20:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:20:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:20:18,513 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:20:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:18,527 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-18 01:20:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:20:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 01:20:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:18,533 INFO L225 Difference]: With dead ends: 51 [2023-02-18 01:20:18,533 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 01:20:18,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:20:18,537 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:18,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:20:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 01:20:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 01:20:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:20:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-18 01:20:18,579 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-18 01:20:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:18,579 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-18 01:20:18,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:20:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-18 01:20:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:20:18,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:18,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 01:20:18,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:18,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-18 01:20:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:18,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819369413] [2023-02-18 01:20:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:18,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819369413] [2023-02-18 01:20:18,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819369413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:20:18,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:20:18,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 01:20:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003141982] [2023-02-18 01:20:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:20:18,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:20:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:20:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 01:20:18,705 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:20:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:18,767 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-18 01:20:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:20:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 01:20:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:18,769 INFO L225 Difference]: With dead ends: 29 [2023-02-18 01:20:18,769 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 01:20:18,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:20:18,770 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:18,770 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.0s Time] [2023-02-18 01:20:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 01:20:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 01:20:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:20:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-18 01:20:18,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-18 01:20:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:18,781 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-18 01:20:18,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:20:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-18 01:20:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 01:20:18,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:18,782 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:18,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 01:20:18,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-18 01:20:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:18,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437119475] [2023-02-18 01:20:18,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:18,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:18,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328124636] [2023-02-18 01:20:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:18,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:18,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:18,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 01:20:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:18,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:20:18,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:18,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437119475] [2023-02-18 01:20:19,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328124636] [2023-02-18 01:20:19,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328124636] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:19,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:19,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:19,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828734185] [2023-02-18 01:20:19,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:19,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:19,016 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:20:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:19,290 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-18 01:20:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:20:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-02-18 01:20:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:19,293 INFO L225 Difference]: With dead ends: 52 [2023-02-18 01:20:19,293 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 01:20:19,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:19,294 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:19,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:20:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 01:20:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-18 01:20:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:20:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-18 01:20:19,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-18 01:20:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:19,312 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-18 01:20:19,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:20:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-18 01:20:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:20:19,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:19,313 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:19,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:19,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:19,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-18 01:20:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:19,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708672407] [2023-02-18 01:20:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:19,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:19,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887738241] [2023-02-18 01:20:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:19,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:19,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:19,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 01:20:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:19,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:20:19,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:20:19,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:20:19,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:19,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708672407] [2023-02-18 01:20:19,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887738241] [2023-02-18 01:20:19,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887738241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:19,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:19,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849930685] [2023-02-18 01:20:19,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:19,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:19,628 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:20:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:19,791 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-18 01:20:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:20:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 01:20:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:19,793 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:20:19,793 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 01:20:19,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:19,794 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:19,794 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.1s Time] [2023-02-18 01:20:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 01:20:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-18 01:20:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:20:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-18 01:20:19,811 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-18 01:20:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:19,812 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-18 01:20:19,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:20:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-18 01:20:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 01:20:19,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:19,813 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:19,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:20,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 01:20:20,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-18 01:20:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260910921] [2023-02-18 01:20:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:20,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:20,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246591721] [2023-02-18 01:20:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:20,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:20,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 01:20:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:20,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 01:20:20,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:20:20,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:20:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:20,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260910921] [2023-02-18 01:20:20,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:20,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246591721] [2023-02-18 01:20:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246591721] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:20,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:20,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868324541] [2023-02-18 01:20:20,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:20,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:20,147 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:20:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:20,783 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-18 01:20:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:20:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-02-18 01:20:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:20,784 INFO L225 Difference]: With dead ends: 67 [2023-02-18 01:20:20,784 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 01:20:20,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:20,785 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:20,785 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.6s Time] [2023-02-18 01:20:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 01:20:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-18 01:20:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 01:20:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-18 01:20:20,795 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-18 01:20:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:20,795 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-18 01:20:20,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:20:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-18 01:20:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 01:20:20,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:20,796 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:20,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 01:20:21,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:21,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-18 01:20:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:21,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567913145] [2023-02-18 01:20:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:21,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438429846] [2023-02-18 01:20:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:21,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:21,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 01:20:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:21,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:20:21,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 01:20:21,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 01:20:21,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:21,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567913145] [2023-02-18 01:20:21,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:21,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438429846] [2023-02-18 01:20:21,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438429846] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:21,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:21,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 01:20:21,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177571350] [2023-02-18 01:20:21,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:21,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:20:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:20:21,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:21,126 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 01:20:23,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:20:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:23,799 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-18 01:20:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:20:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-18 01:20:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:23,803 INFO L225 Difference]: With dead ends: 82 [2023-02-18 01:20:23,803 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 01:20:23,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:20:23,804 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.6s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:23,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-02-18 01:20:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 01:20:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-18 01:20:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:20:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-18 01:20:23,823 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-18 01:20:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:23,824 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-18 01:20:23,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 01:20:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-18 01:20:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 01:20:23,826 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:23,826 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:23,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 01:20:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:24,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-18 01:20:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:24,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646751293] [2023-02-18 01:20:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:24,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:24,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663542366] [2023-02-18 01:20:24,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:24,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:24,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:24,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:24,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 01:20:24,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:24,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:24,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:20:24,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 01:20:24,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 01:20:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646751293] [2023-02-18 01:20:24,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663542366] [2023-02-18 01:20:24,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663542366] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:24,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:24,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61320374] [2023-02-18 01:20:24,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:24,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:24,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:24,161 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-18 01:20:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:24,666 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-18 01:20:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:20:24,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 56 [2023-02-18 01:20:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:24,667 INFO L225 Difference]: With dead ends: 86 [2023-02-18 01:20:24,667 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 01:20:24,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:24,668 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:24,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 01:20:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 01:20:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 01:20:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:20:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-18 01:20:24,682 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-18 01:20:24,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:24,682 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-18 01:20:24,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-18 01:20:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-18 01:20:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 01:20:24,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:24,683 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:24,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 01:20:24,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:24,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-18 01:20:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:24,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763593593] [2023-02-18 01:20:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:24,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:24,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105963276] [2023-02-18 01:20:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:24,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:24,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 01:20:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:24,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 01:20:24,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 01:20:24,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 01:20:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:25,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763593593] [2023-02-18 01:20:25,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:25,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105963276] [2023-02-18 01:20:25,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105963276] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:25,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:25,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 01:20:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199211642] [2023-02-18 01:20:25,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:25,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:20:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:20:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:25,133 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 01:20:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:25,530 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-18 01:20:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:20:25,530 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2023-02-18 01:20:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:25,531 INFO L225 Difference]: With dead ends: 95 [2023-02-18 01:20:25,531 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 01:20:25,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:20:25,532 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:25,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:20:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 01:20:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-18 01:20:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 01:20:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-18 01:20:25,551 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-18 01:20:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:25,551 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-18 01:20:25,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 01:20:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-18 01:20:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 01:20:25,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:25,552 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:25,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:25,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-18 01:20:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:25,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951713743] [2023-02-18 01:20:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:25,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:25,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149343841] [2023-02-18 01:20:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:25,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:25,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:25,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 01:20:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:25,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 01:20:25,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 01:20:25,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:25,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951713743] [2023-02-18 01:20:25,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:25,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149343841] [2023-02-18 01:20:25,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149343841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:20:25,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:20:25,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 01:20:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256842451] [2023-02-18 01:20:25,947 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:25,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 01:20:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 01:20:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:25,948 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 01:20:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:26,099 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-18 01:20:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:20:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2023-02-18 01:20:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:26,101 INFO L225 Difference]: With dead ends: 97 [2023-02-18 01:20:26,101 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 01:20:26,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:20:26,102 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:26,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:20:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 01:20:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 01:20:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:20:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-18 01:20:26,120 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-18 01:20:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:26,120 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-18 01:20:26,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 01:20:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-18 01:20:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 01:20:26,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:26,121 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:26,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:26,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:26,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-18 01:20:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:26,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76520488] [2023-02-18 01:20:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:26,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213138072] [2023-02-18 01:20:26,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:20:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:26,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:26,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:26,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 01:20:26,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 01:20:26,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:26,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 01:20:26,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 01:20:26,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 01:20:26,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:26,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76520488] [2023-02-18 01:20:26,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:26,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213138072] [2023-02-18 01:20:26,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213138072] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:26,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:26,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 01:20:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018464685] [2023-02-18 01:20:26,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:26,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:20:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:26,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:20:26,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:20:26,591 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 01:20:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:27,457 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-18 01:20:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:20:27,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 78 [2023-02-18 01:20:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:27,458 INFO L225 Difference]: With dead ends: 110 [2023-02-18 01:20:27,458 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 01:20:27,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:20:27,459 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:27,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 01:20:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 01:20:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-18 01:20:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:20:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-18 01:20:27,483 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-18 01:20:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:27,483 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-18 01:20:27,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 01:20:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-18 01:20:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 01:20:27,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:27,487 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:27,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:27,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 01:20:27,692 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-18 01:20:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:27,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589050672] [2023-02-18 01:20:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:27,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:27,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230828949] [2023-02-18 01:20:27,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:27,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:27,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:27,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:27,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 01:20:27,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:27,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:27,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 01:20:27,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 78 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-18 01:20:27,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:28,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589050672] [2023-02-18 01:20:28,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230828949] [2023-02-18 01:20:28,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230828949] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:20:28,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:20:28,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 01:20:28,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852808058] [2023-02-18 01:20:28,154 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:28,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:20:28,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:20:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:20:28,155 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 01:20:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:28,455 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-18 01:20:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:20:28,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2023-02-18 01:20:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:28,457 INFO L225 Difference]: With dead ends: 111 [2023-02-18 01:20:28,457 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 01:20:28,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:20:28,457 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:28,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:20:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 01:20:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-18 01:20:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:20:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-18 01:20:28,480 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 99 [2023-02-18 01:20:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:28,480 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-18 01:20:28,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 01:20:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-18 01:20:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-18 01:20:28,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:28,481 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:28,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:28,690 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-18 01:20:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:28,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442102968] [2023-02-18 01:20:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:28,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:28,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:28,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944074799] [2023-02-18 01:20:28,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:28,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:28,706 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:28,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 01:20:28,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:28,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:28,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-18 01:20:28,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-02-18 01:20:28,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2023-02-18 01:20:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442102968] [2023-02-18 01:20:29,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944074799] [2023-02-18 01:20:29,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944074799] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:29,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-18 01:20:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93524678] [2023-02-18 01:20:29,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:29,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 01:20:29,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 01:20:29,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:20:29,056 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 01:20:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:31,924 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-02-18 01:20:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:20:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 121 [2023-02-18 01:20:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:31,925 INFO L225 Difference]: With dead ends: 127 [2023-02-18 01:20:31,925 INFO L226 Difference]: Without dead ends: 125 [2023-02-18 01:20:31,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-02-18 01:20:31,926 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:31,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 119 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-18 01:20:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-18 01:20:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2023-02-18 01:20:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.03125) internal successors, (66), 65 states have internal predecessors, (66), 24 states have call successors, (24), 17 states have call predecessors, (24), 17 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:20:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2023-02-18 01:20:31,944 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 121 [2023-02-18 01:20:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:31,944 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2023-02-18 01:20:31,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 01:20:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2023-02-18 01:20:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-18 01:20:31,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:31,945 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:31,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:32,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 01:20:32,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2023-02-18 01:20:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056318370] [2023-02-18 01:20:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:32,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:32,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046757982] [2023-02-18 01:20:32,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:20:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:32,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:32,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 01:20:32,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 01:20:32,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:32,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-18 01:20:32,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 234 proven. 61 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2023-02-18 01:20:34,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:34,991 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-18 01:20:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:34,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056318370] [2023-02-18 01:20:34,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:34,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046757982] [2023-02-18 01:20:34,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046757982] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:34,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:34,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2023-02-18 01:20:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248807199] [2023-02-18 01:20:34,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:34,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 01:20:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 01:20:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:20:34,993 INFO L87 Difference]: Start difference. First operand 106 states and 113 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-18 01:20:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:36,049 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-18 01:20:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:20:36,049 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-18 01:20:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:36,050 INFO L225 Difference]: With dead ends: 112 [2023-02-18 01:20:36,050 INFO L226 Difference]: Without dead ends: 108 [2023-02-18 01:20:36,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-02-18 01:20:36,051 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:36,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 53 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 01:20:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-18 01:20:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-02-18 01:20:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 24 states have call successors, (24), 18 states have call predecessors, (24), 17 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:20:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2023-02-18 01:20:36,070 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 126 [2023-02-18 01:20:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:36,070 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2023-02-18 01:20:36,071 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-18 01:20:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2023-02-18 01:20:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-18 01:20:36,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:36,072 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:36,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-18 01:20:36,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 01:20:36,277 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954085, now seen corresponding path program 1 times [2023-02-18 01:20:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:36,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116152317] [2023-02-18 01:20:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:36,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:36,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:36,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296102358] [2023-02-18 01:20:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:36,286 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:36,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 01:20:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:36,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-18 01:20:36,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 104 proven. 110 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-18 01:20:36,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:37,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116152317] [2023-02-18 01:20:37,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:37,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296102358] [2023-02-18 01:20:37,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296102358] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:20:37,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:20:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-18 01:20:37,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207927679] [2023-02-18 01:20:37,361 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:37,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:37,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:20:37,363 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-18 01:20:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:37,888 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2023-02-18 01:20:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:20:37,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 131 [2023-02-18 01:20:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:37,889 INFO L225 Difference]: With dead ends: 139 [2023-02-18 01:20:37,889 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 01:20:37,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-02-18 01:20:37,890 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:37,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 106 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 01:20:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 01:20:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-02-18 01:20:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 29 states have call successors, (29), 20 states have call predecessors, (29), 19 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-02-18 01:20:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2023-02-18 01:20:37,914 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 131 [2023-02-18 01:20:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:37,915 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2023-02-18 01:20:37,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-18 01:20:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2023-02-18 01:20:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-02-18 01:20:37,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:37,916 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:37,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:38,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 01:20:38,121 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1608982942, now seen corresponding path program 2 times [2023-02-18 01:20:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:38,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727711266] [2023-02-18 01:20:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:38,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:38,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224343053] [2023-02-18 01:20:38,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:38,135 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:38,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 01:20:38,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:38,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:38,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 01:20:38,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2023-02-18 01:20:38,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:20:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:38,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727711266] [2023-02-18 01:20:38,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:38,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224343053] [2023-02-18 01:20:38,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224343053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:20:38,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:20:38,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 01:20:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043452793] [2023-02-18 01:20:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:20:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:20:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:20:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:20:38,235 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2023-02-18 01:20:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:38,321 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2023-02-18 01:20:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:20:38,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 158 [2023-02-18 01:20:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:38,323 INFO L225 Difference]: With dead ends: 135 [2023-02-18 01:20:38,323 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:20:38,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-02-18 01:20:38,324 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:38,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:20:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:20:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:20:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:20:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:20:38,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2023-02-18 01:20:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:38,325 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:20:38,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2023-02-18 01:20:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:20:38,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:20:38,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:20:38,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 01:20:38,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:20:38,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:20:38,550 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse13 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse37 (not .cse15)) (.cse16 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse45 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse12 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse44 (or .cse15 (let ((.cse56 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse55 (<= (+ .cse56 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse37 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse55) (or (not .cse55) (not (<= (+ .cse56 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse16)) .cse45))))) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse18 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse49 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse13) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse10 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (+ (* (- 1) .cse16) |ULTIMATE.start_main_~y~0#1|)) (.cse51 (+ (- 5) 12)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 0 1)) (.cse52 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse43 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (= (+ (- 6) (+ (+ .cse52 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse43)) 0)) (.cse11 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse19 (<= |ULTIMATE.start_main_~n~0#1| .cse3)) (.cse21 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse22 (= |ULTIMATE.start_main_~z~0#1| (+ .cse1 6))) (.cse25 (+ (+ .cse51 (* (- 1) (+ (- 1) .cse51))) 0)) (.cse26 (* (- 1) .cse51)) (.cse4 (+ 6 1)) (.cse0 (= (+ (+ (- (* .cse16 6)) (+ (* .cse16 .cse16) (- (* .cse28 12)))) 12) 0)) (.cse7 (or .cse37 .cse49 .cse10)) (.cse8 (or (and (or (not .cse5) (not .cse18)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse18))) (.cse24 (+ 6 12)) (.cse34 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse20 (let ((.cse53 (= (+ (let ((.cse54 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse54 (* .cse54 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse44 .cse53) (and .cse44 (or .cse37 .cse53))))) (.cse17 (= .cse12 (* .cse14 (* .cse14 .cse14)))) (.cse35 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse52 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse9 (+ 6 6)) (.cse23 (<= .cse2 |ULTIMATE.start_main_~a~0#1|)) (.cse27 (+ .cse51 12))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse0 (= .cse1 6) (= .cse2 0) (= |ULTIMATE.start_main_~x~0#1| .cse3) (= |ULTIMATE.start_main_~n~0#1| .cse3) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 (= .cse9 |ULTIMATE.start_main_~z~0#1|) (or (not .cse10) (= (+ (+ (- (* .cse11 .cse12)) (* .cse12 .cse13)) (* .cse12 12)) 0) (< .cse14 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse15 (= |ULTIMATE.start_main_~y~0#1| (+ .cse16 1)) .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~y~0#1| (+ .cse16 |ULTIMATE.start_main_~x~0#1|)) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse2) .cse21 .cse22 (= .cse16 6) .cse23 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse1)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse30 (+ 2 1)) (.cse29 (<= 2 |ULTIMATE.start_main_~a~0#1|))) (and (<= 2 .cse2) .cse0 .cse5 (= .cse16 .cse24) (= .cse25 (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) .cse26)) .cse8 .cse15 .cse18 (= .cse27 .cse28) .cse29 .cse23 (<= |ULTIMATE.start_main_~n~0#1| .cse30) (let ((.cse32 (let ((.cse41 (+ 6 (* .cse14 6)))) (let ((.cse42 (not (= .cse41 .cse11))) (.cse40 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse33 (or .cse42 (= (+ (+ (+ (- (* .cse40 12)) (+ (- (* .cse12 18)) (* .cse41 .cse40))) (* .cse41 2)) (- 6)) 0))) (.cse36 (or (= 0 (+ (- 6) (let ((.cse38 (+ 6 (* 6 (+ .cse14 1))))) (+ (* 2 .cse38) (let ((.cse39 (+ .cse41 .cse40))) (+ (+ (* .cse39 .cse38) (- (* 18 (+ .cse12 .cse40)))) (- (* .cse39 12)))))))) .cse42))) (or (and .cse5 .cse6 .cse8 .cse33 .cse18 .cse34 .cse20 .cse35 .cse36) (and .cse5 .cse8 .cse33 .cse18 .cse34 .cse20 .cse35 .cse36 (or .cse37 .cse6)))))))) (or (let ((.cse31 (+ (- 11) 19))) (and (= (+ (+ (+ 19 (* (- 1) .cse31) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse31)) (= .cse30 |ULTIMATE.start_main_~n~0#1|) .cse32 .cse29)) (and .cse7 .cse32))))) (and (= (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse13))) .cse43) (- 10)) 0) .cse0 .cse5 .cse44 .cse8 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse15 (= |ULTIMATE.start_main_~y~0#1| 1) .cse18 .cse19 .cse45 .cse21 .cse22 (= |ULTIMATE.start_main_~x~0#1| 0) .cse23 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse50 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) 1))) (let ((.cse46 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse48 (+ .cse50 (- 6)))) (and (= .cse25 (+ |ULTIMATE.start_main_~x~0#1| .cse26)) (= .cse28 .cse4) .cse0 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse28 1)) .cse7 .cse8 (= .cse9 .cse46) (let ((.cse47 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse47)) .cse48) .cse47)) .cse15 (<= 1 .cse2) (= |ULTIMATE.start_main_~z~0#1| .cse24) (or .cse49 .cse10) (= (+ .cse50 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse46) |ULTIMATE.start_main_~z~0#1|) .cse18 .cse34 .cse20 (or .cse37 .cse17) (= 6 .cse48) (= .cse2 .cse3) .cse35 (= .cse9 .cse16) .cse23 (= .cse27 |ULTIMATE.start_main_~y~0#1|) (= 0 (+ (- 1) .cse2)))))))))) [2023-02-18 01:20:38,550 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse31 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse11 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse28 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse23 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse26 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse32 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse13 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (not .cse31)) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse36 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse42 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse2 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse38 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse20 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse38) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse3 (+ (* (- 1) .cse2) |ULTIMATE.start_main_~y~0#1|)) (.cse17 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse42 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse33 (<= .cse36 |ULTIMATE.start_main_~a~0#1|)) (.cse5 (= (+ (- 6) (+ (+ .cse42 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse0 (or .cse31 (let ((.cse41 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse40 (<= (+ .cse41 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse19 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse40) (or (not .cse40) (not (<= (+ .cse41 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse2)) .cse1))))) (.cse6 (= (+ (let ((.cse39 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse39 (* .cse39 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (or (and (or (not .cse4) (not .cse13)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse4 .cse13))) (.cse9 (or .cse11 (= (+ (+ (- (* .cse28 .cse23)) (* .cse23 .cse38)) (* .cse23 12)) 0) (< .cse26 .cse32))) (.cse12 (= .cse23 (* .cse26 (* .cse26 .cse26)))) (.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 .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse29 (+ (- 5) 12)) (.cse30 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse16 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse15 (+ 2 1))) (and (= (+ (+ (- (* .cse2 6)) (+ (* .cse2 .cse2) (- (* .cse3 12)))) 12) 0) (let ((.cse25 (+ 6 (* .cse26 6)))) (let ((.cse27 (not (= .cse25 .cse28))) (.cse24 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse10 (or .cse27 (= (+ (+ (+ (- (* .cse24 12)) (+ (- (* .cse23 18)) (* .cse25 .cse24))) (* .cse25 2)) (- 6)) 0))) (.cse18 (or (= 0 (+ (- 6) (let ((.cse21 (+ 6 (* 6 (+ .cse26 1))))) (+ (* 2 .cse21) (let ((.cse22 (+ .cse25 .cse24))) (+ (+ (* .cse22 .cse21) (- (* 18 (+ .cse23 .cse24)))) (- (* .cse22 12)))))))) .cse27))) (or (let ((.cse7 (+ (- 11) 19))) (and .cse4 .cse5 .cse0 .cse6 (= (+ (+ (+ 19 (* (- 1) .cse7) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse7)) .cse13 .cse14 (= .cse15 |ULTIMATE.start_main_~n~0#1|) .cse16 .cse17 .cse18)) (and .cse4 .cse5 .cse0 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 (or .cse19 .cse20) .cse17 .cse18))))) .cse4 (= .cse2 (+ 6 12)) (= (+ (+ .cse29 (* (- 1) (+ (- 1) .cse29))) 0) (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) (* (- 1) .cse29))) (<= (+ (- 1) .cse30) |ULTIMATE.start_main_~a~0#1|) .cse8 .cse31 .cse13 (<= .cse32 3) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (= (+ .cse29 12) .cse3) (not (<= .cse30 |ULTIMATE.start_main_~a~0#1|)) .cse16 .cse33 (<= |ULTIMATE.start_main_~n~0#1| .cse15))) (let ((.cse35 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse34 (+ 6 6))) (and (= .cse3 (+ 6 1)) .cse20 .cse4 .cse5 .cse0 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ .cse3 1)) .cse8 (= .cse34 .cse35) .cse9 .cse11 .cse12 (= (+ 6 .cse35) |ULTIMATE.start_main_~z~0#1|) .cse13 .cse14 .cse17 (= .cse34 .cse2) .cse33 (= 0 (+ (- 1) .cse36)))) (let ((.cse37 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse37) (= |ULTIMATE.start_main_~n~0#1| .cse37) .cse4 .cse5 .cse0 .cse6 .cse8 .cse9 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse2 1)) .cse12 (<= .cse32 1) .cse13 (<= |ULTIMATE.start_main_~n~0#1| .cse37) .cse14 (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse2 6))))))) [2023-02-18 01:20:38,550 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 (= 6 |ULTIMATE.start_main_~z~0#1|)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse8 (let ((.cse10 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse9 (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse8) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse9) (or (not .cse9) (not (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) .cse2))))))) (or (and .cse6 (= (+ (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse7 (* .cse7 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse6 .cse1 .cse2 .cse4))))) (or (and (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse5) (and .cse2 .cse3 .cse5 .cse4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ (- 6) (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 12)) (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0))))) [2023-02-18 01:20:38,551 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse19 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse0 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse32 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse35 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse36 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse13 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse36) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse4 (= (+ (- 6) (+ (+ .cse35 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse28 (or .cse24 (let ((.cse39 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse38 (<= (+ .cse39 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse24) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse38) (or (not .cse38) (not (<= (+ .cse39 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse0)) .cse32))))) (.cse29 (= (+ (let ((.cse37 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse37 (* .cse37 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (or (and (or (not .cse3) (not .cse9)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3 .cse9))) (.cse30 (= .cse16 (* .cse19 (* .cse19 .cse19)))) (.cse31 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse8 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse21 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1))) (let ((.cse2 (let ((.cse33 (or .cse8 (= (+ (+ (- (* .cse21 .cse16)) (* .cse16 .cse36)) (* .cse16 12)) 0) (< .cse19 .cse25))) (.cse34 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse35 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0))) (or (and .cse3 .cse4 .cse28 .cse29 .cse6 .cse33 .cse30 .cse9 .cse31 .cse34) (and .cse13 .cse3 .cse4 .cse28 .cse29 .cse6 .cse33 .cse30 .cse9 .cse31 .cse34)))) (.cse1 (+ (* (- 1) .cse0) |ULTIMATE.start_main_~y~0#1|)) (.cse26 (+ (- 1) |ULTIMATE.start_main_~n~0#1|))) (or (let ((.cse22 (+ (- 5) 12)) (.cse23 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse11 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse10 (+ 2 1))) (and (= (+ (+ (- (* .cse0 6)) (+ (* .cse0 .cse0) (- (* .cse1 12)))) 12) 0) (let ((.cse18 (+ 6 (* .cse19 6)))) (let ((.cse20 (not (= .cse18 .cse21))) (.cse17 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse7 (or .cse20 (= (+ (+ (+ (- (* .cse17 12)) (+ (- (* .cse16 18)) (* .cse18 .cse17))) (* .cse18 2)) (- 6)) 0))) (.cse12 (or (= 0 (+ (- 6) (let ((.cse14 (+ 6 (* 6 (+ .cse19 1))))) (+ (* 2 .cse14) (let ((.cse15 (+ .cse18 .cse17))) (+ (+ (* .cse15 .cse14) (- (* 18 (+ .cse16 .cse17)))) (- (* .cse15 12)))))))) .cse20))) (or (let ((.cse5 (+ (- 11) 19))) (and .cse2 .cse3 .cse4 (= (+ (+ (+ 19 (* (- 1) .cse5) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse5)) .cse9 (= .cse10 |ULTIMATE.start_main_~n~0#1|) .cse11 .cse12)) (and .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 .cse9 .cse12))))) .cse3 (= .cse0 (+ 6 12)) (= (+ (+ .cse22 (* (- 1) (+ (- 1) .cse22))) 0) (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) (* (- 1) .cse22))) (<= (+ (- 1) .cse23) |ULTIMATE.start_main_~a~0#1|) .cse6 .cse24 .cse9 (<= .cse25 3) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (= (+ .cse22 12) .cse1) (not (<= .cse23 |ULTIMATE.start_main_~a~0#1|)) .cse11 (<= .cse26 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| .cse10))) (and .cse2 (= .cse1 (+ 6 1)) .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ .cse1 1)) .cse6 .cse9 (= (+ 6 6) .cse0) (= 0 (+ (- 1) .cse26))) (let ((.cse27 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse27) (= |ULTIMATE.start_main_~n~0#1| .cse27) .cse4 .cse28 .cse29 (= |ULTIMATE.start_main_~y~0#1| (+ .cse0 1)) .cse30 .cse31 (= .cse0 6))) (and .cse28 (= |ULTIMATE.start_main_~y~0#1| 1) .cse32 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)))))) [2023-02-18 01:20:38,551 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse19 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse29 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse24 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse27 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse31 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse14 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse30 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse35 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse41 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse2 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse37 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse8 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse37) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse3 (+ (* (- 1) .cse2) |ULTIMATE.start_main_~y~0#1|)) (.cse16 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse41 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse32 (<= .cse35 |ULTIMATE.start_main_~a~0#1|)) (.cse9 (= (+ (- 6) (+ (+ .cse41 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse0 (or .cse30 (let ((.cse40 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse39 (<= (+ .cse40 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse30) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse39) (or (not .cse39) (not (<= (+ .cse40 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse2)) .cse1))))) (.cse10 (= (+ (let ((.cse38 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse38 (* .cse38 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse7 (or (and (or (not .cse4) (not .cse14)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse4 .cse14))) (.cse11 (or .cse19 (= (+ (+ (- (* .cse29 .cse24)) (* .cse24 .cse37)) (* .cse24 12)) 0) (< .cse27 .cse31))) (.cse13 (= .cse24 (* .cse27 (* .cse27 .cse27)))) (.cse15 (= |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 (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse5 (+ (- 5) 12)) (.cse6 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse21 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (+ 2 1))) (and (= (+ (+ (- (* .cse2 6)) (+ (* .cse2 .cse2) (- (* .cse3 12)))) 12) 0) .cse4 (= .cse2 (+ 6 12)) (= (+ (+ .cse5 (* (- 1) (+ (- 1) .cse5))) 0) (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) (* (- 1) .cse5))) (<= (+ (- 1) .cse6) |ULTIMATE.start_main_~a~0#1|) .cse7 (let ((.cse26 (+ 6 (* .cse27 6)))) (let ((.cse28 (not (= .cse26 .cse29))) (.cse25 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse12 (or .cse28 (= (+ (+ (+ (- (* .cse25 12)) (+ (- (* .cse24 18)) (* .cse26 .cse25))) (* .cse26 2)) (- 6)) 0))) (.cse17 (or (= 0 (+ (- 6) (let ((.cse22 (+ 6 (* 6 (+ .cse27 1))))) (+ (* 2 .cse22) (let ((.cse23 (+ .cse26 .cse25))) (+ (+ (* .cse23 .cse22) (- (* 18 (+ .cse24 .cse25)))) (- (* .cse23 12)))))))) .cse28))) (or (and .cse8 .cse4 .cse9 .cse0 .cse10 .cse7 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ (- 11) 19))) (and .cse4 .cse9 .cse0 .cse10 (= (+ (+ (+ 19 (* (- 1) .cse18) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse7 .cse11 .cse12 .cse19 .cse13 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse18)) .cse14 .cse15 (= .cse20 |ULTIMATE.start_main_~n~0#1|) .cse21 .cse16 .cse17)))))) .cse30 .cse14 (<= .cse31 3) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (= (+ .cse5 12) .cse3) (not (<= .cse6 |ULTIMATE.start_main_~a~0#1|)) .cse21 .cse32 (<= |ULTIMATE.start_main_~n~0#1| .cse20))) (let ((.cse34 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse33 (+ 6 6))) (and (= .cse3 (+ 6 1)) .cse8 .cse4 .cse9 .cse0 .cse10 (= |ULTIMATE.start_main_~x~0#1| (+ .cse3 1)) .cse7 (= .cse33 .cse34) .cse11 .cse19 .cse13 (= (+ 6 .cse34) |ULTIMATE.start_main_~z~0#1|) .cse14 .cse15 .cse16 (= .cse33 .cse2) .cse32 (= 0 (+ (- 1) .cse35)))) (let ((.cse36 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse36) (= |ULTIMATE.start_main_~n~0#1| .cse36) .cse4 .cse9 .cse0 .cse10 .cse7 .cse11 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse2 1)) .cse13 (<= .cse31 1) .cse14 (<= |ULTIMATE.start_main_~n~0#1| .cse36) .cse15 (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse2 6)))))) [2023-02-18 01:20:38,551 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 01:20:38,551 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:20:38,551 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-18 01:20:38,551 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-18 01:20:38,551 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse15 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse2 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse16 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse47 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse12 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse51 (not .cse17)) (.cse43 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse41 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse49 (+ (- 5) 12)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 0 1)) (.cse50 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse42 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (= (+ (- 6) (+ (+ .cse50 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse42)) 0)) (.cse13 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse21 (<= |ULTIMATE.start_main_~n~0#1| .cse3)) (.cse23 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ .cse1 6))) (.cse27 (+ (+ .cse49 (* (- 1) (+ (- 1) .cse49))) 0)) (.cse28 (* (- 1) .cse49)) (.cse4 (+ 6 1)) (.cse0 (= (+ (+ (- (* .cse18 6)) (+ (* .cse18 .cse18) (- (* .cse41 12)))) 12) 0)) (.cse7 (or .cse17 (let ((.cse54 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse53 (<= (+ .cse54 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse51 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse53) (or (not .cse53) (not (<= (+ .cse54 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse43))))) (.cse8 (= (+ (let ((.cse52 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse52 (* .cse52 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse9 (or .cse51 .cse47 .cse12)) (.cse10 (or (and (or (not .cse5) (not .cse20)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse20))) (.cse26 (+ 6 12)) (.cse19 (= .cse14 (* .cse16 (* .cse16 .cse16)))) (.cse22 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse30 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse50 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse11 (+ 6 6)) (.cse25 (<= .cse2 |ULTIMATE.start_main_~a~0#1|)) (.cse40 (+ .cse49 12))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse0 (= .cse1 6) (= .cse2 0) (= |ULTIMATE.start_main_~x~0#1| .cse3) (= |ULTIMATE.start_main_~n~0#1| .cse3) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |ULTIMATE.start_main_~z~0#1|) (or (not .cse12) (= (+ (+ (- (* .cse13 .cse14)) (* .cse14 .cse15)) (* .cse14 12)) 0) (< .cse16 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 |ULTIMATE.start_main_~x~0#1|)) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse2) .cse23 .cse24 (= .cse18 6) .cse25 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse1)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse34 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse33 (+ 2 1))) (and (<= 2 .cse2) .cse0 .cse5 (= .cse18 .cse26) (= .cse27 (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) .cse28)) .cse10 .cse17 (let ((.cse38 (+ 6 (* .cse16 6)))) (let ((.cse39 (not (= .cse38 .cse13))) (.cse37 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse29 (or .cse39 (= (+ (+ (+ (- (* .cse37 12)) (+ (- (* .cse14 18)) (* .cse38 .cse37))) (* .cse38 2)) (- 6)) 0))) (.cse31 (or (= 0 (+ (- 6) (let ((.cse35 (+ 6 (* 6 (+ .cse16 1))))) (+ (* 2 .cse35) (let ((.cse36 (+ .cse38 .cse37))) (+ (+ (* .cse36 .cse35) (- (* 18 (+ .cse14 .cse37)))) (- (* .cse36 12)))))))) .cse39))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse19 .cse20 .cse22 .cse30 .cse31) (let ((.cse32 (+ (- 11) 19))) (and .cse5 .cse6 .cse7 .cse8 (= (+ (+ (+ 19 (* (- 1) .cse32) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse10 .cse29 .cse19 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse32)) .cse20 .cse22 (= .cse33 |ULTIMATE.start_main_~n~0#1|) .cse34 .cse30 .cse31)))))) .cse20 (= .cse40 .cse41) .cse34 .cse25 (<= |ULTIMATE.start_main_~n~0#1| .cse33))) (and (= (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse15))) .cse42) (- 10)) 0) .cse0 .cse5 .cse7 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse17 (= |ULTIMATE.start_main_~y~0#1| 1) .cse20 .cse21 .cse43 .cse23 .cse24 (= |ULTIMATE.start_main_~x~0#1| 0) .cse25 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse48 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) 1))) (let ((.cse44 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse46 (+ .cse48 (- 6)))) (and (= .cse27 (+ |ULTIMATE.start_main_~x~0#1| .cse28)) (= .cse41 .cse4) .cse0 .cse5 .cse7 .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ .cse41 1)) .cse9 .cse10 (= .cse11 .cse44) (let ((.cse45 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse45)) .cse46) .cse45)) .cse17 (<= 1 .cse2) (= |ULTIMATE.start_main_~z~0#1| .cse26) (or .cse47 .cse12) .cse19 (= (+ .cse48 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse44) |ULTIMATE.start_main_~z~0#1|) .cse20 .cse22 (= 6 .cse46) (= .cse2 .cse3) .cse30 (= .cse11 .cse18) .cse25 (= .cse40 |ULTIMATE.start_main_~y~0#1|) (= 0 (+ (- 1) .cse2))))))))) [2023-02-18 01:20:38,552 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse13 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse37 (not .cse15)) (.cse16 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse45 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse12 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse44 (or .cse15 (let ((.cse56 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse55 (<= (+ .cse56 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse37 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse55) (or (not .cse55) (not (<= (+ .cse56 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse16)) .cse45))))) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse18 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse49 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse13) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse10 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse28 (+ (* (- 1) .cse16) |ULTIMATE.start_main_~y~0#1|)) (.cse51 (+ (- 5) 12)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 0 1)) (.cse52 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse43 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (= (+ (- 6) (+ (+ .cse52 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse43)) 0)) (.cse11 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse19 (<= |ULTIMATE.start_main_~n~0#1| .cse3)) (.cse21 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse22 (= |ULTIMATE.start_main_~z~0#1| (+ .cse1 6))) (.cse25 (+ (+ .cse51 (* (- 1) (+ (- 1) .cse51))) 0)) (.cse26 (* (- 1) .cse51)) (.cse4 (+ 6 1)) (.cse0 (= (+ (+ (- (* .cse16 6)) (+ (* .cse16 .cse16) (- (* .cse28 12)))) 12) 0)) (.cse7 (or .cse37 .cse49 .cse10)) (.cse8 (or (and (or (not .cse5) (not .cse18)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse18))) (.cse24 (+ 6 12)) (.cse34 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse20 (let ((.cse53 (= (+ (let ((.cse54 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse54 (* .cse54 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse44 .cse53) (and .cse44 (or .cse37 .cse53))))) (.cse17 (= .cse12 (* .cse14 (* .cse14 .cse14)))) (.cse35 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse52 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse9 (+ 6 6)) (.cse23 (<= .cse2 |ULTIMATE.start_main_~a~0#1|)) (.cse27 (+ .cse51 12))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse0 (= .cse1 6) (= .cse2 0) (= |ULTIMATE.start_main_~x~0#1| .cse3) (= |ULTIMATE.start_main_~n~0#1| .cse3) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 (= .cse9 |ULTIMATE.start_main_~z~0#1|) (or (not .cse10) (= (+ (+ (- (* .cse11 .cse12)) (* .cse12 .cse13)) (* .cse12 12)) 0) (< .cse14 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse15 (= |ULTIMATE.start_main_~y~0#1| (+ .cse16 1)) .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~y~0#1| (+ .cse16 |ULTIMATE.start_main_~x~0#1|)) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse2) .cse21 .cse22 (= .cse16 6) .cse23 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse1)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse30 (+ 2 1)) (.cse29 (<= 2 |ULTIMATE.start_main_~a~0#1|))) (and (<= 2 .cse2) .cse0 .cse5 (= .cse16 .cse24) (= .cse25 (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) .cse26)) .cse8 .cse15 .cse18 (= .cse27 .cse28) .cse29 .cse23 (<= |ULTIMATE.start_main_~n~0#1| .cse30) (let ((.cse32 (let ((.cse41 (+ 6 (* .cse14 6)))) (let ((.cse42 (not (= .cse41 .cse11))) (.cse40 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse33 (or .cse42 (= (+ (+ (+ (- (* .cse40 12)) (+ (- (* .cse12 18)) (* .cse41 .cse40))) (* .cse41 2)) (- 6)) 0))) (.cse36 (or (= 0 (+ (- 6) (let ((.cse38 (+ 6 (* 6 (+ .cse14 1))))) (+ (* 2 .cse38) (let ((.cse39 (+ .cse41 .cse40))) (+ (+ (* .cse39 .cse38) (- (* 18 (+ .cse12 .cse40)))) (- (* .cse39 12)))))))) .cse42))) (or (and .cse5 .cse6 .cse8 .cse33 .cse18 .cse34 .cse20 .cse35 .cse36) (and .cse5 .cse8 .cse33 .cse18 .cse34 .cse20 .cse35 .cse36 (or .cse37 .cse6)))))))) (or (let ((.cse31 (+ (- 11) 19))) (and (= (+ (+ (+ 19 (* (- 1) .cse31) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse31)) (= .cse30 |ULTIMATE.start_main_~n~0#1|) .cse32 .cse29)) (and .cse7 .cse32))))) (and (= (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse13))) .cse43) (- 10)) 0) .cse0 .cse5 .cse44 .cse8 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse15 (= |ULTIMATE.start_main_~y~0#1| 1) .cse18 .cse19 .cse45 .cse21 .cse22 (= |ULTIMATE.start_main_~x~0#1| 0) .cse23 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse50 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) 1))) (let ((.cse46 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse48 (+ .cse50 (- 6)))) (and (= .cse25 (+ |ULTIMATE.start_main_~x~0#1| .cse26)) (= .cse28 .cse4) .cse0 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse28 1)) .cse7 .cse8 (= .cse9 .cse46) (let ((.cse47 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse47)) .cse48) .cse47)) .cse15 (<= 1 .cse2) (= |ULTIMATE.start_main_~z~0#1| .cse24) (or .cse49 .cse10) (= (+ .cse50 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse46) |ULTIMATE.start_main_~z~0#1|) .cse18 .cse34 .cse20 (or .cse37 .cse17) (= 6 .cse48) (= .cse2 .cse3) .cse35 (= .cse9 .cse16) .cse23 (= .cse27 |ULTIMATE.start_main_~y~0#1|) (= 0 (+ (- 1) .cse2)))))))))) [2023-02-18 01:20:38,552 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse15 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse2 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse16 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse47 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse12 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse51 (not .cse17)) (.cse43 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse41 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse49 (+ (- 5) 12)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 0 1)) (.cse50 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse42 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (= (+ (- 6) (+ (+ .cse50 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse42)) 0)) (.cse13 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse21 (<= |ULTIMATE.start_main_~n~0#1| .cse3)) (.cse22 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ .cse1 6))) (.cse38 (+ (+ .cse49 (* (- 1) (+ (- 1) .cse49))) 0)) (.cse39 (* (- 1) .cse49)) (.cse4 (+ 6 1)) (.cse0 (= (+ (+ (- (* .cse18 6)) (+ (* .cse18 .cse18) (- (* .cse41 12)))) 12) 0)) (.cse7 (or .cse17 (let ((.cse54 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse53 (<= (+ .cse54 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse51 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse53) (or (not .cse53) (not (<= (+ .cse54 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse43))))) (.cse8 (= (+ (let ((.cse52 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse52 (* .cse52 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse9 (or .cse51 .cse47 .cse12)) (.cse10 (or (and (or (not .cse5) (not .cse20)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse20))) (.cse37 (+ 6 12)) (.cse19 (= .cse14 (* .cse16 (* .cse16 .cse16)))) (.cse27 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse30 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse50 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse11 (+ 6 6)) (.cse24 (<= .cse2 |ULTIMATE.start_main_~a~0#1|)) (.cse40 (+ .cse49 12))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse0 (= .cse1 6) (= .cse2 0) (= |ULTIMATE.start_main_~x~0#1| .cse3) (= |ULTIMATE.start_main_~n~0#1| .cse3) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |ULTIMATE.start_main_~z~0#1|) (or (not .cse12) (= (+ (+ (- (* .cse13 .cse14)) (* .cse14 .cse15)) (* .cse14 12)) 0) (< .cse16 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 |ULTIMATE.start_main_~x~0#1|)) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse2) .cse22 .cse23 (= .cse18 6) .cse24 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse1)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse29 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse28 (+ 2 1))) (and (<= 2 .cse2) .cse0 (let ((.cse35 (+ 6 (* .cse16 6)))) (let ((.cse36 (not (= .cse35 .cse13))) (.cse34 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse26 (or .cse36 (= (+ (+ (+ (- (* .cse34 12)) (+ (- (* .cse14 18)) (* .cse35 .cse34))) (* .cse35 2)) (- 6)) 0))) (.cse31 (or (= 0 (+ (- 6) (let ((.cse32 (+ 6 (* 6 (+ .cse16 1))))) (+ (* 2 .cse32) (let ((.cse33 (+ .cse35 .cse34))) (+ (+ (* .cse33 .cse32) (- (* 18 (+ .cse14 .cse34)))) (- (* .cse33 12)))))))) .cse36))) (or (let ((.cse25 (+ (- 11) 19))) (and .cse5 .cse6 .cse7 .cse8 (= (+ (+ (+ 19 (* (- 1) .cse25) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse10 .cse26 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse25)) .cse20 .cse27 (= .cse28 |ULTIMATE.start_main_~n~0#1|) .cse29 .cse30 .cse31)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse20 .cse27 .cse30 .cse31))))) .cse5 (= .cse18 .cse37) (= .cse38 (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) .cse39)) .cse10 .cse17 .cse20 (= .cse40 .cse41) .cse29 .cse24 (<= |ULTIMATE.start_main_~n~0#1| .cse28))) (and (= (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse15))) .cse42) (- 10)) 0) .cse0 .cse5 .cse7 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse17 (= |ULTIMATE.start_main_~y~0#1| 1) .cse20 .cse21 .cse43 .cse22 .cse23 (= |ULTIMATE.start_main_~x~0#1| 0) .cse24 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse48 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) 1))) (let ((.cse44 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse46 (+ .cse48 (- 6)))) (and (= .cse38 (+ |ULTIMATE.start_main_~x~0#1| .cse39)) (= .cse41 .cse4) .cse0 .cse5 .cse7 .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ .cse41 1)) .cse9 .cse10 (= .cse11 .cse44) (let ((.cse45 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse45)) .cse46) .cse45)) .cse17 (<= 1 .cse2) (= |ULTIMATE.start_main_~z~0#1| .cse37) (or .cse47 .cse12) .cse19 (= (+ .cse48 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse44) |ULTIMATE.start_main_~z~0#1|) .cse20 .cse27 (= 6 .cse46) (= .cse2 .cse3) .cse30 (= .cse11 .cse18) .cse24 (= .cse40 |ULTIMATE.start_main_~y~0#1|) (= 0 (+ (- 1) .cse2))))))))) [2023-02-18 01:20:38,552 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:20:38,552 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:20:38,553 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-18 01:20:38,553 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (let ((.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse12 (let ((.cse14 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse13 (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse13) (or (not .cse13) (not (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse3)))))) (.cse1 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse0 (let ((.cse6 (= (+ (- 6) (+ (+ .cse1 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse7 (= (+ (let ((.cse11 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse11 (* .cse11 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ |ULTIMATE.start_main_~n~0#1| 1))) (* .cse10 (* .cse10 .cse10))))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse5 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse5) (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse6 .cse2 .cse7 .cse8 .cse9)) (and .cse6 .cse2 .cse7 .cse8 .cse9))))) (or (and .cse0 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse1 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) (= .cse4 6)))))) [2023-02-18 01:20:38,553 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse8 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse21 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse16 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse19 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse25 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse0 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse28 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse38 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse39 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse36 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse13 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse39) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse4 (= (+ (- 6) (+ (+ .cse38 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse27 (or .cse24 (let ((.cse42 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse41 (<= (+ .cse42 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse24) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse41) (or (not .cse41) (not (<= (+ .cse42 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse0)) .cse28))))) (.cse30 (= (+ (let ((.cse40 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse40 (* .cse40 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse6 (or (and (or (not .cse3) (not .cse9)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3 .cse9))) (.cse31 (or .cse8 (= (+ (+ (- (* .cse21 .cse16)) (* .cse16 .cse39)) (* .cse16 12)) 0) (< .cse19 .cse25))) (.cse32 (= .cse16 (* .cse19 (* .cse19 .cse19)))) (.cse33 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse2 (let ((.cse37 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse38 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0))) (or (and .cse3 .cse4 .cse27 .cse30 .cse6 .cse31 .cse32 .cse9 .cse33 .cse37) (and .cse13 .cse3 .cse4 .cse27 .cse30 .cse6 .cse31 .cse32 .cse9 .cse33 .cse37)))) (.cse1 (+ (* (- 1) .cse0) |ULTIMATE.start_main_~y~0#1|)) (.cse26 (<= .cse36 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse22 (+ (- 5) 12)) (.cse23 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse11 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse10 (+ 2 1))) (and (= (+ (+ (- (* .cse0 6)) (+ (* .cse0 .cse0) (- (* .cse1 12)))) 12) 0) (let ((.cse18 (+ 6 (* .cse19 6)))) (let ((.cse20 (not (= .cse18 .cse21))) (.cse17 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse7 (or .cse20 (= (+ (+ (+ (- (* .cse17 12)) (+ (- (* .cse16 18)) (* .cse18 .cse17))) (* .cse18 2)) (- 6)) 0))) (.cse12 (or (= 0 (+ (- 6) (let ((.cse14 (+ 6 (* 6 (+ .cse19 1))))) (+ (* 2 .cse14) (let ((.cse15 (+ .cse18 .cse17))) (+ (+ (* .cse15 .cse14) (- (* 18 (+ .cse16 .cse17)))) (- (* .cse15 12)))))))) .cse20))) (or (let ((.cse5 (+ (- 11) 19))) (and .cse2 .cse3 .cse4 (= (+ (+ (+ 19 (* (- 1) .cse5) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse5)) .cse9 (= .cse10 |ULTIMATE.start_main_~n~0#1|) .cse11 .cse12)) (and .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 .cse9 .cse12))))) .cse3 (= .cse0 (+ 6 12)) (= (+ (+ .cse22 (* (- 1) (+ (- 1) .cse22))) 0) (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) (* (- 1) .cse22))) (<= (+ (- 1) .cse23) |ULTIMATE.start_main_~a~0#1|) .cse6 .cse24 .cse9 (<= .cse25 3) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (= (+ .cse22 12) .cse1) (not (<= .cse23 |ULTIMATE.start_main_~a~0#1|)) .cse11 .cse26 (<= |ULTIMATE.start_main_~n~0#1| .cse10))) (and .cse27 (= |ULTIMATE.start_main_~y~0#1| 1) .cse28 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse29 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse29) (= |ULTIMATE.start_main_~n~0#1| .cse29) .cse3 .cse4 .cse27 .cse30 .cse6 .cse31 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse0 1)) .cse32 (<= .cse25 1) .cse9 (<= |ULTIMATE.start_main_~n~0#1| .cse29) .cse33 (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse0 6))) (let ((.cse35 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse34 (+ 6 6))) (and .cse2 (= .cse1 (+ 6 1)) .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ .cse1 1)) .cse6 (= .cse34 .cse35) .cse8 (= (+ 6 .cse35) |ULTIMATE.start_main_~z~0#1|) .cse9 (= .cse34 .cse0) .cse26 (= 0 (+ (- 1) .cse36)))))))) [2023-02-18 01:20:38,553 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 01:20:38,553 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse15 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse2 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 0 1)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse48 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse41 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse16 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse49 (not .cse17)) (.cse45 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse12 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse53 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse47 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse52 (+ (- 5) 12))) (let ((.cse13 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse27 (+ (+ .cse52 (* (- 1) (+ (- 1) .cse52))) 0)) (.cse28 (* (- 1) .cse52)) (.cse4 (+ 6 1)) (.cse6 (= (+ (- 6) (+ (+ .cse53 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse47)) 0)) (.cse8 (= (+ (let ((.cse54 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse54 (* .cse54 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse9 (or .cse49 .cse45 .cse12)) (.cse26 (+ 6 12)) (.cse19 (= .cse14 (* .cse16 (* .cse16 .cse16)))) (.cse22 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse30 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse53 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse11 (+ 6 6)) (.cse40 (+ .cse52 12)) (.cse0 (= (+ (+ (- (* .cse18 6)) (+ (* .cse18 .cse18) (- (* .cse41 12)))) 12) 0)) (.cse7 (or .cse17 (let ((.cse51 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse50 (<= (+ .cse51 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse49 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse50) (or (not .cse50) (not (<= (+ .cse51 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse48))))) (.cse10 (or (and (or (not .cse5) (not .cse20)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse20))) (.cse21 (<= |ULTIMATE.start_main_~n~0#1| .cse3)) (.cse23 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse24 (= |ULTIMATE.start_main_~z~0#1| (+ .cse1 6))) (.cse25 (<= .cse2 |ULTIMATE.start_main_~a~0#1|))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse0 (= .cse1 6) (= .cse2 0) (= |ULTIMATE.start_main_~x~0#1| .cse3) (= |ULTIMATE.start_main_~n~0#1| .cse3) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |ULTIMATE.start_main_~z~0#1|) (or (not .cse12) (= (+ (+ (- (* .cse13 .cse14)) (* .cse14 .cse15)) (* .cse14 12)) 0) (< .cse16 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 |ULTIMATE.start_main_~x~0#1|)) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse2) .cse23 .cse24 (= .cse18 6) .cse25 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse1)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse34 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse33 (+ 2 1))) (and (<= 2 .cse2) .cse0 .cse5 (= .cse18 .cse26) (= .cse27 (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) .cse28)) .cse10 .cse17 (let ((.cse38 (+ 6 (* .cse16 6)))) (let ((.cse39 (not (= .cse38 .cse13))) (.cse37 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse29 (or .cse39 (= (+ (+ (+ (- (* .cse37 12)) (+ (- (* .cse14 18)) (* .cse38 .cse37))) (* .cse38 2)) (- 6)) 0))) (.cse31 (or (= 0 (+ (- 6) (let ((.cse35 (+ 6 (* 6 (+ .cse16 1))))) (+ (* 2 .cse35) (let ((.cse36 (+ .cse38 .cse37))) (+ (+ (* .cse36 .cse35) (- (* 18 (+ .cse14 .cse37)))) (- (* .cse36 12)))))))) .cse39))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse19 .cse20 .cse22 .cse30 .cse31) (let ((.cse32 (+ (- 11) 19))) (and .cse5 .cse6 .cse7 .cse8 (= (+ (+ (+ 19 (* (- 1) .cse32) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse10 .cse29 .cse19 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse32)) .cse20 .cse22 (= .cse33 |ULTIMATE.start_main_~n~0#1|) .cse34 .cse30 .cse31)))))) .cse20 (= .cse40 .cse41) .cse34 .cse25 (<= |ULTIMATE.start_main_~n~0#1| .cse33))) (let ((.cse46 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) 1))) (let ((.cse42 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse44 (+ .cse46 (- 6)))) (and (= .cse27 (+ |ULTIMATE.start_main_~x~0#1| .cse28)) (= .cse41 .cse4) .cse0 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ .cse41 1)) .cse9 .cse10 (= .cse11 .cse42) (let ((.cse43 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse43)) .cse44) .cse43)) .cse17 (<= 1 .cse2) (= |ULTIMATE.start_main_~z~0#1| .cse26) (or .cse45 .cse12) .cse19 (= (+ .cse46 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse42) |ULTIMATE.start_main_~z~0#1|) .cse20 .cse22 (= 6 .cse44) (= .cse2 .cse3) .cse30 (= .cse11 .cse18) .cse25 (= .cse40 |ULTIMATE.start_main_~y~0#1|) (= 0 (+ (- 1) .cse2))))) (and (= (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse15))) .cse47) (- 10)) 0) .cse0 .cse5 .cse7 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse17 (= |ULTIMATE.start_main_~y~0#1| 1) .cse20 .cse21 .cse48 .cse23 .cse24 (= |ULTIMATE.start_main_~x~0#1| 0) .cse25 (= 6 |ULTIMATE.start_main_~z~0#1|)))))) [2023-02-18 01:20:38,558 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse15 (* 6 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse2 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse14 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse16 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse20 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse47 (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse12 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse51 (not .cse17)) (.cse43 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse41 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse49 (+ (- 5) 12)) (.cse1 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (+ 0 1)) (.cse50 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse42 (* 2 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse6 (= (+ (- 6) (+ (+ .cse50 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse42)) 0)) (.cse13 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse21 (<= |ULTIMATE.start_main_~n~0#1| .cse3)) (.cse22 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ .cse1 6))) (.cse26 (+ (+ .cse49 (* (- 1) (+ (- 1) .cse49))) 0)) (.cse27 (* (- 1) .cse49)) (.cse4 (+ 6 1)) (.cse0 (= (+ (+ (- (* .cse18 6)) (+ (* .cse18 .cse18) (- (* .cse41 12)))) 12) 0)) (.cse7 (or .cse17 (let ((.cse54 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse53 (<= (+ .cse54 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse51 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse53) (or (not .cse53) (not (<= (+ .cse54 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse43))))) (.cse8 (= (+ (let ((.cse52 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse52 (* .cse52 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse9 (or .cse51 .cse47 .cse12)) (.cse10 (or (and (or (not .cse5) (not .cse20)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse20))) (.cse25 (+ 6 12)) (.cse19 (= .cse14 (* .cse16 (* .cse16 .cse16)))) (.cse29 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse30 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse50 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse11 (+ 6 6)) (.cse24 (<= .cse2 |ULTIMATE.start_main_~a~0#1|)) (.cse40 (+ .cse49 12))) (or (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse0 (= .cse1 6) (= .cse2 0) (= |ULTIMATE.start_main_~x~0#1| .cse3) (= |ULTIMATE.start_main_~n~0#1| .cse3) (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse11 |ULTIMATE.start_main_~z~0#1|) (or (not .cse12) (= (+ (+ (- (* .cse13 .cse14)) (* .cse14 .cse15)) (* .cse14 12)) 0) (< .cse16 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 |ULTIMATE.start_main_~x~0#1|)) (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 .cse2) .cse22 .cse23 (= .cse18 6) .cse24 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse1)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse34 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse33 (+ 2 1))) (and (<= 2 .cse2) .cse0 .cse5 (= .cse18 .cse25) (= .cse26 (+ (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6)) .cse27)) .cse10 .cse17 (let ((.cse38 (+ 6 (* .cse16 6)))) (let ((.cse39 (not (= .cse38 .cse13))) (.cse37 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse28 (or .cse39 (= (+ (+ (+ (- (* .cse37 12)) (+ (- (* .cse14 18)) (* .cse38 .cse37))) (* .cse38 2)) (- 6)) 0))) (.cse31 (or (= 0 (+ (- 6) (let ((.cse35 (+ 6 (* 6 (+ .cse16 1))))) (+ (* 2 .cse35) (let ((.cse36 (+ .cse38 .cse37))) (+ (+ (* .cse36 .cse35) (- (* 18 (+ .cse14 .cse37)))) (- (* .cse36 12)))))))) .cse39))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse19 .cse20 .cse29 .cse30 .cse31) (let ((.cse32 (+ (- 11) 19))) (and .cse5 .cse6 .cse7 .cse8 (= (+ (+ (+ 19 (* (- 1) .cse32) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse10 .cse28 .cse19 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse32)) .cse20 .cse29 (= .cse33 |ULTIMATE.start_main_~n~0#1|) .cse34 .cse30 .cse31)))))) .cse20 (= .cse40 .cse41) .cse34 .cse24 (<= |ULTIMATE.start_main_~n~0#1| .cse33))) (and (= (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~y~0#1|)) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse15))) .cse42) (- 10)) 0) .cse0 .cse5 .cse7 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) .cse17 (= |ULTIMATE.start_main_~y~0#1| 1) .cse20 .cse21 .cse43 .cse22 .cse23 (= |ULTIMATE.start_main_~x~0#1| 0) .cse24 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse48 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|) 1))) (let ((.cse44 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse46 (+ .cse48 (- 6)))) (and (= .cse26 (+ |ULTIMATE.start_main_~x~0#1| .cse27)) (= .cse41 .cse4) .cse0 .cse5 .cse7 .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ .cse41 1)) .cse9 .cse10 (= .cse11 .cse44) (let ((.cse45 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse45)) .cse46) .cse45)) .cse17 (<= 1 .cse2) (= |ULTIMATE.start_main_~z~0#1| .cse25) (or .cse47 .cse12) .cse19 (= (+ .cse48 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse44) |ULTIMATE.start_main_~z~0#1|) .cse20 .cse29 (= 6 .cse46) (= .cse2 .cse3) .cse30 (= .cse11 .cse18) .cse24 (= .cse40 |ULTIMATE.start_main_~y~0#1|) (= 0 (+ (- 1) .cse2))))))))) [2023-02-18 01:20:38,558 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 01:20:38,558 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 01:20:38,558 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 01:20:38,558 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 01:20:38,558 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: (let ((.cse1 (<= (+ 2 1) 2)) (.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (or (let ((.cse0 (not .cse2))) (and (or .cse0 .cse1) .cse0)) (and .cse2 (not .cse1)) .cse2)) [2023-02-18 01:20:38,558 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 01:20:38,560 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 01:20:38,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:20:38,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:20:38 BoogieIcfgContainer [2023-02-18 01:20:38,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:20:38,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:20:38,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:20:38,590 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:20:38,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:20:18" (3/4) ... [2023-02-18 01:20:38,592 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:20:38,595 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:20:38,598 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 01:20:38,598 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:20:38,598 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:20:38,598 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:20:38,643 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:20:38,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:20:38,652 INFO L158 Benchmark]: Toolchain (without parser) took 20896.36ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 89.4MB in the beginning and 141.7MB in the end (delta: -52.2MB). Peak memory consumption was 567.9kB. Max. memory is 16.1GB. [2023-02-18 01:20:38,652 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:20:38,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.42ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 78.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:20:38,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.42ms. Allocated memory is still 125.8MB. Free memory was 78.6MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:20:38,653 INFO L158 Benchmark]: Boogie Preprocessor took 12.88ms. Allocated memory is still 125.8MB. Free memory was 76.8MB in the beginning and 75.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:20:38,653 INFO L158 Benchmark]: RCFGBuilder took 302.66ms. Allocated memory is still 125.8MB. Free memory was 75.7MB in the beginning and 65.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:20:38,654 INFO L158 Benchmark]: TraceAbstraction took 20317.56ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 64.3MB in the beginning and 144.8MB in the end (delta: -80.5MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2023-02-18 01:20:38,654 INFO L158 Benchmark]: Witness Printer took 61.74ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 141.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:20:38,655 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.13ms. Allocated memory is still 125.8MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.42ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 78.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.42ms. Allocated memory is still 125.8MB. Free memory was 78.6MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.88ms. Allocated memory is still 125.8MB. Free memory was 76.8MB in the beginning and 75.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 302.66ms. Allocated memory is still 125.8MB. Free memory was 75.7MB in the beginning and 65.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20317.56ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 64.3MB in the beginning and 144.8MB in the end (delta: -80.5MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * Witness Printer took 61.74ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 141.7MB 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: 20.2s, OverallIterations: 15, TraceHistogramMax: 29, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 1206 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 777 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4016 IncrementalHoareTripleChecker+Invalid, 4595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 429 mSDtfsCounter, 4016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1733 GetRequests, 1508 SyntacticMatches, 13 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=14, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 74 PreInvPairs, 120 NumberOfFragments, 20277 HoareAnnotationTreeSize, 74 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1556 ConstructedInterpolants, 2 QuantifiedInterpolants, 9709 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2180 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 8830/9304 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) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && -1 + y == 6) && -1 + n == 0) && x == 0 + 1) && n == 0 + 1) && y == 6 + 1) && a <= 2) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && 6 + 6 == z) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && z == 6 + 6 * n) && y == z + -6 + 1) && x + y == (n + 1) * ((n + 1) * (n + 1))) && a >= 0) && n <= 0 + 1) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && y == z + -6 + x) && -1 * 6 + y == 1) && 0 <= -1 + n) && 0 <= a) && z == -1 + y + 6) && z + -6 == 6) && -1 + n <= a) && y + -1 * (-1 + y) + 0 == x) || ((((((((((((2 <= -1 + n && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && a <= 2) && z + -6 == 6 + 12) && -5 + 12 + -1 * (-1 + (-5 + 12)) + 0 == -1 * y + x + z + -6 + -1 * (-5 + 12)) && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && z == 6 + 6 * n) && a >= 0) && -5 + 12 + 12 == -1 * (z + -6) + y) && 2 <= a) && -1 + n <= a) && n <= 2 + 1) && (((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && 2 + 1 == n) && (((((((((a <= 2 && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || ((((((((a <= 2 && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)))) && 2 <= a) || (((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((a <= 2 && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || ((((((((a <= 2 && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))))))) || (((((((((((((((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && a <= 2) && (z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0))) && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && n >= 0) && z == 6 + 6 * n) && y == 1) && a >= 0) && n <= 0 + 1) && n == 0) && 0 <= a) && z == -1 + y + 6) && x == 0) && -1 + n <= a) && 6 == z)) || (((((((((((((((((((((((((-5 + 12 + -1 * (-1 + (-5 + 12)) + 0 == x + -1 * (-5 + 12) && -1 * (z + -6) + y == 6 + 1) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && a <= 2) && x == -1 * (z + -6) + y + 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && (((!(a <= 2) || !(a >= 0)) && cond == 0) || ((cond == 1 && a <= 2) && a >= 0))) && 6 + 6 == -7 + y) && x + -1 * (-1 + x) + (y + -1 * x + 1 + -6) == -1 + x) && z == 6 + 6 * n) && 1 <= -1 + n) && z == 6 + 12) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && y + -1 * x + 1 + 6 == z) && 6 + (-7 + y) == z) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && 6 == y + -1 * x + 1 + -6) && -1 + n == 0 + 1) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + 6 == z + -6) && -1 + n <= a) && -5 + 12 + 12 == y) && 0 == -1 + (-1 + n)) RESULT: Ultimate proved your program to be correct! [2023-02-18 01:20:38,683 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