./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.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 83faa6e73eecf1794606bf7d9aa443e43ed9860cb538a0ff2fa0adbaa1b8efd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 16:11:51,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 16:11:51,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 16:11:51,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 16:11:51,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 16:11:51,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 16:11:51,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 16:11:51,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 16:11:51,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 16:11:51,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 16:11:51,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 16:11:51,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 16:11:51,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 16:11:51,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 16:11:51,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 16:11:51,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 16:11:51,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 16:11:51,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 16:11:51,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 16:11:51,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 16:11:51,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 16:11:51,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 16:11:51,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 16:11:51,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 16:11:51,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 16:11:51,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 16:11:51,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 16:11:51,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 16:11:51,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 16:11:51,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 16:11:51,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 16:11:51,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 16:11:51,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 16:11:51,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 16:11:51,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 16:11:51,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 16:11:51,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 16:11:51,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 16:11:51,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 16:11:51,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 16:11:51,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 16:11:51,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 16:11:51,487 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 16:11:51,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 16:11:51,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 16:11:51,490 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 16:11:51,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 16:11:51,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 16:11:51,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 16:11:51,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 16:11:51,492 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 16:11:51,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 16:11:51,493 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 16:11:51,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 16:11:51,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 16:11:51,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 16:11:51,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 16:11:51,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 16:11:51,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 16:11:51,494 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 16:11:51,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 16:11:51,495 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 16:11:51,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 16:11:51,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 16:11:51,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 16:11:51,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 16:11:51,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:11:51,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 16:11:51,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 16:11:51,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 16:11:51,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 16:11:51,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 16:11:51,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 16:11:51,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 16:11:51,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 16:11:51,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 16:11:51,498 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 16:11:51,498 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 -> 83faa6e73eecf1794606bf7d9aa443e43ed9860cb538a0ff2fa0adbaa1b8efd0 [2023-02-18 16:11:51,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 16:11:51,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 16:11:51,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 16:11:51,748 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 16:11:51,748 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 16:11:51,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c [2023-02-18 16:11:52,764 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 16:11:52,942 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 16:11:52,942 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sum_by_3_abstracted.c [2023-02-18 16:11:52,947 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ccf0a6/90cad22a61484c52a6181ed5088943d7/FLAGf518e0261 [2023-02-18 16:11:52,963 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054ccf0a6/90cad22a61484c52a6181ed5088943d7 [2023-02-18 16:11:52,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 16:11:52,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 16:11:52,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 16:11:52,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 16:11:52,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 16:11:52,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:11:52" (1/1) ... [2023-02-18 16:11:52,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a53ce4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:52, skipping insertion in model container [2023-02-18 16:11:52,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:11:52" (1/1) ... [2023-02-18 16:11:52,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 16:11:53,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 16:11:53,116 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/loops-crafted-1/sum_by_3_abstracted.c[824,837] [2023-02-18 16:11:53,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:11:53,145 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 16:11:53,153 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/loops-crafted-1/sum_by_3_abstracted.c[824,837] [2023-02-18 16:11:53,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 16:11:53,164 INFO L208 MainTranslator]: Completed translation [2023-02-18 16:11:53,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53 WrapperNode [2023-02-18 16:11:53,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 16:11:53,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 16:11:53,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 16:11:53,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 16:11:53,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,185 INFO L138 Inliner]: procedures = 21, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2023-02-18 16:11:53,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 16:11:53,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 16:11:53,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 16:11:53,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 16:11:53,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,203 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 16:11:53,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 16:11:53,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 16:11:53,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 16:11:53,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (1/1) ... [2023-02-18 16:11:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 16:11:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:11:53,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 16:11:53,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 16:11:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 16:11:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 16:11:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 16:11:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 16:11:53,293 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 16:11:53,295 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 16:11:53,393 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 16:11:53,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 16:11:53,397 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 16:11:53,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:11:53 BoogieIcfgContainer [2023-02-18 16:11:53,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 16:11:53,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 16:11:53,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 16:11:53,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 16:11:53,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:11:52" (1/3) ... [2023-02-18 16:11:53,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342c97bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:11:53, skipping insertion in model container [2023-02-18 16:11:53,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:11:53" (2/3) ... [2023-02-18 16:11:53,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342c97bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:11:53, skipping insertion in model container [2023-02-18 16:11:53,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:11:53" (3/3) ... [2023-02-18 16:11:53,404 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_by_3_abstracted.c [2023-02-18 16:11:53,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 16:11:53,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 16:11:53,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 16:11:53,455 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;@78c3524e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 16:11:53,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 16:11:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 16:11:53,463 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:11:53,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:11:53,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:11:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:11:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash 208527732, now seen corresponding path program 1 times [2023-02-18 16:11:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:11:53,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425870404] [2023-02-18 16:11:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:11:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:11:54,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425870404] [2023-02-18 16:11:54,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425870404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:11:54,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:11:54,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 16:11:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442786259] [2023-02-18 16:11:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:11:54,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 16:11:54,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:11:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 16:11:54,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-18 16:11:54,200 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 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) Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:11:54,448 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2023-02-18 16:11:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 16:11:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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) Word has length 11 [2023-02-18 16:11:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:11:54,455 INFO L225 Difference]: With dead ends: 66 [2023-02-18 16:11:54,455 INFO L226 Difference]: Without dead ends: 31 [2023-02-18 16:11:54,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:11:54,462 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 103 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 16:11:54,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 49 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 16:11:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-18 16:11:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2023-02-18 16:11:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-18 16:11:54,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-02-18 16:11:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:11:54,494 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-18 16:11:54,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-18 16:11:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 16:11:54,495 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:11:54,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:11:54,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 16:11:54,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:11:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:11:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2123909486, now seen corresponding path program 1 times [2023-02-18 16:11:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:11:54,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021361553] [2023-02-18 16:11:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:11:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:11:54,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021361553] [2023-02-18 16:11:54,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021361553] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:11:54,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:11:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 16:11:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899168530] [2023-02-18 16:11:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:11:54,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 16:11:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:11:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 16:11:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 16:11:54,577 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:11:54,599 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2023-02-18 16:11:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 16:11:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2023-02-18 16:11:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:11:54,601 INFO L225 Difference]: With dead ends: 26 [2023-02-18 16:11:54,601 INFO L226 Difference]: Without dead ends: 15 [2023-02-18 16:11:54,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 16:11:54,605 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 16:11:54,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:11:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-18 16:11:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-18 16:11:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-18 16:11:54,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2023-02-18 16:11:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:11:54,612 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-18 16:11:54,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-18 16:11:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 16:11:54,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:11:54,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:11:54,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 16:11:54,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:11:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:11:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1706336381, now seen corresponding path program 1 times [2023-02-18 16:11:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:11:54,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054653712] [2023-02-18 16:11:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:11:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:11:55,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054653712] [2023-02-18 16:11:55,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054653712] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:11:55,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:11:55,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 16:11:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905553167] [2023-02-18 16:11:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:11:55,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 16:11:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:11:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 16:11:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-18 16:11:55,057 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:11:56,196 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-02-18 16:11:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 16:11:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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) Word has length 14 [2023-02-18 16:11:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:11:56,197 INFO L225 Difference]: With dead ends: 36 [2023-02-18 16:11:56,197 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 16:11:56,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-02-18 16:11:56,198 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 16:11:56,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 33 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 16:11:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 16:11:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2023-02-18 16:11:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-18 16:11:56,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2023-02-18 16:11:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:11:56,203 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-18 16:11:56,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-18 16:11:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 16:11:56,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:11:56,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:11:56,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 16:11:56,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:11:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:11:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1908572545, now seen corresponding path program 1 times [2023-02-18 16:11:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:11:56,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091269126] [2023-02-18 16:11:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:11:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:11:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091269126] [2023-02-18 16:11:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091269126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:11:56,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 16:11:56,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 16:11:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560961850] [2023-02-18 16:11:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:11:56,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 16:11:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:11:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 16:11:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 16:11:56,218 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:11:56,232 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-02-18 16:11:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 16:11:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2023-02-18 16:11:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:11:56,233 INFO L225 Difference]: With dead ends: 27 [2023-02-18 16:11:56,233 INFO L226 Difference]: Without dead ends: 18 [2023-02-18 16:11:56,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 16:11:56,234 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 16:11:56,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:11:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-18 16:11:56,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-18 16:11:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-02-18 16:11:56,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2023-02-18 16:11:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:11:56,238 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-02-18 16:11:56,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-02-18 16:11:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 16:11:56,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:11:56,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:11:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 16:11:56,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:11:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:11:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1358485673, now seen corresponding path program 1 times [2023-02-18 16:11:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:11:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162311521] [2023-02-18 16:11:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:11:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:11:56,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162311521] [2023-02-18 16:11:56,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162311521] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:11:56,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310108775] [2023-02-18 16:11:56,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:11:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:11:56,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:11:56,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 16:11:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:56,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 16:11:56,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:11:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:56,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 16:11:56,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310108775] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:11:56,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:11:56,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2023-02-18 16:11:56,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410196347] [2023-02-18 16:11:56,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:11:56,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 16:11:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:11:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 16:11:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-18 16:11:56,574 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:11:56,610 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-02-18 16:11:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 16:11:56,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2023-02-18 16:11:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:11:56,615 INFO L225 Difference]: With dead ends: 23 [2023-02-18 16:11:56,615 INFO L226 Difference]: Without dead ends: 16 [2023-02-18 16:11:56,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-18 16:11:56,617 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 16:11:56,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:11:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-18 16:11:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-18 16:11:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-02-18 16:11:56,626 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2023-02-18 16:11:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:11:56,627 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-02-18 16:11:56,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-02-18 16:11:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 16:11:56,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 16:11:56,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 16:11:56,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 16:11:56,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:11:56,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 16:11:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 16:11:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1341560856, now seen corresponding path program 1 times [2023-02-18 16:11:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 16:11:56,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262195705] [2023-02-18 16:11:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 16:11:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 16:11:57,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262195705] [2023-02-18 16:11:57,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262195705] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 16:11:57,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015174819] [2023-02-18 16:11:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 16:11:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 16:11:57,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 16:11:57,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 16:11:57,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 16:11:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 16:11:57,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 16:11:57,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 16:11:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 16:11:57,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 16:11:57,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015174819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 16:11:57,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 16:11:57,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-02-18 16:11:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146560919] [2023-02-18 16:11:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 16:11:57,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 16:11:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 16:11:57,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 16:11:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-18 16:11:57,118 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 16:11:57,144 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-02-18 16:11:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 16:11:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2023-02-18 16:11:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 16:11:57,144 INFO L225 Difference]: With dead ends: 16 [2023-02-18 16:11:57,145 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 16:11:57,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-18 16:11:57,145 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 16:11:57,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 16:11:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 16:11:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 16:11:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 16:11:57,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-02-18 16:11:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 16:11:57,147 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 16:11:57,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 16:11:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 16:11:57,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 16:11:57,149 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 16:11:57,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 16:11:57,354 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,SelfDestructingSolverStorable5 [2023-02-18 16:11:57,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 16:11:57,371 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2023-02-18 16:11:57,373 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 18 23) the Hoare annotation is: (let ((.cse36 (div |ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse48 (* (- 4294967296) .cse36))) (let ((.cse45 (<= (+ |ULTIMATE.start_main_~i~0#1| .cse48 (- 2147483647)) 0))) (let ((.cse22 (div ~SIZE~0 4294967296)) (.cse46 (* 4294967296 .cse36)) (.cse44 (+ |ULTIMATE.start_main_~i~0#1| .cse48)) (.cse41 (+ |ULTIMATE.start_main_~i~0#1| .cse48 (- 4294967296))) (.cse39 (* (- 1) |ULTIMATE.start_main_~j~0#1|)) (.cse43 (not .cse45))) (let ((.cse3 (or (and (= (+ .cse44 .cse39) 0) .cse45) (and (= (+ .cse41 .cse39) 0) .cse43))) (.cse4 (let ((.cse47 (<= (+ .cse36 1) 0))) (and (or (not .cse47) (<= |ULTIMATE.start_main_~i~0#1| (+ .cse46 4294967295))) (or (<= .cse46 (+ |ULTIMATE.start_main_~i~0#1| (- 2147483648))) .cse47)))) (.cse5 (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse46 .cse41)) .cse43)) (.cse6 (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse46 .cse44)) .cse45)) (.cse9 (<= .cse22 0)) (.cse7 (let ((.cse40 (* 8589934592 .cse36)) (.cse42 (+ (* 3 ~SIZE~0) (* 2 |ULTIMATE.start_main_~i~0#1|) (- 60000003)))) (or (and (<= (+ .cse40 (* 2 .cse41)) .cse42) .cse43) (and (<= (+ .cse40 (* 2 .cse44)) .cse42) .cse45)))) (.cse0 (<= 0 (+ ~SIZE~0 (- 20000001)))) (.cse8 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (not (= 0 |ULTIMATE.start___VERIFIER_assert_~cond#1|))) (.cse2 (<= ~SIZE~0 20000001))) (or (and .cse0 .cse1 .cse2) (and .cse3 (or .cse4 .cse5 .cse6) .cse7 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse0 .cse8 .cse1 .cse9 .cse2) (let ((.cse35 (div (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) 4294967296))) (let ((.cse38 (* (- 4294967296) .cse35))) (let ((.cse37 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| .cse38))) (let ((.cse10 (* (- 1) |ULTIMATE.start_main_~k~0#1|)) (.cse28 (div .cse37 3))) (let ((.cse31 (+ .cse28 1)) (.cse13 (<= (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) .cse39 .cse10 (* 4294967296 .cse35)) 0)) (.cse15 (= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| .cse38 (* (- 3) .cse28))))) (let ((.cse21 (div .cse37 12884901888)) (.cse18 (not .cse15)) (.cse20 (not .cse13)) (.cse32 (* 3 .cse22)) (.cse33 (* (- 2) .cse36)) (.cse19 (div .cse31 4294967296)) (.cse34 (* (- 1) .cse35))) (let ((.cse12 (or .cse13 .cse15)) (.cse23 (<= (+ .cse32 .cse33 (* (- 3) .cse19) .cse34) 0)) (.cse17 (and .cse18 .cse20)) (.cse11 (<= (+ .cse32 .cse33 (* (- 3) .cse21) .cse34) 0))) (and .cse3 (= (+ |ULTIMATE.start_main_~j~0#1| .cse10) 0) (or (and .cse11 .cse12) (let ((.cse16 (<= (+ .cse22 (* (- 1) .cse21)) 0)) (.cse14 (<= (+ .cse22 (* (- 1) .cse19)) 0))) (and (or (and (or .cse13 (not .cse14) .cse15) (or (not .cse16) .cse17)) .cse4 .cse5 .cse6) (or (and .cse18 (<= (+ .cse19 1) 0) .cse20) (and .cse12 (<= (+ .cse21 1) 0)) (and .cse12 .cse16) (and .cse18 .cse14 .cse20) .cse9))) (and .cse18 .cse23 .cse20)) (or (and (let ((.cse29 (* (- 1) ~SIZE~0)) (.cse30 (* 4294967296 .cse22))) (let ((.cse25 (<= (+ .cse31 (* (- 4294967296) .cse19) .cse29 .cse30) 0)) (.cse27 (<= (+ .cse28 (* (- 4294967296) .cse21) .cse29 .cse30) 0))) (let ((.cse24 (not .cse27)) (.cse26 (not .cse25))) (or (and .cse24 (or (and .cse25 .cse12) .cse26)) (and (or (and .cse25 (or .cse17 .cse26)) .cse27) (or .cse25 .cse13 .cse24 .cse15)) (and .cse27 .cse18 .cse26 .cse20))))) .cse7) (and (or .cse13 (not .cse23) .cse15) (or .cse17 (not .cse11)))) .cse0 .cse8 .cse1 .cse2)))))))))))))) [2023-02-18 16:11:57,373 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 26 51) the Hoare annotation is: (let ((.cse36 (div |ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse48 (* (- 4294967296) .cse36))) (let ((.cse45 (<= (+ |ULTIMATE.start_main_~i~0#1| .cse48 (- 2147483647)) 0))) (let ((.cse22 (div ~SIZE~0 4294967296)) (.cse46 (* 4294967296 .cse36)) (.cse44 (+ |ULTIMATE.start_main_~i~0#1| .cse48)) (.cse41 (+ |ULTIMATE.start_main_~i~0#1| .cse48 (- 4294967296))) (.cse39 (* (- 1) |ULTIMATE.start_main_~j~0#1|)) (.cse43 (not .cse45))) (let ((.cse3 (or (and (= (+ .cse44 .cse39) 0) .cse45) (and (= (+ .cse41 .cse39) 0) .cse43))) (.cse4 (let ((.cse47 (<= (+ .cse36 1) 0))) (and (or (not .cse47) (<= |ULTIMATE.start_main_~i~0#1| (+ .cse46 4294967295))) (or (<= .cse46 (+ |ULTIMATE.start_main_~i~0#1| (- 2147483648))) .cse47)))) (.cse5 (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse46 .cse41)) .cse43)) (.cse6 (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse46 .cse44)) .cse45)) (.cse9 (<= .cse22 0)) (.cse7 (let ((.cse40 (* 8589934592 .cse36)) (.cse42 (+ (* 3 ~SIZE~0) (* 2 |ULTIMATE.start_main_~i~0#1|) (- 60000003)))) (or (and (<= (+ .cse40 (* 2 .cse41)) .cse42) .cse43) (and (<= (+ .cse40 (* 2 .cse44)) .cse42) .cse45)))) (.cse0 (<= 0 (+ ~SIZE~0 (- 20000001)))) (.cse8 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (not (= 0 |ULTIMATE.start___VERIFIER_assert_~cond#1|))) (.cse2 (<= ~SIZE~0 20000001))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2) (and .cse3 (or .cse4 .cse5 .cse6) .cse7 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse0 .cse8 .cse1 .cse9 .cse2) (let ((.cse35 (div (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) 4294967296))) (let ((.cse38 (* (- 4294967296) .cse35))) (let ((.cse37 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| .cse38))) (let ((.cse10 (* (- 1) |ULTIMATE.start_main_~k~0#1|)) (.cse28 (div .cse37 3))) (let ((.cse31 (+ .cse28 1)) (.cse13 (<= (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) .cse39 .cse10 (* 4294967296 .cse35)) 0)) (.cse15 (= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| .cse38 (* (- 3) .cse28))))) (let ((.cse21 (div .cse37 12884901888)) (.cse18 (not .cse15)) (.cse20 (not .cse13)) (.cse32 (* 3 .cse22)) (.cse33 (* (- 2) .cse36)) (.cse19 (div .cse31 4294967296)) (.cse34 (* (- 1) .cse35))) (let ((.cse12 (or .cse13 .cse15)) (.cse23 (<= (+ .cse32 .cse33 (* (- 3) .cse19) .cse34) 0)) (.cse17 (and .cse18 .cse20)) (.cse11 (<= (+ .cse32 .cse33 (* (- 3) .cse21) .cse34) 0))) (and .cse3 (= (+ |ULTIMATE.start_main_~j~0#1| .cse10) 0) (or (and .cse11 .cse12) (let ((.cse16 (<= (+ .cse22 (* (- 1) .cse21)) 0)) (.cse14 (<= (+ .cse22 (* (- 1) .cse19)) 0))) (and (or (and (or .cse13 (not .cse14) .cse15) (or (not .cse16) .cse17)) .cse4 .cse5 .cse6) (or (and .cse18 (<= (+ .cse19 1) 0) .cse20) (and .cse12 (<= (+ .cse21 1) 0)) (and .cse12 .cse16) (and .cse18 .cse14 .cse20) .cse9))) (and .cse18 .cse23 .cse20)) (or (and (let ((.cse29 (* (- 1) ~SIZE~0)) (.cse30 (* 4294967296 .cse22))) (let ((.cse25 (<= (+ .cse31 (* (- 4294967296) .cse19) .cse29 .cse30) 0)) (.cse27 (<= (+ .cse28 (* (- 4294967296) .cse21) .cse29 .cse30) 0))) (let ((.cse24 (not .cse27)) (.cse26 (not .cse25))) (or (and .cse24 (or (and .cse25 .cse12) .cse26)) (and (or (and .cse25 (or .cse17 .cse26)) .cse27) (or .cse25 .cse13 .cse24 .cse15)) (and .cse27 .cse18 .cse26 .cse20))))) .cse7) (and (or .cse13 (not .cse23) .cse15) (or .cse17 (not .cse11)))) .cse0 .cse8 .cse1 .cse2)))))))))))))) [2023-02-18 16:11:57,373 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 39) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point L32-1(lines 32 39) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 16:11:57,374 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-18 16:11:57,375 INFO L895 garLoopResultBuilder]: At program point L46-2(lines 46 48) the Hoare annotation is: (let ((.cse51 (div (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) 4294967296))) (let ((.cse66 (* (- 4294967296) .cse51))) (let ((.cse64 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| .cse66))) (let ((.cse26 (div |ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse57 (div .cse64 3)) (.cse63 (* (- 1) |ULTIMATE.start_main_~j~0#1|)) (.cse62 (* (- 1) |ULTIMATE.start_main_~k~0#1|)) (.cse31 (* 4294967296 .cse51))) (let ((.cse36 (<= (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) .cse63 .cse62 .cse31) 0)) (.cse38 (= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| .cse66 (* (- 3) .cse57)))) (.cse65 (* (- 4294967296) .cse26))) (let ((.cse21 (<= (+ |ULTIMATE.start_main_~i~0#1| .cse65 (- 2147483647)) 0)) (.cse47 (<= (+ .cse26 1) 0)) (.cse27 (* 4294967296 .cse26)) (.cse59 (+ .cse57 1)) (.cse11 (div ~SIZE~0 4294967296)) (.cse41 (not .cse38)) (.cse42 (not .cse36)) (.cse60 (+ |ULTIMATE.start_main_~i~0#1| .cse65)) (.cse61 (+ |ULTIMATE.start_main_~i~0#1| .cse65 (- 4294967296)))) (let ((.cse12 (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse23 (* 2 .cse61)) (.cse15 (* 8589934592 .cse26)) (.cse16 (* 2 .cse60)) (.cse20 (* 3 ~SIZE~0)) (.cse40 (and .cse41 .cse42)) (.cse9 (* 4294967296 .cse11)) (.cse35 (or .cse36 .cse38)) (.cse44 (div .cse64 12884901888)) (.cse43 (div .cse59 4294967296)) (.cse46 (or (not .cse47) (<= |ULTIMATE.start_main_~i~0#1| (+ .cse27 4294967295)))) (.cse25 (not .cse21))) (let ((.cse0 (or (and (= (+ .cse60 .cse63) 0) .cse21) (and (= (+ .cse61 .cse63) 0) .cse25))) (.cse29 (= (+ |ULTIMATE.start_main_~j~0#1| .cse62) 0)) (.cse1 (and .cse46 (or (<= .cse27 (+ |ULTIMATE.start_main_~i~0#1| (- 2147483648))) .cse47))) (.cse2 (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse27 .cse61)) .cse25)) (.cse3 (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse27 .cse60)) .cse21)) (.cse32 (and .cse41 (<= (+ .cse43 1) 0) .cse42)) (.cse33 (and .cse35 (<= (+ .cse44 1) 0))) (.cse7 (<= .cse11 0)) (.cse13 (let ((.cse58 (* (- 1) ~SIZE~0))) (let ((.cse54 (<= (+ .cse59 (* (- 4294967296) .cse43) .cse58 .cse9) 0)) (.cse56 (<= (+ .cse57 (* (- 4294967296) .cse44) .cse58 .cse9) 0))) (let ((.cse53 (not .cse56)) (.cse55 (not .cse54))) (or (and .cse53 (or (and .cse54 .cse35) .cse55)) (and (or (and .cse54 (or .cse40 .cse55)) .cse56) (or .cse54 .cse36 .cse53 .cse38)) (and .cse56 .cse41 .cse55 .cse42)))))) (.cse4 (let ((.cse52 (+ .cse20 (* 2 |ULTIMATE.start_main_~i~0#1|) (- 60000003)))) (or (and (<= (+ .cse15 .cse23) .cse52) .cse25) (and (<= (+ .cse15 .cse16) .cse52) .cse21)))) (.cse5 (<= 0 (+ ~SIZE~0 (- 20000001)))) (.cse6 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse10 (* 4294967296 .cse12)) (.cse8 (<= ~SIZE~0 20000001))) (or (let ((.cse24 (* 3 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse28 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse19 (div (+ .cse24 (- 3)) 4294967296)) (.cse14 (* 12884901888 .cse11)) (.cse22 (<= .cse9 (+ ~SIZE~0 (- 2147483648))))) (and (or (and .cse0 (or .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse5 .cse6 .cse7 .cse8) (and .cse5 .cse8)) (<= (+ |ULTIMATE.start_main_~n~0#1| .cse9) (+ ~SIZE~0 .cse10)) .cse0 (<= 0 (+ (* .cse11 (- 1)) .cse12 (div (+ (- |ULTIMATE.start_main_~n~0#1|) ~SIZE~0) 4294967296))) .cse13 (let ((.cse17 (* .cse26 2)) (.cse18 (* .cse26 (- 2)))) (or (and (<= (+ .cse14 |ULTIMATE.start_main_~i~0#1| .cse15 .cse16) (+ (* 4294967296 (+ .cse17 (+ .cse18 .cse19))) .cse20)) .cse21) .cse22 (and (<= (+ .cse14 |ULTIMATE.start_main_~i~0#1| .cse15 .cse23) (+ (* 4294967296 (+ .cse17 (+ .cse18 (div (+ .cse24 (- 8589934595)) 4294967296)))) .cse20)) .cse25))) (or (<= .cse27 (+ |ULTIMATE.start_main_~i~0#1| (- 4294967297))) (<= (+ .cse9 |ULTIMATE.start_main_~i~0#1|) (+ .cse27 ~SIZE~0))) (not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) .cse28)) (not (< (mod |ULTIMATE.start_main_~k~0#1| 4294967296) .cse28)) (<= (+ .cse14 .cse24) (+ (* 4294967296 .cse19) .cse20)) (or (and .cse0 .cse29 (let ((.cse30 (+ .cse31 .cse20))) (or (and (<= (+ .cse14 |ULTIMATE.start_main_~i~0#1| .cse23) .cse30) .cse25) (and (<= .cse31 (+ |ULTIMATE.start_main_~i~0#1| .cse16 (- 4294967299))) .cse21) (and (<= (+ .cse14 |ULTIMATE.start_main_~i~0#1| .cse16) .cse30) .cse21) .cse22 (and .cse25 (<= .cse31 (+ |ULTIMATE.start_main_~i~0#1| .cse23 (- 4294967299))))))) .cse32 .cse33)))) (let ((.cse48 (* 3 .cse11)) (.cse49 (* (- 2) .cse26)) (.cse50 (* (- 1) .cse51))) (let ((.cse45 (<= (+ .cse48 .cse49 (* (- 3) .cse43) .cse50) 0)) (.cse34 (<= (+ .cse48 .cse49 (* (- 3) .cse44) .cse50) 0))) (and .cse0 .cse29 (or (and .cse34 .cse35) (let ((.cse39 (<= (+ .cse11 (* (- 1) .cse44)) 0)) (.cse37 (<= (+ .cse11 (* (- 1) .cse43)) 0))) (and (or (and (or .cse36 (not .cse37) .cse38) (or (not .cse39) .cse40)) .cse1 .cse2 .cse3) (or .cse32 .cse33 (and .cse35 .cse39) (and .cse41 .cse37 .cse42) .cse7))) (and .cse41 .cse45 .cse42)) .cse46 (or (and .cse13 .cse4) (and (or .cse36 (not .cse45) .cse38) (or .cse40 (not .cse34)))) .cse5 .cse6 (or (<= (+ |ULTIMATE.start_main_~n~0#1| .cse27) (+ .cse10 |ULTIMATE.start_main_~i~0#1|)) .cse47) .cse8)))))))))))) [2023-02-18 16:11:57,375 INFO L899 garLoopResultBuilder]: For program point L46-3(lines 46 48) no Hoare annotation was computed. [2023-02-18 16:11:57,376 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 16:11:57,381 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 44) the Hoare annotation is: (let ((.cse18 (div |ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse35 (* (- 4294967296) .cse18))) (let ((.cse7 (<= (+ |ULTIMATE.start_main_~i~0#1| .cse35 (- 2147483647)) 0))) (let ((.cse20 (div ~SIZE~0 4294967296)) (.cse6 (+ |ULTIMATE.start_main_~i~0#1| .cse35)) (.cse4 (+ |ULTIMATE.start_main_~i~0#1| .cse35 (- 4294967296))) (.cse5 (not .cse7)) (.cse21 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse15 (* 4294967296 .cse21)) (.cse0 (let ((.cse34 (* (- 1) |ULTIMATE.start_main_~j~0#1|))) (or (and (= (+ .cse6 .cse34) 0) .cse7) (and (= (+ .cse4 .cse34) 0) .cse5)))) (.cse14 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse16 (<= .cse20 0)) (.cse13 (<= 0 (+ ~SIZE~0 (- 20000001)))) (.cse17 (<= ~SIZE~0 20000001)) (.cse11 (* 2 .cse6)) (.cse8 (* 8589934592 .cse18)) (.cse9 (* 2 .cse4)) (.cse2 (* 4294967296 .cse18)) (.cse12 (* 3 ~SIZE~0))) (or (let ((.cse3 (<= (+ .cse18 1) 0))) (let ((.cse1 (or (not .cse3) (<= |ULTIMATE.start_main_~i~0#1| (+ .cse2 4294967295))))) (and .cse0 .cse1 (or (and .cse1 (or (<= .cse2 (+ |ULTIMATE.start_main_~i~0#1| (- 2147483648))) .cse3)) (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse2 .cse4)) .cse5) (and (<= |ULTIMATE.start_main_~i~0#1| (+ .cse2 .cse6)) .cse7)) (let ((.cse10 (+ .cse12 (* 2 |ULTIMATE.start_main_~i~0#1|) (- 60000003)))) (or (and (<= (+ .cse8 .cse9) .cse10) .cse5) (and (<= (+ .cse8 .cse11) .cse10) .cse7))) .cse13 .cse14 (or (<= (+ |ULTIMATE.start_main_~n~0#1| .cse2) (+ .cse15 |ULTIMATE.start_main_~i~0#1|)) .cse3) .cse16 .cse17))) (let ((.cse33 (* 3 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse19 (* 4294967296 .cse20)) (.cse29 (* 12884901888 .cse20)) (.cse32 (div (+ .cse33 (- 3)) 4294967296)) (.cse23 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (and (<= (+ |ULTIMATE.start_main_~n~0#1| .cse19) (+ ~SIZE~0 .cse15)) .cse0 (or (and .cse13 .cse14 .cse16 .cse17) (and .cse13 .cse17)) (<= 0 (+ (* .cse20 (- 1)) .cse21 (div (+ (- |ULTIMATE.start_main_~n~0#1|) ~SIZE~0) 4294967296))) (let ((.cse22 (* |ULTIMATE.start_main_~j~0#1| (- 1))) (.cse25 (<= (mod |ULTIMATE.start_main_~j~0#1| 4294967296) 2147483647)) (.cse27 (- |ULTIMATE.start_main_~j~0#1|))) (or (let ((.cse24 (* (div (+ .cse27 (- 1)) 4294967296) 4294967296)) (.cse26 (+ |ULTIMATE.start_main_~j~0#1| 4294967296))) (and (<= (+ .cse22 .cse23 (- 4294967296)) .cse24) (not .cse25) (<= (+ .cse22 (- 4294967296)) .cse24) (<= 0 .cse26) (< .cse26 4294967296))) (let ((.cse28 (* (div (+ .cse27 4294967295) 4294967296) 4294967296))) (and (<= (+ .cse22 .cse23) .cse28) (<= .cse22 .cse28) (< |ULTIMATE.start_main_~j~0#1| 4294967296) (<= 0 |ULTIMATE.start_main_~j~0#1|) .cse25)))) (let ((.cse30 (* .cse18 2)) (.cse31 (* .cse18 (- 2)))) (or (and (<= (+ .cse29 |ULTIMATE.start_main_~i~0#1| .cse8 .cse11) (+ (* 4294967296 (+ .cse30 (+ .cse31 .cse32))) .cse12)) .cse7) (<= .cse19 (+ ~SIZE~0 (- 2147483648))) (and (<= (+ .cse29 |ULTIMATE.start_main_~i~0#1| .cse8 .cse9) (+ (* 4294967296 (+ .cse30 (+ .cse31 (div (+ .cse33 (- 8589934595)) 4294967296)))) .cse12)) .cse5))) (or (<= .cse2 (+ |ULTIMATE.start_main_~i~0#1| (- 4294967297))) (<= (+ .cse19 |ULTIMATE.start_main_~i~0#1|) (+ .cse2 ~SIZE~0))) (<= (+ .cse29 .cse33) (+ (* 4294967296 .cse32) .cse12)) (not (< (mod |ULTIMATE.start_main_~i~0#1| 4294967296) .cse23))))))))))) [2023-02-18 16:11:57,381 INFO L899 garLoopResultBuilder]: For program point L42-3(lines 42 44) no Hoare annotation was computed. [2023-02-18 16:11:57,381 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-02-18 16:11:57,381 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 32 39) no Hoare annotation was computed. [2023-02-18 16:11:57,381 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 32 39) no Hoare annotation was computed. [2023-02-18 16:11:57,384 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-18 16:11:57,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 16:11:57,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:11:57 BoogieIcfgContainer [2023-02-18 16:11:57,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 16:11:57,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 16:11:57,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 16:11:57,428 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 16:11:57,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:11:53" (3/4) ... [2023-02-18 16:11:57,430 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 16:11:57,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-18 16:11:57,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 16:11:57,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 16:11:57,436 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 16:11:57,463 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 16:11:57,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 16:11:57,463 INFO L158 Benchmark]: Toolchain (without parser) took 4495.99ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 104.6MB in the beginning and 161.1MB in the end (delta: -56.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:11:57,464 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:11:57,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.25ms. Allocated memory is still 151.0MB. Free memory was 104.4MB in the beginning and 93.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 16:11:57,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.90ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 92.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 16:11:57,464 INFO L158 Benchmark]: Boogie Preprocessor took 18.92ms. Allocated memory is still 151.0MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 16:11:57,465 INFO L158 Benchmark]: RCFGBuilder took 193.56ms. Allocated memory is still 151.0MB. Free memory was 91.4MB in the beginning and 81.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 16:11:57,465 INFO L158 Benchmark]: TraceAbstraction took 4027.34ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 80.9MB in the beginning and 164.3MB in the end (delta: -83.4MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2023-02-18 16:11:57,465 INFO L158 Benchmark]: Witness Printer took 35.83ms. Allocated memory is still 201.3MB. Free memory was 164.3MB in the beginning and 161.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 16:11:57,466 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 151.0MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.25ms. Allocated memory is still 151.0MB. Free memory was 104.4MB in the beginning and 93.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.90ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 92.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.92ms. Allocated memory is still 151.0MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 193.56ms. Allocated memory is still 151.0MB. Free memory was 91.4MB in the beginning and 81.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4027.34ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 80.9MB in the beginning and 164.3MB in the end (delta: -83.4MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Witness Printer took 35.83ms. Allocated memory is still 201.3MB. Free memory was 164.3MB in the beginning and 161.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: 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 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 70 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=3, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 8026 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 12045 SizeOfPredicates, 3 NumberOfNonLiveVariables, 110 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 3/5 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: 18]: Loop Invariant Derived loop invariant: ((((0 <= SIZE + -20000001 && !(0 == cond)) && SIZE <= 20000001) || (((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0)) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && 0 <= SIZE + -20000001) && i == 0) && !(0 == cond)) && SIZE / 4294967296 <= 0) && SIZE <= 20000001)) || ((((0 <= SIZE + -20000001 && i == 0) && !(0 == cond)) && SIZE / 4294967296 <= 0) && SIZE <= 20000001)) || (((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && j + -1 * k == 0) && (((3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * ((j + i + k) / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || (((((((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || !(SIZE / 4294967296 + -1 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (!(SIZE / 4294967296 + -1 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) <= 0) || (!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) || ((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) && ((((((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296 + 1 <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888 + 1 <= 0)) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && SIZE / 4294967296 + -1 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) <= 0)) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && SIZE / 4294967296 + -1 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) || SIZE / 4294967296 <= 0))) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && 3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * ((j + i + k) / 4294967296) <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) && (((((!((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 || -1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && !(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) && !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || !(3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * ((j + i + k) / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !(3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * ((j + i + k) / 4294967296) <= 0))))) && 0 <= SIZE + -20000001) && i == 0) && !(0 == cond)) && SIZE <= 20000001) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((0 <= SIZE + -20000001 && !(0 == cond)) && SIZE <= 20000001) || (0 <= SIZE + -20000001 && SIZE <= 20000001)) || (((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0)) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && 0 <= SIZE + -20000001) && i == 0) && !(0 == cond)) && SIZE / 4294967296 <= 0) && SIZE <= 20000001)) || ((((0 <= SIZE + -20000001 && i == 0) && !(0 == cond)) && SIZE / 4294967296 <= 0) && SIZE <= 20000001)) || (((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && j + -1 * k == 0) && (((3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * ((j + i + k) / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || (((((((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || !(SIZE / 4294967296 + -1 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (!(SIZE / 4294967296 + -1 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) <= 0) || (!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) || ((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) && ((((((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296 + 1 <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888 + 1 <= 0)) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && SIZE / 4294967296 + -1 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) <= 0)) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && SIZE / 4294967296 + -1 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) || SIZE / 4294967296 <= 0))) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && 3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * ((j + i + k) / 4294967296) <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) && (((((!((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 || -1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && !(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) && !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || !(3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * ((j + i + k) / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !(3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * ((j + i + k) / 4294967296) <= 0))))) && 0 <= SIZE + -20000001) && i == 0) && !(0 == cond)) && SIZE <= 20000001) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && (!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295)) && ((((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0)) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && 0 <= SIZE + -20000001) && i == 0) && (n + 4294967296 * (i / 4294967296) <= 4294967296 * (n / 4294967296) + i || i / 4294967296 + 1 <= 0)) && SIZE / 4294967296 <= 0) && SIZE <= 20000001) || ((((((((n + 4294967296 * (SIZE / 4294967296) <= SIZE + 4294967296 * (n / 4294967296) && ((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)))) && ((((0 <= SIZE + -20000001 && i == 0) && SIZE / 4294967296 <= 0) && SIZE <= 20000001) || (0 <= SIZE + -20000001 && SIZE <= 20000001))) && 0 <= SIZE / 4294967296 * -1 + n / 4294967296 + (-n + SIZE) / 4294967296) && (((((j * -1 + n % 4294967296 + -4294967296 <= (-j + -1) / 4294967296 * 4294967296 && !(j % 4294967296 <= 2147483647)) && j * -1 + -4294967296 <= (-j + -1) / 4294967296 * 4294967296) && 0 <= j + 4294967296) && j + 4294967296 < 4294967296) || ((((j * -1 + n % 4294967296 <= (-j + 4294967295) / 4294967296 * 4294967296 && j * -1 <= (-j + 4294967295) / 4294967296 * 4294967296) && j < 4294967296) && 0 <= j) && j % 4294967296 <= 2147483647))) && (((12884901888 * (SIZE / 4294967296) + i + 8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 4294967296 * (i / 4294967296 * 2 + (i / 4294967296 * -2 + (3 * i + -3) / 4294967296)) + 3 * SIZE && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || 4294967296 * (SIZE / 4294967296) <= SIZE + -2147483648) || (12884901888 * (SIZE / 4294967296) + i + 8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 4294967296 * (i / 4294967296 * 2 + (i / 4294967296 * -2 + (3 * i + -8589934595) / 4294967296)) + 3 * SIZE && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)))) && (4294967296 * (i / 4294967296) <= i + -4294967297 || 4294967296 * (SIZE / 4294967296) + i <= 4294967296 * (i / 4294967296) + SIZE)) && 12884901888 * (SIZE / 4294967296) + 3 * i <= 4294967296 * ((3 * i + -3) / 4294967296) + 3 * SIZE) && !(i % 4294967296 < n % 4294967296)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0)) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && 0 <= SIZE + -20000001) && i == 0) && SIZE / 4294967296 <= 0) && SIZE <= 20000001) || (((0 <= SIZE + -20000001 && i == 0) && SIZE / 4294967296 <= 0) && SIZE <= 20000001)) || (0 <= SIZE + -20000001 && SIZE <= 20000001)) && n + 4294967296 * (SIZE / 4294967296) <= SIZE + 4294967296 * (n / 4294967296)) && ((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)))) && 0 <= SIZE / 4294967296 * -1 + n / 4294967296 + (-n + SIZE) / 4294967296) && (((!((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 || -1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && !(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) && !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) && (((12884901888 * (SIZE / 4294967296) + i + 8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 4294967296 * (i / 4294967296 * 2 + (i / 4294967296 * -2 + (3 * i + -3) / 4294967296)) + 3 * SIZE && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || 4294967296 * (SIZE / 4294967296) <= SIZE + -2147483648) || (12884901888 * (SIZE / 4294967296) + i + 8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 4294967296 * (i / 4294967296 * 2 + (i / 4294967296 * -2 + (3 * i + -8589934595) / 4294967296)) + 3 * SIZE && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)))) && (4294967296 * (i / 4294967296) <= i + -4294967297 || 4294967296 * (SIZE / 4294967296) + i <= 4294967296 * (i / 4294967296) + SIZE)) && !(j % 4294967296 < n % 4294967296)) && !(k % 4294967296 < n % 4294967296)) && 12884901888 * (SIZE / 4294967296) + 3 * i <= 4294967296 * ((3 * i + -3) / 4294967296) + 3 * SIZE) && ((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && j + -1 * k == 0) && (((((12884901888 * (SIZE / 4294967296) + i + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 4294967296 * ((j + i + k) / 4294967296) + 3 * SIZE && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (4294967296 * ((j + i + k) / 4294967296) <= i + 2 * (i + -4294967296 * (i / 4294967296)) + -4294967299 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (12884901888 * (SIZE / 4294967296) + i + 2 * (i + -4294967296 * (i / 4294967296)) <= 4294967296 * ((j + i + k) / 4294967296) + 3 * SIZE && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || 4294967296 * (SIZE / 4294967296) <= SIZE + -2147483648) || (!(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) && 4294967296 * ((j + i + k) / 4294967296) <= i + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) + -4294967299))) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296 + 1 <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888 + 1 <= 0))) || ((((((((((i + -4294967296 * (i / 4294967296) + -1 * j == 0 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0) || (i + -4294967296 * (i / 4294967296) + -4294967296 + -1 * j == 0 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) && j + -1 * k == 0) && (((3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * ((j + i + k) / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || (((((((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || !(SIZE / 4294967296 + -1 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (!(SIZE / 4294967296 + -1 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) <= 0) || (!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) || ((!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295) && (4294967296 * (i / 4294967296) <= i + -2147483648 || i / 4294967296 + 1 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296) + -4294967296) && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (i <= 4294967296 * (i / 4294967296) + (i + -4294967296 * (i / 4294967296)) && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) && ((((((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296 + 1 <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888 + 1 <= 0)) || ((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && SIZE / 4294967296 + -1 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) <= 0)) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && SIZE / 4294967296 + -1 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) || SIZE / 4294967296 <= 0))) || ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && 3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * ((j + i + k) / 4294967296) <= 0) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)))) && (!(i / 4294967296 + 1 <= 0) || i <= 4294967296 * (i / 4294967296) + 4294967295)) && (((((!((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && (-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0))) || (j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0) && ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 || -1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0) || !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)))) || ((((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + -4294967296 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0 && !(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3))) && !((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1 + -4294967296 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * SIZE + 4294967296 * (SIZE / 4294967296) <= 0)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0))) && ((8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296) + -4294967296) <= 3 * SIZE + 2 * i + -60000003 && !(i + -4294967296 * (i / 4294967296) + -2147483647 <= 0)) || (8589934592 * (i / 4294967296) + 2 * (i + -4294967296 * (i / 4294967296)) <= 3 * SIZE + 2 * i + -60000003 && i + -4294967296 * (i / 4294967296) + -2147483647 <= 0))) || (((-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0 || !(3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * (((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3 + 1) / 4294967296) + -1 * ((j + i + k) / 4294967296) <= 0)) || 0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && ((!(0 == i + j + k + -4294967296 * ((j + i + k) / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 3)) && !(-1 * i + -1 * j + -1 * k + 4294967296 * ((j + i + k) / 4294967296) <= 0)) || !(3 * (SIZE / 4294967296) + -2 * (i / 4294967296) + -3 * ((j + i + k + -4294967296 * ((j + i + k) / 4294967296)) / 12884901888) + -1 * ((j + i + k) / 4294967296) <= 0))))) && 0 <= SIZE + -20000001) && i == 0) && (n + 4294967296 * (i / 4294967296) <= 4294967296 * (n / 4294967296) + i || i / 4294967296 + 1 <= 0)) && SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2023-02-18 16:11:57,500 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