./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/functions_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/functions_1-1.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 d9fc6ec4480297fee1f7419ded78cafcfaf309d48a05ca3c98ab67dd7817eba5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:03:40,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:03:40,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:03:40,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:03:40,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:03:40,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:03:40,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:03:40,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:03:40,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:03:40,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:03:40,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:03:40,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:03:40,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:03:40,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:03:40,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:03:40,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:03:40,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:03:40,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:03:40,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:03:40,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:03:40,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:03:40,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:03:40,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:03:40,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:03:40,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:03:40,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:03:40,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:03:40,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:03:40,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:03:40,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:03:40,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:03:40,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:03:40,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:03:40,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:03:40,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:03:40,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:03:40,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:03:40,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:03:40,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:03:40,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:03:40,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:03:40,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 00:03:40,152 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:03:40,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:03:40,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:03:40,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:03:40,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:03:40,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:03:40,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:03:40,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:03:40,155 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:03:40,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:03:40,156 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:03:40,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:03:40,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:03:40,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:03:40,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:03:40,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:03:40,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:03:40,157 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:03:40,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:03:40,157 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:03:40,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:03:40,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:03:40,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:03:40,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:03:40,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:03:40,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:03:40,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:03:40,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:03:40,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:03:40,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:03:40,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:03:40,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:03:40,161 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:03:40,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:03:40,161 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:03:40,161 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 -> d9fc6ec4480297fee1f7419ded78cafcfaf309d48a05ca3c98ab67dd7817eba5 [2023-02-18 00:03:40,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:03:40,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:03:40,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:03:40,410 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:03:40,411 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:03:40,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/functions_1-1.c [2023-02-18 00:03:41,492 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:03:41,697 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:03:41,698 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/functions_1-1.c [2023-02-18 00:03:41,702 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f2aa010d/50b75f15bf954968a5e880f4052252d9/FLAGd3832ee62 [2023-02-18 00:03:41,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f2aa010d/50b75f15bf954968a5e880f4052252d9 [2023-02-18 00:03:41,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:03:41,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:03:41,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:03:41,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:03:41,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:03:41,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc3442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41, skipping insertion in model container [2023-02-18 00:03:41,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:03:41,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:03:41,842 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/loop-acceleration/functions_1-1.c[325,338] [2023-02-18 00:03:41,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:03:41,864 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:03:41,874 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/loop-acceleration/functions_1-1.c[325,338] [2023-02-18 00:03:41,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:03:41,887 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:03:41,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41 WrapperNode [2023-02-18 00:03:41,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:03:41,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:03:41,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:03:41,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:03:41,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,908 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 28 [2023-02-18 00:03:41,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:03:41,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:03:41,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:03:41,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:03:41,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,922 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:03:41,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:03:41,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:03:41,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:03:41,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (1/1) ... [2023-02-18 00:03:41,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:03:41,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:41,953 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 00:03:41,961 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 00:03:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:03:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:03:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:03:41,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:03:42,045 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:03:42,047 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:03:42,170 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:03:42,175 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:03:42,175 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 00:03:42,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:03:42 BoogieIcfgContainer [2023-02-18 00:03:42,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:03:42,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:03:42,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:03:42,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:03:42,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:03:41" (1/3) ... [2023-02-18 00:03:42,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183fc3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:03:42, skipping insertion in model container [2023-02-18 00:03:42,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:41" (2/3) ... [2023-02-18 00:03:42,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183fc3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:03:42, skipping insertion in model container [2023-02-18 00:03:42,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:03:42" (3/3) ... [2023-02-18 00:03:42,197 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_1-1.c [2023-02-18 00:03:42,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:03:42,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:03:42,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:03:42,310 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;@76c93931, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:03:42,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:03:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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 00:03:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 00:03:42,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:42,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 00:03:42,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 889635821, now seen corresponding path program 1 times [2023-02-18 00:03:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:42,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890558095] [2023-02-18 00:03:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:42,551 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 00:03:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:42,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890558095] [2023-02-18 00:03:42,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890558095] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:03:42,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:03:42,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 00:03:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026649816] [2023-02-18 00:03:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:03:42,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 00:03:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 00:03:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:03:42,584 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:03:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:42,612 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-02-18 00:03:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 00:03:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-02-18 00:03:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:42,625 INFO L225 Difference]: With dead ends: 22 [2023-02-18 00:03:42,626 INFO L226 Difference]: Without dead ends: 10 [2023-02-18 00:03:42,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 00:03:42,634 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:03:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-02-18 00:03:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-02-18 00:03:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 00:03:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-02-18 00:03:42,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2023-02-18 00:03:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:42,663 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-02-18 00:03:42,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:03:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-02-18 00:03:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 00:03:42,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:42,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:03:42,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:03:42,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 294764431, now seen corresponding path program 1 times [2023-02-18 00:03:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:42,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753025957] [2023-02-18 00:03:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:42,797 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 00:03:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:42,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753025957] [2023-02-18 00:03:42,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753025957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:42,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870241677] [2023-02-18 00:03:42,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:42,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:42,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:42,826 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 00:03:42,827 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 00:03:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:42,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 00:03:42,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:03:42,997 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 00:03:43,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:03:43,046 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 00:03:43,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870241677] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:03:43,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:03:43,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-18 00:03:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764233988] [2023-02-18 00:03:43,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:03:43,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 00:03:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:43,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 00:03:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:03:43,051 INFO L87 Difference]: Start difference. First operand 9 states and 9 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 00:03:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:43,111 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-02-18 00:03:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:03:43,112 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 8 [2023-02-18 00:03:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:43,113 INFO L225 Difference]: With dead ends: 17 [2023-02-18 00:03:43,113 INFO L226 Difference]: Without dead ends: 13 [2023-02-18 00:03:43,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:03:43,117 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:43,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:03:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-02-18 00:03:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-18 00:03:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 00:03:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-02-18 00:03:43,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2023-02-18 00:03:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:43,126 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-02-18 00:03:43,127 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 00:03:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-02-18 00:03:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 00:03:43,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:43,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2023-02-18 00:03:43,132 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 00:03:43,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:43,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1489810771, now seen corresponding path program 2 times [2023-02-18 00:03:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328092595] [2023-02-18 00:03:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:43,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328092595] [2023-02-18 00:03:43,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328092595] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:43,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979854989] [2023-02-18 00:03:43,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:03:43,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:43,631 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 00:03:43,636 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 00:03:43,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:03:43,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:03:43,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 00:03:43,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:03:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:43,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:03:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:43,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979854989] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:03:43,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:03:43,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-02-18 00:03:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078250385] [2023-02-18 00:03:43,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:03:43,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 00:03:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 00:03:43,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-18 00:03:43,873 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 00:03:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:44,139 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-02-18 00:03:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 00:03:44,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 00:03:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:44,141 INFO L225 Difference]: With dead ends: 25 [2023-02-18 00:03:44,141 INFO L226 Difference]: Without dead ends: 21 [2023-02-18 00:03:44,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2023-02-18 00:03:44,143 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:44,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 36 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:03:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-18 00:03:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-18 00:03:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 00:03:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2023-02-18 00:03:44,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2023-02-18 00:03:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:44,148 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2023-02-18 00:03:44,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 00:03:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2023-02-18 00:03:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 00:03:44,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:44,153 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2023-02-18 00:03:44,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 00:03:44,353 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,SelfDestructingSolverStorable2 [2023-02-18 00:03:44,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1781144283, now seen corresponding path program 3 times [2023-02-18 00:03:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400173134] [2023-02-18 00:03:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400173134] [2023-02-18 00:03:44,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400173134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:44,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705778365] [2023-02-18 00:03:44,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 00:03:44,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:44,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:44,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:03:44,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 00:03:44,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-02-18 00:03:44,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:03:44,827 WARN L261 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-18 00:03:44,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:03:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:44,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:03:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705778365] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:03:45,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:03:45,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2023-02-18 00:03:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778731567] [2023-02-18 00:03:45,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:03:45,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-18 00:03:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:45,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-18 00:03:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 00:03:45,316 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 00:03:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:48,525 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-02-18 00:03:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-18 00:03:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 20 [2023-02-18 00:03:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:48,527 INFO L225 Difference]: With dead ends: 41 [2023-02-18 00:03:48,527 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 00:03:48,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=895, Invalid=2765, Unknown=0, NotChecked=0, Total=3660 [2023-02-18 00:03:48,529 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 119 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:48,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 75 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 00:03:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 00:03:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-18 00:03:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 00:03:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-02-18 00:03:48,539 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2023-02-18 00:03:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:48,540 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-02-18 00:03:48,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 00:03:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-02-18 00:03:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 00:03:48,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:48,545 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2023-02-18 00:03:48,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 00:03:48,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:48,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 685690347, now seen corresponding path program 4 times [2023-02-18 00:03:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:48,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337827761] [2023-02-18 00:03:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:49,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337827761] [2023-02-18 00:03:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337827761] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:49,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68790551] [2023-02-18 00:03:49,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 00:03:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:49,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:03:49,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 00:03:49,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 00:03:49,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:03:49,861 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-18 00:03:49,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:03:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:50,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:03:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-02-18 00:03:51,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68790551] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:51,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-18 00:03:51,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [33, 34] total 38 [2023-02-18 00:03:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409455681] [2023-02-18 00:03:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:03:51,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:03:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:51,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:03:51,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 00:03:51,457 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 00:03:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:51,554 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2023-02-18 00:03:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 00:03:51,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 36 [2023-02-18 00:03:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:51,556 INFO L225 Difference]: With dead ends: 37 [2023-02-18 00:03:51,556 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 00:03:51,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 31 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2023-02-18 00:03:51,557 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:51,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:03:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 00:03:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 00:03:51,558 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 00:03:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 00:03:51,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2023-02-18 00:03:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:51,559 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 00:03:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 00:03:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 00:03:51,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 00:03:51,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 00:03:51,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 00:03:51,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:51,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 00:03:51,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 00:03:51,776 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (let ((.cse29 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (.cse28 (mod |ULTIMATE.start_f_#res#1| 4294967296))) (let ((.cse24 (< .cse28 0)) (.cse30 (mod |ULTIMATE.start_f_#res#1| 2)) (.cse27 (< .cse29 0)) (.cse31 (mod |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse16 (= (mod .cse31 4294967296) 0)) (.cse17 (not .cse27)) (.cse19 (= (mod (+ .cse31 4294967294) 4294967296) 0)) (.cse18 (= .cse31 0)) (.cse22 (= .cse30 0)) (.cse20 (= (mod .cse30 4294967296) 0)) (.cse21 (= (mod (+ 4294967294 .cse30) 4294967296) 0)) (.cse23 (not .cse24))) (let ((.cse6 (< (mod (+ |ULTIMATE.start_f_#res#1| 8) 4294967296) 268435455)) (.cse7 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455)) (.cse13 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455)) (.cse14 (< (mod (+ |ULTIMATE.start_f_#res#1| 10) 4294967296) 268435455)) (.cse8 (< (mod (+ |ULTIMATE.start_f_#res#1| 6) 4294967296) 268435455)) (.cse15 (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)) (.cse0 (< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)) (.cse1 (< .cse29 268435455)) (.cse2 (< .cse28 268435455)) (.cse3 (or .cse22 (not .cse20) .cse21 .cse23)) (.cse4 (or .cse16 (let ((.cse26 (not .cse18))) (and (or (and .cse26 .cse27) (not .cse19)) (or (and .cse26 (or .cse17 .cse18) .cse27) .cse19))))) (.cse5 (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)) (.cse9 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)) (.cse10 (< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)) (.cse11 (or .cse20 (let ((.cse25 (not .cse22))) (and (or .cse21 (and (or .cse22 .cse23) .cse24 .cse25)) (or (and .cse24 .cse25) (not .cse21)))))) (.cse12 (or (not .cse16) .cse17 .cse18 .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 (<= |ULTIMATE.start_f_#res#1| 12) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 12))) .cse3 .cse4 (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 12))) (<= |ULTIMATE.start_main_~x~0#1| 12) .cse11 .cse12) (and (<= |ULTIMATE.start_main_~x~0#1| 14) .cse3 .cse4 (<= |ULTIMATE.start_f_#res#1| 14) (<= 0 (+ (- 14) |ULTIMATE.start_main_~x~0#1|)) (<= 0 (+ (- 14) |ULTIMATE.start_f_#res#1|)) .cse11 .cse12) (and .cse1 .cse2 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 4))) (<= |ULTIMATE.start_f_#res#1| 4) (<= |ULTIMATE.start_main_~x~0#1| 4) .cse3 .cse4 (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 4))) .cse11 .cse12) (and .cse4 (= |ULTIMATE.start_main_~x~0#1| 0) .cse12) (and .cse3 .cse4 .cse11 .cse12) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 6))) .cse3 .cse4 (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 6))) .cse11 (<= |ULTIMATE.start_main_~x~0#1| 6) .cse12 (<= |ULTIMATE.start_f_#res#1| 6)) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and (<= |ULTIMATE.start_f_#res#1| 10) (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 10))) .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_main_~x~0#1| 10) .cse10 .cse11 .cse12 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 10)))) (and (<= 0 (+ (- 2) |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_f_#res#1| 2) .cse3 .cse4 (<= 0 (+ (- 2) |ULTIMATE.start_f_#res#1|)) (<= |ULTIMATE.start_main_~x~0#1| 2) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (mod (+ |ULTIMATE.start_f_#res#1| 12) 4294967296) 268435455) .cse12 .cse13 .cse14 .cse15 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11 .cse12) (and (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 8))) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_f_#res#1| 8) .cse3 .cse4 .cse5 .cse9 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse10 (<= |ULTIMATE.start_main_~x~0#1| 8) .cse11 .cse12)))))) [2023-02-18 00:03:51,777 INFO L895 garLoopResultBuilder]: At program point f_returnLabel#1(lines 12 14) the Hoare annotation is: (let ((.cse29 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (.cse28 (mod |ULTIMATE.start_f_#res#1| 4294967296))) (let ((.cse24 (< .cse28 0)) (.cse30 (mod |ULTIMATE.start_f_#res#1| 2)) (.cse27 (< .cse29 0)) (.cse31 (mod |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse16 (= (mod .cse31 4294967296) 0)) (.cse17 (not .cse27)) (.cse19 (= (mod (+ .cse31 4294967294) 4294967296) 0)) (.cse18 (= .cse31 0)) (.cse22 (= .cse30 0)) (.cse20 (= (mod .cse30 4294967296) 0)) (.cse21 (= (mod (+ 4294967294 .cse30) 4294967296) 0)) (.cse23 (not .cse24))) (let ((.cse8 (< (mod (+ |ULTIMATE.start_f_#res#1| 8) 4294967296) 268435455)) (.cse13 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455)) (.cse11 (< (mod (+ |ULTIMATE.start_f_#res#1| 10) 4294967296) 268435455)) (.cse6 (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)) (.cse9 (< (mod (+ |ULTIMATE.start_f_#res#1| 6) 4294967296) 268435455)) (.cse12 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)) (.cse14 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455)) (.cse15 (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)) (.cse7 (< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)) (.cse5 (< .cse29 268435455)) (.cse0 (< .cse28 268435455)) (.cse1 (or .cse22 (not .cse20) .cse21 .cse23)) (.cse2 (or .cse16 (let ((.cse26 (not .cse18))) (and (or (and .cse26 .cse27) (not .cse19)) (or (and .cse26 (or .cse17 .cse18) .cse27) .cse19))))) (.cse10 (< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)) (.cse3 (or .cse20 (let ((.cse25 (not .cse22))) (and (or .cse21 (and (or .cse22 .cse23) .cse24 .cse25)) (or (and .cse24 .cse25) (not .cse21)))))) (.cse4 (or (not .cse16) .cse17 .cse18 .cse19))) (or (and (<= 0 (+ (- 2) |ULTIMATE.start_main_~x~0#1|)) .cse0 (<= |ULTIMATE.start_f_#res#1| 4) .cse1 .cse2 (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 4))) (<= |ULTIMATE.start_main_~x~0#1| 2) .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse6 .cse3 .cse4) (and (<= |ULTIMATE.start_f_#res#1| 2) .cse1 .cse2 (<= 0 (+ (- 2) |ULTIMATE.start_f_#res#1|)) (= |ULTIMATE.start_main_~x~0#1| 0) .cse3 .cse4) (and .cse7 (<= |ULTIMATE.start_main_~x~0#1| 14) .cse5 .cse0 .cse1 .cse2 .cse8 .cse9 (<= 0 (+ (- 14) |ULTIMATE.start_main_~x~0#1|)) .cse10 .cse3 (< (mod (+ |ULTIMATE.start_f_#res#1| 12) 4294967296) 268435455) .cse4 .cse11) (and .cse5 .cse0 .cse1 .cse2 .cse6 .cse12 .cse10 .cse3 .cse4) (and .cse5 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 12))) .cse1 .cse2 (<= |ULTIMATE.start_f_#res#1| 14) (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 0 (+ (- 14) |ULTIMATE.start_f_#res#1|)) .cse3 .cse4) (and .cse7 .cse5 .cse0 .cse1 .cse2 .cse6 .cse8 .cse13 .cse9 .cse12 .cse10 .cse3 .cse4 .cse14 .cse15) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse0 .cse1 .cse2 .cse6 .cse12 .cse10 .cse3 .cse4 .cse15) (and .cse5 .cse0 (<= |ULTIMATE.start_f_#res#1| 12) .cse1 .cse2 .cse6 (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 12))) .cse3 .cse4 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 10)))) (and .cse5 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 4))) (<= |ULTIMATE.start_main_~x~0#1| 4) .cse1 .cse2 (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 6))) .cse3 .cse4 (<= |ULTIMATE.start_f_#res#1| 6)) (and (<= |ULTIMATE.start_f_#res#1| 10) (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 10))) .cse5 .cse0 .cse1 .cse2 .cse6 .cse12 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse10 (<= |ULTIMATE.start_main_~x~0#1| 8) .cse3 .cse4) (and .cse7 .cse5 .cse0 .cse1 .cse2 .cse6 .cse8 .cse13 .cse9 .cse12 .cse10 .cse3 .cse4 .cse14 .cse11 .cse15 (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455)) (and .cse7 .cse5 .cse0 .cse1 .cse2 .cse6 .cse9 .cse12 .cse10 .cse3 .cse4 .cse14 .cse15) (and (<= 0 (+ |ULTIMATE.start_f_#res#1| (- 8))) .cse7 .cse5 .cse0 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| (- 6))) (<= |ULTIMATE.start_f_#res#1| 8) .cse1 .cse2 .cse10 .cse3 (<= |ULTIMATE.start_main_~x~0#1| 6) .cse4)))))) [2023-02-18 00:03:51,777 INFO L899 garLoopResultBuilder]: For program point L19-3(lines 19 21) no Hoare annotation was computed. [2023-02-18 00:03:51,777 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 00:03:51,777 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 00:03:51,777 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 00:03:51,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 00:03:51,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2023-02-18 00:03:51,778 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 24) no Hoare annotation was computed. [2023-02-18 00:03:51,778 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-02-18 00:03:51,778 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2023-02-18 00:03:51,781 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-18 00:03:51,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 00:03:51,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 12:03:51 BoogieIcfgContainer [2023-02-18 00:03:51,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 00:03:51,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 00:03:51,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 00:03:51,834 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 00:03:51,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:03:42" (3/4) ... [2023-02-18 00:03:51,837 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 00:03:51,845 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 00:03:51,845 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 00:03:51,846 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 00:03:51,846 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 00:03:51,871 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (\result + 10) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455) || (((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && \result <= 12) && 0 <= x + -12) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -12) && x <= 12) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((x <= 14 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && \result <= 14) && 0 <= -14 + x) && 0 <= -14 + \result) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && 0 <= x + -4) && \result <= 4) && x <= 4) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -4) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0))) && x == 0) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0)) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((0 <= x + -6 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -6) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && x <= 6) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && \result <= 6)) || (((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455)) || (((((((((((\result <= 10 && 0 <= \result + -10) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && x <= 10) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && 0 <= x + -10)) || (((((((0 <= -2 + x && \result <= 2) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= -2 + \result) && x <= 2) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (\result + 12) % 4294967296 < 268435455) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (\result + 10) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455) && (x + 12) % 4294967296 < 268435455)) || ((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (6 + x) % 4294967296 < 268435455)) || (((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((((0 <= \result + -8 && (\result + 4) % 4294967296 < 268435455) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && \result <= 8) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && 0 <= x + -8) && (\result + 2) % 4294967296 < 268435455) && x <= 8) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) [2023-02-18 00:03:51,874 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 <= -2 + x && \result % 4294967296 < 268435455) && \result <= 4) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -4) && x <= 2) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) || ((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((\result <= 2 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= -2 + \result) && x == 0) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((((\result + 4) % 4294967296 < 268435455 && x <= 14) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result + 8) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && 0 <= -14 + x) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (\result + 12) % 4294967296 < 268435455) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (\result + 10) % 4294967296 < 268435455)) || ((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((x % 4294967296 < 268435455 && 0 <= x + -12) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && \result <= 14) && x <= 12) && 0 <= -14 + \result) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455)) || ((((x % 4294967296 < 268435455 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (6 + x) % 4294967296 < 268435455)) || ((((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && \result <= 12) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && x <= 10) && 0 <= \result + -12) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && 0 <= x + -10)) || ((((((((x % 4294967296 < 268435455 && 0 <= x + -4) && x <= 4) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -6) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && \result <= 6)) || ((((((((((((\result <= 10 && 0 <= \result + -10) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && 0 <= x + -8) && (\result + 2) % 4294967296 < 268435455) && x <= 8) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (\result + 10) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455) && (x + 12) % 4294967296 < 268435455)) || (((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455)) || (((((((((((0 <= \result + -8 && (\result + 4) % 4294967296 < 268435455) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && 0 <= x + -6) && \result <= 8) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && x <= 6) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) [2023-02-18 00:03:51,880 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 00:03:51,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 00:03:51,880 INFO L158 Benchmark]: Toolchain (without parser) took 10163.35ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 98.6MB in the beginning and 74.0MB in the end (delta: 24.6MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2023-02-18 00:03:51,881 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory was 99.0MB in the beginning and 98.9MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:03:51,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.86ms. Allocated memory is still 130.0MB. Free memory was 98.6MB in the beginning and 88.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 00:03:51,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.01ms. Allocated memory is still 130.0MB. Free memory was 88.7MB in the beginning and 87.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:03:51,882 INFO L158 Benchmark]: Boogie Preprocessor took 14.69ms. Allocated memory is still 130.0MB. Free memory was 87.3MB in the beginning and 86.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:03:51,882 INFO L158 Benchmark]: RCFGBuilder took 252.64ms. Allocated memory is still 130.0MB. Free memory was 86.1MB in the beginning and 77.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 00:03:51,882 INFO L158 Benchmark]: TraceAbstraction took 9653.93ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 76.5MB in the beginning and 76.1MB in the end (delta: 464.9kB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2023-02-18 00:03:51,883 INFO L158 Benchmark]: Witness Printer took 46.69ms. Allocated memory is still 157.3MB. Free memory was 76.1MB in the beginning and 74.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:03:51,885 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory was 99.0MB in the beginning and 98.9MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.86ms. Allocated memory is still 130.0MB. Free memory was 98.6MB in the beginning and 88.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.01ms. Allocated memory is still 130.0MB. Free memory was 88.7MB in the beginning and 87.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.69ms. Allocated memory is still 130.0MB. Free memory was 87.3MB in the beginning and 86.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.64ms. Allocated memory is still 130.0MB. Free memory was 86.1MB in the beginning and 77.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9653.93ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 76.5MB in the beginning and 76.1MB in the end (delta: 464.9kB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 46.69ms. Allocated memory is still 157.3MB. Free memory was 76.1MB in the beginning and 74.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 31 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 77 SyntacticMatches, 49 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 64, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 33 NumberOfFragments, 6961 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 4334 SizeOfPredicates, 110 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 225/852 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: 19]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (\result + 10) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455) || (((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && \result <= 12) && 0 <= x + -12) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -12) && x <= 12) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((x <= 14 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && \result <= 14) && 0 <= -14 + x) && 0 <= -14 + \result) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && 0 <= x + -4) && \result <= 4) && x <= 4) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -4) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0))) && x == 0) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0)) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((0 <= x + -6 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -6) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && x <= 6) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && \result <= 6)) || (((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455)) || (((((((((((\result <= 10 && 0 <= \result + -10) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && x <= 10) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && 0 <= x + -10)) || (((((((0 <= -2 + x && \result <= 2) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= -2 + \result) && x <= 2) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (\result + 12) % 4294967296 < 268435455) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (\result + 10) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455) && (x + 12) % 4294967296 < 268435455)) || ((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (6 + x) % 4294967296 < 268435455)) || (((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((((0 <= \result + -8 && (\result + 4) % 4294967296 < 268435455) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && \result <= 8) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && 0 <= x + -8) && (\result + 2) % 4294967296 < 268435455) && x <= 8) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 <= -2 + x && \result % 4294967296 < 268435455) && \result <= 4) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -4) && x <= 2) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) || ((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((\result <= 2 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= -2 + \result) && x == 0) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((((((((\result + 4) % 4294967296 < 268435455 && x <= 14) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result + 8) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && 0 <= -14 + x) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (\result + 12) % 4294967296 < 268435455) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (\result + 10) % 4294967296 < 268435455)) || ((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || ((((((((x % 4294967296 < 268435455 && 0 <= x + -12) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && \result <= 14) && x <= 12) && 0 <= -14 + \result) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455)) || ((((x % 4294967296 < 268435455 && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (6 + x) % 4294967296 < 268435455)) || ((((((((((x % 4294967296 < 268435455 && \result % 4294967296 < 268435455) && \result <= 12) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && x <= 10) && 0 <= \result + -12) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && 0 <= x + -10)) || ((((((((x % 4294967296 < 268435455 && 0 <= x + -4) && x <= 4) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && 0 <= \result + -6) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && \result <= 6)) || ((((((((((((\result <= 10 && 0 <= \result + -10) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && 0 <= x + -8) && (\result + 2) % 4294967296 < 268435455) && x <= 8) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0))) || (((((((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 8) % 4294967296 < 268435455) && (x + 10) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (\result + 10) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455) && (x + 12) % 4294967296 < 268435455)) || (((((((((((((\result + 4) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (2 + x) % 4294967296 < 268435455) && (\result + 6) % 4294967296 < 268435455) && (x + 4) % 4294967296 < 268435455) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) && (x + 8) % 4294967296 < 268435455) && (6 + x) % 4294967296 < 268435455)) || (((((((((((0 <= \result + -8 && (\result + 4) % 4294967296 < 268435455) && x % 4294967296 < 268435455) && \result % 4294967296 < 268435455) && 0 <= x + -6) && \result <= 8) && (((\result % 2 == 0 || !(\result % 2 % 4294967296 == 0)) || (4294967294 + \result % 2) % 4294967296 == 0) || !(\result % 4294967296 < 0))) && (x % 2 % 4294967296 == 0 || (((!(x % 2 == 0) && x % 4294967296 < 0) || !((x % 2 + 4294967294) % 4294967296 == 0)) && (((!(x % 2 == 0) && (!(x % 4294967296 < 0) || x % 2 == 0)) && x % 4294967296 < 0) || (x % 2 + 4294967294) % 4294967296 == 0)))) && (\result + 2) % 4294967296 < 268435455) && (\result % 2 % 4294967296 == 0 || (((4294967294 + \result % 2) % 4294967296 == 0 || (((\result % 2 == 0 || !(\result % 4294967296 < 0)) && \result % 4294967296 < 0) && !(\result % 2 == 0))) && ((\result % 4294967296 < 0 && !(\result % 2 == 0)) || !((4294967294 + \result % 2) % 4294967296 == 0))))) && x <= 6) && (((!(x % 2 % 4294967296 == 0) || !(x % 4294967296 < 0)) || x % 2 == 0) || (x % 2 + 4294967294) % 4294967296 == 0)) - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-18 00:03:51,929 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