./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/functions_1-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-2.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 3c699f32b26271d9b8672d2685c3f1aa3d3ad54df32baf7d1d77d9a96ddd2517 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:01:12,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:01:12,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:01:12,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:01:12,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:01:12,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:01:12,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:01:12,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:01:12,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:01:12,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:01:12,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:01:12,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:01:12,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:01:12,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:01:12,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:01:12,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:01:12,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:01:12,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:01:12,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:01:12,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:01:12,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:01:12,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:01:12,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:01:12,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:01:12,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:01:12,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:01:12,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:01:12,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:01:12,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:01:12,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:01:12,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:01:12,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:01:12,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:01:12,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:01:12,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:01:12,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:01:12,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:01:12,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:01:12,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:01:12,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:01:12,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:01:12,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:01:12,271 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:01:12,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:01:12,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:01:12,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:01:12,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:01:12,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:01:12,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:01:12,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:01:12,274 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:01:12,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:01:12,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:01:12,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:01:12,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:01:12,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:01:12,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:01:12,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:01:12,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:01:12,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:01:12,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:01:12,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:01:12,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:01:12,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:01:12,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:01:12,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:01:12,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:01:12,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:01:12,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:01:12,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:01:12,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:01:12,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:01:12,279 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:01:12,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:01:12,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:01:12,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 3c699f32b26271d9b8672d2685c3f1aa3d3ad54df32baf7d1d77d9a96ddd2517 [2022-02-20 17:01:12,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:01:12,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:01:12,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:01:12,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:01:12,546 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:01:12,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/functions_1-2.c [2022-02-20 17:01:12,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b55b12898/03ad0eb8004e4e4f885c434adbd53a21/FLAGffa9bad3b [2022-02-20 17:01:12,988 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:01:12,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/functions_1-2.c [2022-02-20 17:01:12,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b55b12898/03ad0eb8004e4e4f885c434adbd53a21/FLAGffa9bad3b [2022-02-20 17:01:13,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b55b12898/03ad0eb8004e4e4f885c434adbd53a21 [2022-02-20 17:01:13,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:01:13,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:01:13,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:01:13,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:01:13,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:01:13,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b14a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13, skipping insertion in model container [2022-02-20 17:01:13,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:01:13,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:01:13,175 WARN L230 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-2.c[325,338] [2022-02-20 17:01:13,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:01:13,194 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:01:13,206 WARN L230 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-2.c[325,338] [2022-02-20 17:01:13,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:01:13,220 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:01:13,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13 WrapperNode [2022-02-20 17:01:13,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:01:13,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:01:13,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:01:13,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:01:13,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,264 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 28 [2022-02-20 17:01:13,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:01:13,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:01:13,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:01:13,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:01:13,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:01:13,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:01:13,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:01:13,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:01:13,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (1/1) ... [2022-02-20 17:01:13,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:01:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:01:13,318 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) [2022-02-20 17:01:13,320 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 [2022-02-20 17:01:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:01:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:01:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:01:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:01:13,395 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:01:13,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:01:13,490 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:01:13,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:01:13,496 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:01:13,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:01:13 BoogieIcfgContainer [2022-02-20 17:01:13,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:01:13,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:01:13,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:01:13,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:01:13,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:01:13" (1/3) ... [2022-02-20 17:01:13,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112adab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:01:13, skipping insertion in model container [2022-02-20 17:01:13,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:01:13" (2/3) ... [2022-02-20 17:01:13,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112adab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:01:13, skipping insertion in model container [2022-02-20 17:01:13,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:01:13" (3/3) ... [2022-02-20 17:01:13,505 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-2.c [2022-02-20 17:01:13,509 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:01:13,510 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:01:13,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:01:13,557 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:01:13,558 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:01:13,583 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) [2022-02-20 17:01:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:01:13,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:01:13,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:01:13,588 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:01:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:01:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash 889635821, now seen corresponding path program 1 times [2022-02-20 17:01:13,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:01:13,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585576494] [2022-02-20 17:01:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:01:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:13,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15#true} is VALID [2022-02-20 17:01:13,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {17#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:13,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 < 268435455); {16#false} is VALID [2022-02-20 17:01:13,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 17:01:13,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 17:01:13,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 17:01:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:13,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:01:13,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585576494] [2022-02-20 17:01:13,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585576494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:01:13,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:01:13,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:01:13,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990765088] [2022-02-20 17:01:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:01:13,916 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 [2022-02-20 17:01:13,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:01:13,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:01:13,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:13,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:01:13,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:01:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:01:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:01:13,970 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) [2022-02-20 17:01:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:14,040 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 17:01:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:01:14,041 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 [2022-02-20 17:01:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:01:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 17:01:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 17:01:14,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-20 17:01:14,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:14,100 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:01:14,101 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:01:14,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:01:14,108 INFO L933 BasicCegarLoop]: 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 [2022-02-20 17:01:14,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:01:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:01:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-02-20 17:01:14,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:01:14,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second 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) [2022-02-20 17:01:14,136 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second 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) [2022-02-20 17:01:14,137 INFO L87 Difference]: Start difference. First operand 10 states. Second 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) [2022-02-20 17:01:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:14,140 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:01:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:01:14,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:14,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:14,141 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 10 states. [2022-02-20 17:01:14,141 INFO L87 Difference]: Start difference. First 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) Second operand 10 states. [2022-02-20 17:01:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:14,148 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:01:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:01:14,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:14,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:14,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:01:14,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:01:14,150 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) [2022-02-20 17:01:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 17:01:14,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-02-20 17:01:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:01:14,153 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 17:01:14,153 INFO L471 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) [2022-02-20 17:01:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:01:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:01:14,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:01:14,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:01:14,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:01:14,157 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:01:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:01:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash 294764431, now seen corresponding path program 1 times [2022-02-20 17:01:14,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:01:14,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153334552] [2022-02-20 17:01:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:01:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:14,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {80#true} is VALID [2022-02-20 17:01:14,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {82#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:14,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {83#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:14,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {83#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {84#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:14,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 < 268435455); {81#false} is VALID [2022-02-20 17:01:14,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {81#false} is VALID [2022-02-20 17:01:14,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#false} assume 0 == __VERIFIER_assert_~cond#1; {81#false} is VALID [2022-02-20 17:01:14,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#false} assume !false; {81#false} is VALID [2022-02-20 17:01:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:14,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:01:14,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153334552] [2022-02-20 17:01:14,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153334552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:01:14,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816153356] [2022-02-20 17:01:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:14,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:14,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:01:14,321 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) [2022-02-20 17:01:14,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:01:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:14,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:01:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:14,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:01:14,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {80#true} is VALID [2022-02-20 17:01:14,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {82#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:14,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {83#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:14,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {83#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {97#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:14,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {97#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 < 268435455); {81#false} is VALID [2022-02-20 17:01:14,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {81#false} is VALID [2022-02-20 17:01:14,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#false} assume 0 == __VERIFIER_assert_~cond#1; {81#false} is VALID [2022-02-20 17:01:14,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#false} assume !false; {81#false} is VALID [2022-02-20 17:01:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:14,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:01:14,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#false} assume !false; {81#false} is VALID [2022-02-20 17:01:14,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#false} assume 0 == __VERIFIER_assert_~cond#1; {81#false} is VALID [2022-02-20 17:01:14,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {81#false} is VALID [2022-02-20 17:01:14,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} assume !(main_~x~0#1 % 4294967296 < 268435455); {81#false} is VALID [2022-02-20 17:01:14,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {119#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:14,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {123#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:14,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {127#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:14,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {80#true} is VALID [2022-02-20 17:01:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:14,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816153356] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:01:14,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:01:14,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-20 17:01:14,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785118194] [2022-02-20 17:01:14,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:01:14,699 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 [2022-02-20 17:01:14,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:01:14,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:01:14,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:14,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:01:14,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:01:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:01:14,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:01:14,714 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) [2022-02-20 17:01:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:14,857 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 17:01:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:01:14,858 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 [2022-02-20 17:01:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:01:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-20 17:01:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-20 17:01:14,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2022-02-20 17:01:14,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:14,889 INFO L225 Difference]: With dead ends: 17 [2022-02-20 17:01:14,890 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:01:14,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:01:14,896 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:01:14,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:01:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:01:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:01:14,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:01:14,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second 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) [2022-02-20 17:01:14,912 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second 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) [2022-02-20 17:01:14,912 INFO L87 Difference]: Start difference. First operand 13 states. Second 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) [2022-02-20 17:01:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:14,913 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 17:01:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 17:01:14,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:14,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:14,915 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 13 states. [2022-02-20 17:01:14,915 INFO L87 Difference]: Start difference. First 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) Second operand 13 states. [2022-02-20 17:01:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:14,916 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 17:01:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 17:01:14,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:14,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:14,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:01:14,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:01:14,918 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) [2022-02-20 17:01:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-20 17:01:14,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2022-02-20 17:01:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:01:14,920 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-20 17:01:14,920 INFO L471 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) [2022-02-20 17:01:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 17:01:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:01:14,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:01:14,922 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-02-20 17:01:14,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:01:15,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:15,132 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:01:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:01:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1489810771, now seen corresponding path program 2 times [2022-02-20 17:01:15,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:01:15,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008184341] [2022-02-20 17:01:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:01:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:15,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {211#true} is VALID [2022-02-20 17:01:15,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {213#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:15,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {214#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:15,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {215#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:15,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {216#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} is VALID [2022-02-20 17:01:15,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {217#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:15,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {218#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} is VALID [2022-02-20 17:01:15,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {219#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:01:15,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !(main_~x~0#1 % 4294967296 < 268435455); {212#false} is VALID [2022-02-20 17:01:15,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {212#false} is VALID [2022-02-20 17:01:15,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#false} assume 0 == __VERIFIER_assert_~cond#1; {212#false} is VALID [2022-02-20 17:01:15,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-02-20 17:01:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:15,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:01:15,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008184341] [2022-02-20 17:01:15,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008184341] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:01:15,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748515549] [2022-02-20 17:01:15,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:01:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:01:15,299 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) [2022-02-20 17:01:15,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:01:15,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:01:15,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:01:15,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 17:01:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:15,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:01:15,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {211#true} is VALID [2022-02-20 17:01:15,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {213#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:15,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {214#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:15,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {215#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:15,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {216#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} is VALID [2022-02-20 17:01:15,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {217#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:15,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {218#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} is VALID [2022-02-20 17:01:15,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {244#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:01:15,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !(main_~x~0#1 % 4294967296 < 268435455); {212#false} is VALID [2022-02-20 17:01:15,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {212#false} is VALID [2022-02-20 17:01:15,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#false} assume 0 == __VERIFIER_assert_~cond#1; {212#false} is VALID [2022-02-20 17:01:15,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-02-20 17:01:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:15,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:01:15,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-02-20 17:01:15,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#false} assume 0 == __VERIFIER_assert_~cond#1; {212#false} is VALID [2022-02-20 17:01:15,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {212#false} is VALID [2022-02-20 17:01:15,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} assume !(main_~x~0#1 % 4294967296 < 268435455); {212#false} is VALID [2022-02-20 17:01:15,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {266#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {270#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#(< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {274#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {282#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {278#(< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#(< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {282#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#(< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {286#(< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {290#(< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:15,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {211#true} is VALID [2022-02-20 17:01:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:15,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748515549] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:01:15,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:01:15,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-02-20 17:01:15,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276931258] [2022-02-20 17:01:15,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:01:15,890 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 [2022-02-20 17:01:15,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:01:15,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:01:15,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:15,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 17:01:15,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:01:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 17:01:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:01:15,915 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) [2022-02-20 17:01:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:16,665 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 17:01:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:01:16,665 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 [2022-02-20 17:01:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:01:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-02-20 17:01:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-02-20 17:01:16,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2022-02-20 17:01:16,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:16,707 INFO L225 Difference]: With dead ends: 25 [2022-02-20 17:01:16,707 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:01:16,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2022-02-20 17:01:16,709 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:01:16,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:01:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:01:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:01:16,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:01:16,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second 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) [2022-02-20 17:01:16,750 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second 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) [2022-02-20 17:01:16,750 INFO L87 Difference]: Start difference. First operand 21 states. Second 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) [2022-02-20 17:01:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:16,751 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 17:01:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 17:01:16,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:16,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:16,752 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 21 states. [2022-02-20 17:01:16,752 INFO L87 Difference]: Start difference. First 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) Second operand 21 states. [2022-02-20 17:01:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:16,754 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 17:01:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 17:01:16,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:16,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:16,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:01:16,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:01:16,755 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) [2022-02-20 17:01:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-02-20 17:01:16,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2022-02-20 17:01:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:01:16,757 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-02-20 17:01:16,757 INFO L471 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) [2022-02-20 17:01:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 17:01:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:01:16,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:01:16,758 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2022-02-20 17:01:16,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:01:16,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:01:16,972 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:01:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:01:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1781144283, now seen corresponding path program 3 times [2022-02-20 17:01:16,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:01:16,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656039416] [2022-02-20 17:01:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:01:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:17,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {438#true} is VALID [2022-02-20 17:01:17,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {440#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:17,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {440#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {441#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {442#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:17,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {442#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {443#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} is VALID [2022-02-20 17:01:17,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {443#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {444#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {445#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} is VALID [2022-02-20 17:01:17,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {446#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:01:17,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {447#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} is VALID [2022-02-20 17:01:17,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {447#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {448#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:01:17,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {449#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {450#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {451#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {452#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {453#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {453#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {454#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 14))} is VALID [2022-02-20 17:01:17,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 14))} assume !(main_~x~0#1 % 4294967296 < 268435455); {439#false} is VALID [2022-02-20 17:01:17,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {439#false} is VALID [2022-02-20 17:01:17,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} assume 0 == __VERIFIER_assert_~cond#1; {439#false} is VALID [2022-02-20 17:01:17,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:01:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:17,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:01:17,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656039416] [2022-02-20 17:01:17,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656039416] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:01:17,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988179131] [2022-02-20 17:01:17,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:01:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:01:17,301 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) [2022-02-20 17:01:17,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:01:17,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-20 17:01:17,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:01:17,375 WARN L261 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-20 17:01:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:17,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:01:17,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {438#true} is VALID [2022-02-20 17:01:17,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {440#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:17,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {440#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {441#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {442#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:17,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {442#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {443#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} is VALID [2022-02-20 17:01:17,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {443#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {444#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {445#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} is VALID [2022-02-20 17:01:17,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {446#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:01:17,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {447#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} is VALID [2022-02-20 17:01:17,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {447#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {448#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:01:17,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {449#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {450#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {451#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {452#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {453#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:17,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {453#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {503#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:17,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {503#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 < 268435455); {439#false} is VALID [2022-02-20 17:01:17,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {439#false} is VALID [2022-02-20 17:01:17,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} assume 0 == __VERIFIER_assert_~cond#1; {439#false} is VALID [2022-02-20 17:01:17,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:01:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:17,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:01:18,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:01:18,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} assume 0 == __VERIFIER_assert_~cond#1; {439#false} is VALID [2022-02-20 17:01:18,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {439#false} is VALID [2022-02-20 17:01:18,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {525#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} assume !(main_~x~0#1 % 4294967296 < 268435455); {439#false} is VALID [2022-02-20 17:01:18,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {529#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {525#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {529#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {533#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {537#(< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {545#(< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {541#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {545#(< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#(< (mod (+ |ULTIMATE.start_f_#res#1| 6) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {549#(< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {557#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {553#(< (mod (+ |ULTIMATE.start_f_#res#1| 6) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#(< (mod (+ |ULTIMATE.start_f_#res#1| 8) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {557#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {565#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {561#(< (mod (+ |ULTIMATE.start_f_#res#1| 8) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#(< (mod (+ |ULTIMATE.start_f_#res#1| 10) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {565#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {573#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {569#(< (mod (+ |ULTIMATE.start_f_#res#1| 10) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#(< (mod (+ |ULTIMATE.start_f_#res#1| 12) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {573#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {581#(< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {577#(< (mod (+ |ULTIMATE.start_f_#res#1| 12) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {581#(< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:18,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {438#true} is VALID [2022-02-20 17:01:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:18,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988179131] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:01:18,335 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:01:18,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2022-02-20 17:01:18,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645635171] [2022-02-20 17:01:18,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:01:18,336 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 [2022-02-20 17:01:18,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:01:18,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:01:18,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:18,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-20 17:01:18,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:01:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-20 17:01:18,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 17:01:18,370 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) [2022-02-20 17:01:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:27,281 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-02-20 17:01:27,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-20 17:01:27,281 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 [2022-02-20 17:01:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:01:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2022-02-20 17:01:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:01:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2022-02-20 17:01:27,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 48 transitions. [2022-02-20 17:01:27,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:27,338 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:01:27,338 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:01:27,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=895, Invalid=2765, Unknown=0, NotChecked=0, Total=3660 [2022-02-20 17:01:27,340 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:01:27,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:01:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:01:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 17:01:27,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:01:27,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second 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) [2022-02-20 17:01:27,431 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second 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) [2022-02-20 17:01:27,432 INFO L87 Difference]: Start difference. First operand 37 states. Second 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) [2022-02-20 17:01:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:27,433 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-20 17:01:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-20 17:01:27,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:27,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:27,434 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 37 states. [2022-02-20 17:01:27,434 INFO L87 Difference]: Start difference. First 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) Second operand 37 states. [2022-02-20 17:01:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:27,435 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-20 17:01:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-20 17:01:27,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:27,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:27,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:01:27,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:01:27,436 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) [2022-02-20 17:01:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-02-20 17:01:27,438 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2022-02-20 17:01:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:01:27,438 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-02-20 17:01:27,439 INFO L471 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) [2022-02-20 17:01:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-20 17:01:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:01:27,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:01:27,440 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2022-02-20 17:01:27,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:01:27,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:27,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:01:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:01:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 685690347, now seen corresponding path program 4 times [2022-02-20 17:01:27,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:01:27,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776476351] [2022-02-20 17:01:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:01:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:28,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {857#true} is VALID [2022-02-20 17:01:28,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {859#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:28,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {860#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {860#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {861#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:28,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {862#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} is VALID [2022-02-20 17:01:28,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {863#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {864#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} is VALID [2022-02-20 17:01:28,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {865#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:01:28,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {866#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} is VALID [2022-02-20 17:01:28,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {867#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:01:28,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {868#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {868#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {869#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {869#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {870#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {871#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {871#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {872#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {872#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {873#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {874#(and (<= 16 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 16))} is VALID [2022-02-20 17:01:28,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#(and (<= 16 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 16))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {875#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {875#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {876#(and (<= 18 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 18))} is VALID [2022-02-20 17:01:28,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#(and (<= 18 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 18))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {877#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {878#(and (<= 20 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 20))} is VALID [2022-02-20 17:01:28,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(and (<= 20 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 20))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {879#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 17:01:28,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {879#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {880#(and (<= |ULTIMATE.start_f_#res#1| 22) (<= 22 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {880#(and (<= |ULTIMATE.start_f_#res#1| 22) (<= 22 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {881#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {882#(and (<= |ULTIMATE.start_f_#res#1| 24) (<= 24 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (<= |ULTIMATE.start_f_#res#1| 24) (<= 24 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {883#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 17:01:28,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {883#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {884#(and (<= |ULTIMATE.start_f_#res#1| 26) (<= 26 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {884#(and (<= |ULTIMATE.start_f_#res#1| 26) (<= 26 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {885#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {885#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {886#(and (<= 28 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 28))} is VALID [2022-02-20 17:01:28,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {886#(and (<= 28 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 28))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {887#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:28,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {887#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {888#(and (<= |ULTIMATE.start_f_#res#1| 30) (<= 30 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:28,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {888#(and (<= |ULTIMATE.start_f_#res#1| 30) (<= 30 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {889#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 30))} is VALID [2022-02-20 17:01:28,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {889#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 30))} assume !(main_~x~0#1 % 4294967296 < 268435455); {858#false} is VALID [2022-02-20 17:01:28,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {858#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {858#false} is VALID [2022-02-20 17:01:28,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {858#false} assume 0 == __VERIFIER_assert_~cond#1; {858#false} is VALID [2022-02-20 17:01:28,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {858#false} assume !false; {858#false} is VALID [2022-02-20 17:01:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:28,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:01:28,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776476351] [2022-02-20 17:01:28,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776476351] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:01:28,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763983799] [2022-02-20 17:01:28,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:01:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:01:28,532 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) [2022-02-20 17:01:28,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:01:28,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:01:28,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:01:28,588 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 123 conjunts are in the unsatisfiable core [2022-02-20 17:01:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:28,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:01:29,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {857#true} is VALID [2022-02-20 17:01:29,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {859#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:01:29,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {860#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {860#(and (<= |ULTIMATE.start_f_#res#1| 2) (<= 2 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {861#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:01:29,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {862#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} is VALID [2022-02-20 17:01:29,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#(and (<= 4 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 4))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {863#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {864#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} is VALID [2022-02-20 17:01:29,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#(and (<= 6 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 6))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {865#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:01:29,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {866#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} is VALID [2022-02-20 17:01:29,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(and (<= 8 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 8))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {867#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:01:29,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {868#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {868#(and (<= |ULTIMATE.start_f_#res#1| 10) (<= 10 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {869#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {869#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {870#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#(and (<= |ULTIMATE.start_f_#res#1| 12) (<= 12 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {871#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {871#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {872#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {872#(and (<= |ULTIMATE.start_f_#res#1| 14) (<= 14 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {873#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {874#(and (<= 16 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 16))} is VALID [2022-02-20 17:01:29,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#(and (<= 16 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 16))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {875#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {875#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {876#(and (<= 18 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 18))} is VALID [2022-02-20 17:01:29,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#(and (<= 18 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 18))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {877#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {878#(and (<= 20 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 20))} is VALID [2022-02-20 17:01:29,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(and (<= 20 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 20))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {879#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 17:01:29,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {879#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {880#(and (<= |ULTIMATE.start_f_#res#1| 22) (<= 22 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {880#(and (<= |ULTIMATE.start_f_#res#1| 22) (<= 22 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {881#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#(and (<= |ULTIMATE.start_main_~x~0#1| 22) (<= 22 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {882#(and (<= |ULTIMATE.start_f_#res#1| 24) (<= 24 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (<= |ULTIMATE.start_f_#res#1| 24) (<= 24 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {883#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-20 17:01:29,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {883#(and (<= 24 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 24))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {884#(and (<= |ULTIMATE.start_f_#res#1| 26) (<= 26 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {884#(and (<= |ULTIMATE.start_f_#res#1| 26) (<= 26 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {885#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {885#(and (<= |ULTIMATE.start_main_~x~0#1| 26) (<= 26 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {886#(and (<= 28 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 28))} is VALID [2022-02-20 17:01:29,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {886#(and (<= 28 |ULTIMATE.start_f_#res#1|) (<= |ULTIMATE.start_f_#res#1| 28))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {887#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {887#(and (<= |ULTIMATE.start_main_~x~0#1| 28) (<= 28 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {888#(and (<= |ULTIMATE.start_f_#res#1| 30) (<= 30 |ULTIMATE.start_f_#res#1|))} is VALID [2022-02-20 17:01:29,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {888#(and (<= |ULTIMATE.start_f_#res#1| 30) (<= 30 |ULTIMATE.start_f_#res#1|))} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {986#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:01:29,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {986#(and (<= |ULTIMATE.start_main_~x~0#1| 30) (<= 30 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 < 268435455); {858#false} is VALID [2022-02-20 17:01:29,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {858#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {858#false} is VALID [2022-02-20 17:01:29,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {858#false} assume 0 == __VERIFIER_assert_~cond#1; {858#false} is VALID [2022-02-20 17:01:29,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {858#false} assume !false; {858#false} is VALID [2022-02-20 17:01:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:29,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:01:30,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {858#false} assume !false; {858#false} is VALID [2022-02-20 17:01:30,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {858#false} assume 0 == __VERIFIER_assert_~cond#1; {858#false} is VALID [2022-02-20 17:01:30,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {858#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 else (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {858#false} is VALID [2022-02-20 17:01:30,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {1008#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} assume !(main_~x~0#1 % 4294967296 < 268435455); {858#false} is VALID [2022-02-20 17:01:30,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {1012#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1008#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {1016#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1012#(< (mod |ULTIMATE.start_f_#res#1| 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {1020#(< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1016#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1020#(< (mod (+ |ULTIMATE.start_f_#res#1| 2) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {1028#(< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1024#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {1032#(< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1028#(< (mod (+ |ULTIMATE.start_f_#res#1| 4) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {1036#(< (mod (+ |ULTIMATE.start_f_#res#1| 6) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1032#(< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {1040#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1036#(< (mod (+ |ULTIMATE.start_f_#res#1| 6) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {1044#(< (mod (+ |ULTIMATE.start_f_#res#1| 8) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1040#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1044#(< (mod (+ |ULTIMATE.start_f_#res#1| 8) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {1052#(< (mod (+ |ULTIMATE.start_f_#res#1| 10) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1048#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {1056#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1052#(< (mod (+ |ULTIMATE.start_f_#res#1| 10) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1060#(< (mod (+ |ULTIMATE.start_f_#res#1| 12) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1056#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {1064#(< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1060#(< (mod (+ |ULTIMATE.start_f_#res#1| 12) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {1068#(< (mod (+ |ULTIMATE.start_f_#res#1| 14) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1064#(< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#(< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1068#(< (mod (+ |ULTIMATE.start_f_#res#1| 14) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {1076#(< (mod (+ |ULTIMATE.start_f_#res#1| 16) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1072#(< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1076#(< (mod (+ |ULTIMATE.start_f_#res#1| 16) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {1084#(< (mod (+ |ULTIMATE.start_f_#res#1| 18) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1080#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {1088#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1084#(< (mod (+ |ULTIMATE.start_f_#res#1| 18) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#(< (mod (+ |ULTIMATE.start_f_#res#1| 20) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1088#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {1096#(< (mod (+ 22 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1092#(< (mod (+ |ULTIMATE.start_f_#res#1| 20) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {1100#(< (mod (+ |ULTIMATE.start_f_#res#1| 22) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1096#(< (mod (+ 22 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1100#(< (mod (+ |ULTIMATE.start_f_#res#1| 22) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1108#(< (mod (+ |ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1104#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1108#(< (mod (+ |ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#(< (mod (+ |ULTIMATE.start_f_#res#1| 26) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1112#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {1120#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1116#(< (mod (+ |ULTIMATE.start_f_#res#1| 26) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {1124#(< (mod (+ |ULTIMATE.start_f_#res#1| 28) 4294967296) 268435455)} main_#t~ret4#1 := f_#res#1;assume { :end_inline_f } true;main_~x~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1120#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#(< (mod (+ 30 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} assume !!(main_~x~0#1 % 4294967296 < 268435455);assume { :begin_inline_f } true;f_#in~z#1 := main_~x~0#1;havoc f_#res#1;havoc f_~z#1;f_~z#1 := f_#in~z#1;f_#res#1 := 2 + f_~z#1; {1124#(< (mod (+ |ULTIMATE.start_f_#res#1| 28) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1;main_~x~0#1 := 0; {1128#(< (mod (+ 30 |ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455)} is VALID [2022-02-20 17:01:30,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {857#true} is VALID [2022-02-20 17:01:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:30,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763983799] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:01:30,757 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:01:30,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2022-02-20 17:01:30,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402838926] [2022-02-20 17:01:30,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:01:30,758 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 [2022-02-20 17:01:30,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:01:30,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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) [2022-02-20 17:01:30,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:30,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-02-20 17:01:30,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:01:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-02-20 17:01:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=3520, Unknown=0, NotChecked=0, Total=4160 [2022-02-20 17:01:30,836 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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) [2022-02-20 17:01:49,253 WARN L228 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 107 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)