./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/sum05-2.i -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 eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 16:17:37,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 16:17:37,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 16:17:37,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 16:17:37,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 16:17:37,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 16:17:37,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 16:17:37,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 16:17:37,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 16:17:37,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 16:17:37,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 16:17:37,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 16:17:37,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 16:17:37,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 16:17:37,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 16:17:37,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 16:17:37,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 16:17:37,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 16:17:37,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 16:17:37,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 16:17:37,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 16:17:37,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 16:17:37,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 16:17:37,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 16:17:37,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 16:17:37,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 16:17:37,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 16:17:37,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 16:17:37,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 16:17:37,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 16:17:37,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 16:17:37,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 16:17:37,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 16:17:37,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 16:17:37,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 16:17:37,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 16:17:37,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 16:17:37,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 16:17:37,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 16:17:37,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 16:17:37,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 16:17:37,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 16:17:37,221 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 16:17:37,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 16:17:37,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 16:17:37,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 16:17:37,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 16:17:37,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 16:17:37,224 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 16:17:37,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 16:17:37,224 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 16:17:37,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 16:17:37,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 16:17:37,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 16:17:37,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 16:17:37,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 16:17:37,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 16:17:37,226 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 16:17:37,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 16:17:37,226 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 16:17:37,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 16:17:37,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 16:17:37,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 16:17:37,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 16:17:37,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 16:17:37,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 16:17:37,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 16:17:37,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 16:17:37,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 16:17:37,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 16:17:37,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 16:17:37,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 16:17:37,233 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 -> eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa [2021-08-25 16:17:37,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 16:17:37,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 16:17:37,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 16:17:37,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 16:17:37,612 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 16:17:37,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-08-25 16:17:37,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9207e218e/ad09377eaf7041deb62a0c56520101ed/FLAG097acf398 [2021-08-25 16:17:38,012 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 16:17:38,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-08-25 16:17:38,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9207e218e/ad09377eaf7041deb62a0c56520101ed/FLAG097acf398 [2021-08-25 16:17:38,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9207e218e/ad09377eaf7041deb62a0c56520101ed [2021-08-25 16:17:38,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 16:17:38,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 16:17:38,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 16:17:38,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 16:17:38,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 16:17:38,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba8284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38, skipping insertion in model container [2021-08-25 16:17:38,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 16:17:38,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 16:17:38,561 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2021-08-25 16:17:38,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 16:17:38,567 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 16:17:38,578 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2021-08-25 16:17:38,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 16:17:38,612 INFO L208 MainTranslator]: Completed translation [2021-08-25 16:17:38,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38 WrapperNode [2021-08-25 16:17:38,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 16:17:38,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 16:17:38,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 16:17:38,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 16:17:38,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 16:17:38,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 16:17:38,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 16:17:38,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 16:17:38,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 16:17:38,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 16:17:38,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 16:17:38,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 16:17:38,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (1/1) ... [2021-08-25 16:17:38,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 16:17:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:38,675 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) [2021-08-25 16:17:38,687 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 [2021-08-25 16:17:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 16:17:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 16:17:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 16:17:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 16:17:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 16:17:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 16:17:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-25 16:17:38,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 16:17:38,979 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-25 16:17:38,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:17:38 BoogieIcfgContainer [2021-08-25 16:17:38,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 16:17:38,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 16:17:38,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 16:17:38,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 16:17:38,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 04:17:38" (1/3) ... [2021-08-25 16:17:38,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cf6893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:17:38, skipping insertion in model container [2021-08-25 16:17:38,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:17:38" (2/3) ... [2021-08-25 16:17:38,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cf6893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:17:38, skipping insertion in model container [2021-08-25 16:17:38,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:17:38" (3/3) ... [2021-08-25 16:17:38,991 INFO L111 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2021-08-25 16:17:38,994 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 16:17:39,008 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 16:17:39,054 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 16:17:39,073 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-25 16:17:39,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 16:17:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.48) internal successors, (37), 26 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) [2021-08-25 16:17:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 16:17:39,104 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:39,105 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:39,106 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1858201700, now seen corresponding path program 1 times [2021-08-25 16:17:39,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:39,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903317917] [2021-08-25 16:17:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:39,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 16:17:39,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:39,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903317917] [2021-08-25 16:17:39,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903317917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 16:17:39,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 16:17:39,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 16:17:39,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760789501] [2021-08-25 16:17:39,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 16:17:39,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 16:17:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 16:17:39,244 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.48) internal successors, (37), 26 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 has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 16:17:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:39,261 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-08-25 16:17:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 16:17:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-25 16:17:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:39,267 INFO L225 Difference]: With dead ends: 52 [2021-08-25 16:17:39,268 INFO L226 Difference]: Without dead ends: 25 [2021-08-25 16:17:39,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 16:17:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-08-25 16:17:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-08-25 16:17:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 16:17:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-08-25 16:17:39,291 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2021-08-25 16:17:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:39,292 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-08-25 16:17:39,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 16:17:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-08-25 16:17:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 16:17:39,293 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:39,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:39,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 16:17:39,294 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 290125730, now seen corresponding path program 1 times [2021-08-25 16:17:39,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:39,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154900658] [2021-08-25 16:17:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:39,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 16:17:39,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:39,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154900658] [2021-08-25 16:17:39,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154900658] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:39,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410780890] [2021-08-25 16:17:39,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:39,367 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:39,409 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) [2021-08-25 16:17:39,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 16:17:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:39,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 16:17:39,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 16:17:39,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410780890] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 16:17:39,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 16:17:39,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 16:17:39,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80258590] [2021-08-25 16:17:39,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 16:17:39,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:39,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 16:17:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 16:17:39,602 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-08-25 16:17:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:39,632 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-08-25 16:17:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 16:17:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-08-25 16:17:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:39,634 INFO L225 Difference]: With dead ends: 46 [2021-08-25 16:17:39,634 INFO L226 Difference]: Without dead ends: 30 [2021-08-25 16:17:39,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 16:17:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-25 16:17:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-08-25 16:17:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-08-25 16:17:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-08-25 16:17:39,643 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2021-08-25 16:17:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:39,644 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-25 16:17:39,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-08-25 16:17:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-08-25 16:17:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-25 16:17:39,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:39,646 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:39,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-25 16:17:39,865 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 [2021-08-25 16:17:39,865 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1760334112, now seen corresponding path program 1 times [2021-08-25 16:17:39,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:39,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137065461] [2021-08-25 16:17:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:39,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 16:17:39,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:39,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137065461] [2021-08-25 16:17:39,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137065461] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:39,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352114276] [2021-08-25 16:17:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:39,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:39,917 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) [2021-08-25 16:17:39,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 16:17:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:40,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 16:17:40,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-25 16:17:40,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352114276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 16:17:40,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 16:17:40,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 16:17:40,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764763865] [2021-08-25 16:17:40,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 16:17:40,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:40,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 16:17:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 16:17:40,077 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2021-08-25 16:17:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:40,085 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-08-25 16:17:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 16:17:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-08-25 16:17:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:40,086 INFO L225 Difference]: With dead ends: 38 [2021-08-25 16:17:40,086 INFO L226 Difference]: Without dead ends: 29 [2021-08-25 16:17:40,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 16:17:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-08-25 16:17:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-25 16:17:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2021-08-25 16:17:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-08-25 16:17:40,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2021-08-25 16:17:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:40,090 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-25 16:17:40,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2021-08-25 16:17:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-08-25 16:17:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 16:17:40,091 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:40,091 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:40,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:40,334 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 [2021-08-25 16:17:40,334 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1208457118, now seen corresponding path program 1 times [2021-08-25 16:17:40,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:40,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332107842] [2021-08-25 16:17:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:40,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-25 16:17:40,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:40,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332107842] [2021-08-25 16:17:40,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332107842] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:40,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082249088] [2021-08-25 16:17:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:40,362 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:40,366 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) [2021-08-25 16:17:40,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 16:17:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:40,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 16:17:40,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-25 16:17:40,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082249088] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:40,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:40,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-25 16:17:40,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151669947] [2021-08-25 16:17:40,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 16:17:40,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 16:17:40,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 16:17:40,522 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2021-08-25 16:17:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:40,535 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2021-08-25 16:17:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 16:17:40,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 27 [2021-08-25 16:17:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:40,537 INFO L225 Difference]: With dead ends: 54 [2021-08-25 16:17:40,537 INFO L226 Difference]: Without dead ends: 31 [2021-08-25 16:17:40,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 16:17:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-08-25 16:17:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-08-25 16:17:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2021-08-25 16:17:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-08-25 16:17:40,540 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2021-08-25 16:17:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:40,540 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-08-25 16:17:40,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2021-08-25 16:17:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-08-25 16:17:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 16:17:40,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:40,541 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:40,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:40,759 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 [2021-08-25 16:17:40,759 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1993526948, now seen corresponding path program 2 times [2021-08-25 16:17:40,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:40,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48916810] [2021-08-25 16:17:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:40,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 16:17:40,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:40,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48916810] [2021-08-25 16:17:40,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48916810] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:40,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953937744] [2021-08-25 16:17:40,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 16:17:40,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:40,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:40,809 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) [2021-08-25 16:17:40,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 16:17:40,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 16:17:40,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:17:40,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 16:17:40,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 16:17:41,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953937744] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:41,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:41,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 16:17:41,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947945698] [2021-08-25 16:17:41,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 16:17:41,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 16:17:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 16:17:41,029 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2021-08-25 16:17:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:41,075 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2021-08-25 16:17:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 16:17:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 29 [2021-08-25 16:17:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:41,076 INFO L225 Difference]: With dead ends: 61 [2021-08-25 16:17:41,076 INFO L226 Difference]: Without dead ends: 42 [2021-08-25 16:17:41,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 16:17:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-25 16:17:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2021-08-25 16:17:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) [2021-08-25 16:17:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-08-25 16:17:41,080 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2021-08-25 16:17:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:41,080 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-08-25 16:17:41,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2021-08-25 16:17:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-08-25 16:17:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-25 16:17:41,081 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:41,082 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:41,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:41,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:41,302 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1059243608, now seen corresponding path program 3 times [2021-08-25 16:17:41,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:41,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535271993] [2021-08-25 16:17:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:41,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 16:17:41,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:41,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535271993] [2021-08-25 16:17:41,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535271993] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:41,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266692223] [2021-08-25 16:17:41,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 16:17:41,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:41,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:17:41,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 16:17:41,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-25 16:17:41,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:17:41,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 16:17:41,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 16:17:41,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266692223] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:41,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:41,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-25 16:17:41,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512773443] [2021-08-25 16:17:41,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 16:17:41,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 16:17:41,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-25 16:17:41,533 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2021-08-25 16:17:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:41,583 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-08-25 16:17:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 16:17:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 37 [2021-08-25 16:17:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:41,584 INFO L225 Difference]: With dead ends: 81 [2021-08-25 16:17:41,584 INFO L226 Difference]: Without dead ends: 50 [2021-08-25 16:17:41,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-25 16:17:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-25 16:17:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2021-08-25 16:17:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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) [2021-08-25 16:17:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-08-25 16:17:41,587 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 37 [2021-08-25 16:17:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:41,588 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-08-25 16:17:41,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2021-08-25 16:17:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-08-25 16:17:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 16:17:41,588 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:41,589 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:41,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:41,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:41,804 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1892525292, now seen corresponding path program 4 times [2021-08-25 16:17:41,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:41,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58330903] [2021-08-25 16:17:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:41,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-25 16:17:41,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:41,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58330903] [2021-08-25 16:17:41,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58330903] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:41,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906674515] [2021-08-25 16:17:41,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 16:17:41,855 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:41,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:17:41,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 16:17:41,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 16:17:41,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:17:41,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 16:17:41,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-25 16:17:42,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906674515] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:42,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:42,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 16:17:42,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715217989] [2021-08-25 16:17:42,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 16:17:42,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 16:17:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-25 16:17:42,072 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2021-08-25 16:17:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:42,130 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2021-08-25 16:17:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 16:17:42,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 45 [2021-08-25 16:17:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:42,131 INFO L225 Difference]: With dead ends: 95 [2021-08-25 16:17:42,131 INFO L226 Difference]: Without dead ends: 58 [2021-08-25 16:17:42,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-25 16:17:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-25 16:17:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2021-08-25 16:17:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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) [2021-08-25 16:17:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-08-25 16:17:42,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 45 [2021-08-25 16:17:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:42,135 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-08-25 16:17:42,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2021-08-25 16:17:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-08-25 16:17:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-25 16:17:42,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:42,136 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:42,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-25 16:17:42,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:42,353 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1726969040, now seen corresponding path program 5 times [2021-08-25 16:17:42,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:42,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890999172] [2021-08-25 16:17:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:42,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-25 16:17:42,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:42,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890999172] [2021-08-25 16:17:42,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890999172] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:42,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394160844] [2021-08-25 16:17:42,403 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 16:17:42,403 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:42,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:42,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:17:42,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-25 16:17:42,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-08-25 16:17:42,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:17:42,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-25 16:17:42,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-25 16:17:42,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394160844] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:42,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:42,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-08-25 16:17:42,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436513747] [2021-08-25 16:17:42,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-25 16:17:42,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-25 16:17:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-25 16:17:42,674 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2021-08-25 16:17:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:42,749 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-08-25 16:17:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-25 16:17:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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 53 [2021-08-25 16:17:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:42,750 INFO L225 Difference]: With dead ends: 105 [2021-08-25 16:17:42,750 INFO L226 Difference]: Without dead ends: 62 [2021-08-25 16:17:42,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-25 16:17:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-08-25 16:17:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-08-25 16:17:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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) [2021-08-25 16:17:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-08-25 16:17:42,754 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 53 [2021-08-25 16:17:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:42,754 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-08-25 16:17:42,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2021-08-25 16:17:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-08-25 16:17:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 16:17:42,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:42,755 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:42,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:42,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:42,972 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1850748020, now seen corresponding path program 6 times [2021-08-25 16:17:42,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:42,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543620143] [2021-08-25 16:17:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:42,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-25 16:17:43,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:43,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543620143] [2021-08-25 16:17:43,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543620143] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:43,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093837969] [2021-08-25 16:17:43,018 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-25 16:17:43,018 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:43,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:17:43,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-25 16:17:43,261 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-08-25 16:17:43,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:17:43,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 16:17:43,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-25 16:17:43,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093837969] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:43,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:43,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-25 16:17:43,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441524193] [2021-08-25 16:17:43,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 16:17:43,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 16:17:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-25 16:17:43,397 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-08-25 16:17:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:43,409 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-08-25 16:17:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 16:17:43,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 61 [2021-08-25 16:17:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:43,410 INFO L225 Difference]: With dead ends: 82 [2021-08-25 16:17:43,411 INFO L226 Difference]: Without dead ends: 65 [2021-08-25 16:17:43,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-25 16:17:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-25 16:17:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-08-25 16:17:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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) [2021-08-25 16:17:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-08-25 16:17:43,414 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 61 [2021-08-25 16:17:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:43,414 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-08-25 16:17:43,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-08-25 16:17:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-08-25 16:17:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-25 16:17:43,415 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:43,415 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:43,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:43,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-08-25 16:17:43,632 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:43,633 INFO L82 PathProgramCache]: Analyzing trace with hash -164647158, now seen corresponding path program 7 times [2021-08-25 16:17:43,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:43,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042605607] [2021-08-25 16:17:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:43,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-25 16:17:43,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:43,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042605607] [2021-08-25 16:17:43,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042605607] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:43,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272292710] [2021-08-25 16:17:43,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-25 16:17:43,699 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:43,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:43,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:17:43,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-25 16:17:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:43,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 16:17:43,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-25 16:17:43,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272292710] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:43,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:17:43,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-25 16:17:43,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5517172] [2021-08-25 16:17:43,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 16:17:43,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:17:43,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 16:17:43,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-25 16:17:43,984 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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) [2021-08-25 16:17:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:17:44,002 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2021-08-25 16:17:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 16:17:44,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 63 [2021-08-25 16:17:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:17:44,003 INFO L225 Difference]: With dead ends: 83 [2021-08-25 16:17:44,004 INFO L226 Difference]: Without dead ends: 66 [2021-08-25 16:17:44,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-25 16:17:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-25 16:17:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-08-25 16:17:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 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) [2021-08-25 16:17:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-08-25 16:17:44,007 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 63 [2021-08-25 16:17:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:17:44,008 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-08-25 16:17:44,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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) [2021-08-25 16:17:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-08-25 16:17:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-25 16:17:44,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:17:44,009 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:17:44,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-25 16:17:44,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-25 16:17:44,226 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:17:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:17:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash 975610632, now seen corresponding path program 8 times [2021-08-25 16:17:44,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:17:44,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154118128] [2021-08-25 16:17:44,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:17:44,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:17:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:17:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 16:17:51,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:17:51,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154118128] [2021-08-25 16:17:51,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154118128] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:17:51,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105778812] [2021-08-25 16:17:51,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 16:17:51,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:17:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:17:51,463 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:17:51,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-25 16:17:52,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 16:17:52,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:17:52,703 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 151 conjunts are in the unsatisfiable core [2021-08-25 16:17:52,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:17:52,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-08-25 16:17:52,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:52,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2021-08-25 16:17:53,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,199 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 16:17:53,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2021-08-25 16:17:53,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,460 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 16:17:53,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 69 [2021-08-25 16:17:53,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:53,775 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 16:17:53,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 84 [2021-08-25 16:17:56,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:56,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 129 [2021-08-25 16:17:59,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 16:17:59,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 16:17:59,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:17:59,865 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-08-25 16:17:59,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 364 treesize of output 178 [2021-08-25 16:18:00,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 16:18:00,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 16:18:00,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:00,554 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-08-25 16:18:00,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 332 treesize of output 173 [2021-08-25 16:18:01,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 16:18:01,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 16:18:01,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,129 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-08-25 16:18:01,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 316 treesize of output 170 [2021-08-25 16:18:01,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 16:18:01,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 16:18:01,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 311 treesize of output 147 [2021-08-25 16:18:02,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 16:18:02,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 259 treesize of output 147 [2021-08-25 16:18:04,565 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 16:18:04,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 297 treesize of output 117 [2021-08-25 16:18:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 16:18:05,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105778812] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:18:05,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 16:18:05,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 54] total 102 [2021-08-25 16:18:05,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808716503] [2021-08-25 16:18:05,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2021-08-25 16:18:05,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:18:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2021-08-25 16:18:05,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=9915, Unknown=0, NotChecked=0, Total=10302 [2021-08-25 16:18:05,227 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 102 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 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) [2021-08-25 16:18:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:18:19,004 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2021-08-25 16:18:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-08-25 16:18:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 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 65 [2021-08-25 16:18:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:18:19,006 INFO L225 Difference]: With dead ends: 146 [2021-08-25 16:18:19,006 INFO L226 Difference]: Without dead ends: 124 [2021-08-25 16:18:19,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 20145.7ms TimeCoverageRelationStatistics Valid=728, Invalid=15528, Unknown=0, NotChecked=0, Total=16256 [2021-08-25 16:18:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-25 16:18:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2021-08-25 16:18:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.074468085106383) internal successors, (101), 94 states have internal predecessors, (101), 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) [2021-08-25 16:18:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-08-25 16:18:19,040 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 65 [2021-08-25 16:18:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:18:19,040 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-08-25 16:18:19,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 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) [2021-08-25 16:18:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-08-25 16:18:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 16:18:19,045 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 16:18:19,045 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 16:18:19,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-25 16:18:19,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-25 16:18:19,250 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 16:18:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 16:18:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1384915130, now seen corresponding path program 9 times [2021-08-25 16:18:19,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 16:18:19,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888715892] [2021-08-25 16:18:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 16:18:19,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 16:18:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 16:18:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-25 16:18:19,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 16:18:19,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888715892] [2021-08-25 16:18:19,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888715892] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 16:18:19,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488637865] [2021-08-25 16:18:19,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 16:18:19,354 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 16:18:19,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 16:18:19,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 16:18:19,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-25 16:18:20,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-08-25 16:18:20,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 16:18:20,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-25 16:18:20,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 16:18:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-25 16:18:20,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488637865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 16:18:20,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 16:18:20,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2021-08-25 16:18:20,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853092828] [2021-08-25 16:18:20,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 16:18:20,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 16:18:20,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 16:18:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-08-25 16:18:20,207 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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) [2021-08-25 16:18:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 16:18:20,271 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-08-25 16:18:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 16:18:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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) Word has length 67 [2021-08-25 16:18:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 16:18:20,272 INFO L225 Difference]: With dead ends: 104 [2021-08-25 16:18:20,272 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 16:18:20,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 22.8ms TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-08-25 16:18:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 16:18:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 16:18:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 16:18:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 16:18:20,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2021-08-25 16:18:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 16:18:20,273 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 16:18:20,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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) [2021-08-25 16:18:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 16:18:20,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 16:18:20,275 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 16:18:20,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-25 16:18:20,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-25 16:18:20,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 16:18:20,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:20,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 16:18:26,753 INFO L853 garLoopResultBuilder]: At program point L23(lines 15 24) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse2 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse3 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse6 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse4 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse5 (select .cse7 |ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse1 (+ .cse2 .cse3 .cse6 .cse4 .cse5))) (and (= |ULTIMATE.start_main_~#x~0.offset| 0) (let ((.cse0 (mod .cse1 4294967296))) (or (and (= .cse0 |ULTIMATE.start_sum_#res|) (<= .cse0 2147483647)) (and (< 2147483647 .cse0) (= .cse0 (+ |ULTIMATE.start_sum_#res| 4294967296))))) (<= 0 (+ .cse2 2147483648)) (<= 0 (+ .cse3 2147483648)) (<= .cse4 2147483647) (<= .cse5 2147483647) (<= .cse6 2147483647) (<= 5 ULTIMATE.start_sum_~i~0) (= ULTIMATE.start_sum_~ret~0 .cse1) (<= 0 (+ .cse6 2147483648)) (<= .cse3 2147483647) (<= 0 (+ .cse4 2147483648)) (<= 0 (+ 2147483648 .cse5)) (<= .cse2 2147483647))))) [2021-08-25 16:18:26,753 INFO L853 garLoopResultBuilder]: At program point L23-1(lines 15 24) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse1 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse2 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse5 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse3 (select .cse7 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse4 (select .cse7 |ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse6 (+ .cse1 .cse2 .cse5 .cse3 .cse4))) (let ((.cse0 (mod .cse6 4294967296))) (and (= |ULTIMATE.start_main_~#x~0.offset| 0) (or (and (= .cse0 |ULTIMATE.start_sum_#res|) (<= .cse0 2147483647)) (and (< 2147483647 .cse0) (= .cse0 (+ |ULTIMATE.start_sum_#res| 4294967296)))) (<= 0 (+ .cse1 2147483648)) (<= 0 (+ .cse2 2147483648)) (or (= (+ ULTIMATE.start_main_~ret~1 4294967296) .cse0) (= .cse0 ULTIMATE.start_main_~ret~1)) (<= .cse3 2147483647) (<= .cse4 2147483647) (<= .cse5 2147483647) (<= 5 ULTIMATE.start_sum_~i~0) (= ULTIMATE.start_sum_~ret~0 .cse6) (<= 0 (+ .cse5 2147483648)) (<= .cse2 2147483647) (<= ULTIMATE.start_main_~ret~1 2147483647) (<= 0 (+ .cse3 2147483648)) (<= 0 (+ ULTIMATE.start_main_~ret~1 2147483648)) (<= 0 (+ 2147483648 .cse4)) (<= .cse1 2147483647)))))) [2021-08-25 16:18:26,753 INFO L853 garLoopResultBuilder]: At program point L23-2(lines 15 24) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_main_~#x~0.offset| 16)) (.cse12 (+ |ULTIMATE.start_main_~#x~0.offset| 8)) (.cse11 (+ |ULTIMATE.start_main_~#x~0.offset| 12)) (.cse13 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse10 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (let ((.cse6 (select .cse13 .cse10)) (.cse3 (select .cse13 .cse11)) (.cse4 (select .cse13 .cse12)) (.cse5 (select .cse13 |ULTIMATE.start_main_~#x~0.offset|)) (.cse2 (select .cse13 .cse14)) (.cse1 (+ ULTIMATE.start_main_~ret2~0 4294967296))) (and (= |ULTIMATE.start_main_~#x~0.offset| 0) (let ((.cse0 (mod ULTIMATE.start_sum_~ret~0 4294967296))) (or (= .cse0 ULTIMATE.start_main_~ret2~0) (= .cse1 .cse0))) (<= 0 (+ .cse2 2147483648)) (<= 0 (+ .cse3 2147483648)) (<= .cse4 2147483647) (<= .cse5 2147483647) (<= .cse6 2147483647) (= ULTIMATE.start_sum_~ret~0 (+ .cse2 .cse3 .cse6 .cse4 .cse5)) (= 16 (* 4 ULTIMATE.start_main_~i~2)) (<= 0 (+ .cse6 2147483648)) (<= .cse3 2147483647) (let ((.cse8 (let ((.cse9 (store .cse13 .cse14 ULTIMATE.start_main_~temp~0))) (+ (select .cse9 0) (select .cse9 .cse10) ULTIMATE.start_main_~temp~0 (select .cse9 .cse11) (select .cse9 .cse12))))) (let ((.cse7 (* 4294967296 (div .cse8 4294967296)))) (or (= (+ .cse7 ULTIMATE.start_main_~ret~1) .cse8) (= (+ .cse7 ULTIMATE.start_main_~ret~1 4294967296) .cse8)))) (<= ULTIMATE.start_main_~ret~1 2147483647) (<= 0 (+ .cse4 2147483648)) (<= 0 (+ ULTIMATE.start_main_~ret~1 2147483648)) (<= 0 (+ 2147483648 .cse5)) (<= .cse2 2147483647) (let ((.cse15 (mod ULTIMATE.start_main_~ret~1 4294967296))) (or (and (<= 0 ULTIMATE.start_main_~ret~1) (= .cse15 ULTIMATE.start_main_~ret2~0) (= .cse15 |ULTIMATE.start_sum_#res|)) (and (= .cse1 .cse15) (= .cse15 (+ |ULTIMATE.start_sum_#res| 4294967296)) (< ULTIMATE.start_main_~ret~1 0))))))) [2021-08-25 16:18:26,753 INFO L860 garLoopResultBuilder]: At program point L52(lines 26 53) the Hoare annotation is: true [2021-08-25 16:18:26,754 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 16:18:26,754 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 16:18:26,754 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 16:18:26,754 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2021-08-25 16:18:26,754 INFO L857 garLoopResultBuilder]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2021-08-25 16:18:26,754 INFO L853 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse19 (select .cse23 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse21 (select .cse23 |ULTIMATE.start_main_~#x~0.offset|)) (.cse20 (select .cse23 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse18 (select .cse23 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse17 (select .cse23 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse22 (select |#memory_int| ULTIMATE.start_sum_~x.base))) (let ((.cse9 (select .cse22 (+ ULTIMATE.start_sum_~x.offset 8))) (.cse16 (select .cse22 (+ ULTIMATE.start_sum_~x.offset (- 4) (* ULTIMATE.start_sum_~i~0 4)))) (.cse0 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#x~0.base| ULTIMATE.start_sum_~x.base)) (.cse2 (<= 0 (+ .cse17 2147483648))) (.cse3 (<= 0 (+ .cse18 2147483648))) (.cse4 (<= .cse20 2147483647)) (.cse10 (select .cse22 ULTIMATE.start_sum_~x.offset)) (.cse11 (select .cse22 (+ ULTIMATE.start_sum_~x.offset 4))) (.cse5 (<= .cse21 2147483647)) (.cse6 (<= .cse19 2147483647)) (.cse7 (= ULTIMATE.start_sum_~x.offset |ULTIMATE.start_main_~#x~0.offset|)) (.cse8 (<= 0 (+ .cse19 2147483648))) (.cse12 (<= .cse18 2147483647)) (.cse13 (<= 0 (+ .cse20 2147483648))) (.cse14 (<= 0 (+ 2147483648 .cse21))) (.cse15 (<= .cse17 2147483647))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_sum_~ret~0 (+ .cse9 .cse10 .cse11)) .cse12 (= 3 ULTIMATE.start_sum_~i~0) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_sum_~ret~0 .cse16) .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_sum_~i~0 1)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 5 ULTIMATE.start_sum_~i~0) (= ULTIMATE.start_sum_~ret~0 (+ .cse17 .cse18 .cse19 .cse20 .cse21)) .cse8 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= (+ .cse9 .cse10 .cse11 .cse16) ULTIMATE.start_sum_~ret~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 (<= 4 ULTIMATE.start_sum_~i~0) .cse13 .cse14 .cse15 (<= ULTIMATE.start_sum_~i~0 4)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_sum_~ret~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_sum_~i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ .cse10 .cse11) ULTIMATE.start_sum_~ret~0) .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_sum_~i~0) .cse12 .cse13 .cse14 .cse15))))) [2021-08-25 16:18:26,754 INFO L857 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-08-25 16:18:26,755 INFO L857 garLoopResultBuilder]: For program point L20-4(lines 20 22) no Hoare annotation was computed. [2021-08-25 16:18:26,755 INFO L857 garLoopResultBuilder]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2021-08-25 16:18:26,755 INFO L857 garLoopResultBuilder]: For program point L20-7(lines 20 22) no Hoare annotation was computed. [2021-08-25 16:18:26,755 INFO L853 garLoopResultBuilder]: At program point L20-8(lines 20 22) the Hoare annotation is: (let ((.cse29 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse23 (select .cse29 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (.cse26 (select .cse29 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse27 (select .cse29 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse25 (select .cse29 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse24 (select .cse29 |ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse22 (+ .cse23 .cse26 .cse27 .cse25 .cse24)) (.cse21 (* ULTIMATE.start_sum_~i~0 4)) (.cse20 (select |#memory_int| ULTIMATE.start_sum_~x.base))) (let ((.cse10 (select .cse20 (+ ULTIMATE.start_sum_~x.offset 8))) (.cse11 (select .cse20 ULTIMATE.start_sum_~x.offset)) (.cse12 (select .cse20 (+ ULTIMATE.start_sum_~x.offset 4))) (.cse1 (= |ULTIMATE.start_main_~#x~0.base| ULTIMATE.start_sum_~x.base)) (.cse8 (= ULTIMATE.start_sum_~x.offset |ULTIMATE.start_main_~#x~0.offset|)) (.cse19 (select .cse20 (+ ULTIMATE.start_sum_~x.offset (- 4) .cse21))) (.cse0 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse2 (<= 0 (+ .cse23 2147483648))) (.cse3 (<= 0 (+ .cse26 2147483648))) (.cse4 (let ((.cse28 (mod .cse22 4294967296))) (or (= (+ ULTIMATE.start_main_~ret~1 4294967296) .cse28) (= .cse28 ULTIMATE.start_main_~ret~1)))) (.cse5 (<= .cse25 2147483647)) (.cse6 (<= .cse24 2147483647)) (.cse7 (<= .cse27 2147483647)) (.cse9 (<= 0 (+ .cse27 2147483648))) (.cse13 (<= .cse26 2147483647)) (.cse14 (<= ULTIMATE.start_main_~ret~1 2147483647)) (.cse15 (<= 0 (+ .cse25 2147483648))) (.cse16 (<= 0 (+ ULTIMATE.start_main_~ret~1 2147483648))) (.cse17 (<= 0 (+ 2147483648 .cse24))) (.cse18 (<= .cse23 2147483647))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_sum_~ret~0 (+ .cse10 .cse11 .cse12)) .cse13 (= 3 ULTIMATE.start_sum_~i~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (= (+ .cse10 .cse11 .cse12 .cse19) ULTIMATE.start_sum_~ret~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 (<= 4 ULTIMATE.start_sum_~i~0) .cse14 .cse15 .cse16 .cse17 .cse18 (<= ULTIMATE.start_sum_~i~0 4)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_sum_~ret~0 .cse19) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_sum_~i~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_sum_~ret~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_sum_~i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_sum_~i~0) .cse13 (= ULTIMATE.start_sum_~ret~0 (+ (select .cse20 (+ ULTIMATE.start_sum_~x.offset .cse21 (- 8))) .cse19)) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 5 ULTIMATE.start_sum_~i~0) (= ULTIMATE.start_sum_~ret~0 .cse22) .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))))) [2021-08-25 16:18:26,755 INFO L857 garLoopResultBuilder]: For program point L20-9(lines 20 22) no Hoare annotation was computed. [2021-08-25 16:18:26,755 INFO L857 garLoopResultBuilder]: For program point L20-12(lines 20 22) no Hoare annotation was computed. [2021-08-25 16:18:26,755 INFO L853 garLoopResultBuilder]: At program point L20-13(lines 20 22) the Hoare annotation is: (let ((.cse40 (+ |ULTIMATE.start_main_~#x~0.offset| 4)) (.cse41 (+ |ULTIMATE.start_main_~#x~0.offset| 12)) (.cse39 (+ |ULTIMATE.start_main_~#x~0.offset| 8)) (.cse38 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse42 (+ |ULTIMATE.start_main_~#x~0.offset| 16))) (let ((.cse37 (let ((.cse43 (store .cse38 .cse42 ULTIMATE.start_main_~temp~0))) (+ (select .cse43 0) (select .cse43 .cse40) ULTIMATE.start_main_~temp~0 (select .cse43 .cse41) (select .cse43 .cse39))))) (let ((.cse36 (* 4294967296 (div .cse37 4294967296))) (.cse12 (select |#memory_int| ULTIMATE.start_sum_~x.base)) (.cse24 (select .cse38 .cse42)) (.cse29 (select .cse38 .cse41)) (.cse32 (select .cse38 .cse40)) (.cse25 (select .cse38 .cse39)) (.cse27 (select .cse38 |ULTIMATE.start_main_~#x~0.offset|))) (let ((.cse28 (+ .cse24 .cse29 .cse32 .cse25 .cse27)) (.cse34 (select .cse12 0)) (.cse30 (= (+ .cse36 ULTIMATE.start_main_~ret~1) .cse37)) (.cse31 (= (+ .cse36 ULTIMATE.start_main_~ret~1 4294967296) .cse37)) (.cse23 (* ULTIMATE.start_sum_~i~0 4))) (let ((.cse22 (select .cse12 (+ ULTIMATE.start_sum_~x.offset (- 4) .cse23))) (.cse0 (= |ULTIMATE.start_main_~#x~0.base| ULTIMATE.start_sum_~x.base)) (.cse3 (let ((.cse35 (= ULTIMATE.start_main_~ret2~0 ULTIMATE.start_main_~ret~1))) (or (and .cse30 .cse35) (and .cse31 .cse35)))) (.cse5 (<= .cse34 2147483647)) (.cse6 (= ULTIMATE.start_sum_~x.offset |ULTIMATE.start_main_~#x~0.offset|)) (.cse7 (<= 0 (+ (select .cse12 16) 2147483648))) (.cse8 (= ULTIMATE.start_sum_~x.offset 0)) (.cse11 (select .cse12 (+ ULTIMATE.start_sum_~x.offset 8))) (.cse13 (select .cse12 ULTIMATE.start_sum_~x.offset)) (.cse14 (select .cse12 (+ ULTIMATE.start_sum_~x.offset 4))) (.cse15 (<= (select .cse12 8) 2147483647)) (.cse20 (<= 0 (+ 2147483648 .cse34))) (.cse21 (<= (select .cse12 12) 2147483647)) (.cse1 (<= 0 (+ .cse29 2147483648))) (.cse2 (let ((.cse33 (mod .cse28 4294967296))) (or (= (+ ULTIMATE.start_main_~ret~1 4294967296) .cse33) (= .cse33 ULTIMATE.start_main_~ret~1)))) (.cse4 (<= .cse32 2147483647)) (.cse9 (= 16 (* 4 ULTIMATE.start_main_~i~2))) (.cse10 (<= 0 (+ .cse32 2147483648))) (.cse16 (<= ULTIMATE.start_main_~ret~1 2147483647)) (.cse17 (<= 0 (+ .cse25 2147483648))) (.cse18 (<= 0 (+ ULTIMATE.start_main_~ret~1 2147483648))) (.cse19 (<= .cse24 2147483647))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_sum_~ret~0 (+ .cse11 (select .cse12 (+ ULTIMATE.start_sum_~x.offset 12)) .cse13 .cse14)) .cse15 (<= 4 ULTIMATE.start_sum_~i~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= ULTIMATE.start_sum_~i~0 4)) (and .cse0 .cse1 (= ULTIMATE.start_sum_~ret~0 .cse22) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_sum_~i~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_sum_~i~0) (= ULTIMATE.start_sum_~ret~0 (+ (select .cse12 (+ ULTIMATE.start_sum_~x.offset .cse23 (- 8))) .cse22)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_sum_~ret~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_sum_~i~0 0) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_sum_~ret~0 (+ .cse11 .cse13 .cse14)) (= 3 ULTIMATE.start_sum_~i~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (= |ULTIMATE.start_main_~#x~0.offset| 0) (<= 0 (+ .cse24 2147483648)) .cse1 .cse2 (<= .cse25 2147483647) (let ((.cse26 (mod ULTIMATE.start_sum_~ret~0 4294967296))) (or (and (< 2147483647 .cse26) (= (+ ULTIMATE.start_main_~ret2~0 4294967296) .cse26)) (and (= .cse26 ULTIMATE.start_main_~ret2~0) (<= .cse26 2147483647)))) (<= .cse27 2147483647) .cse4 (<= 5 ULTIMATE.start_sum_~i~0) (= ULTIMATE.start_sum_~ret~0 .cse28) .cse9 .cse10 (<= .cse29 2147483647) (or .cse30 .cse31) .cse16 .cse17 .cse18 (<= 0 (+ 2147483648 .cse27)) .cse19))))))) [2021-08-25 16:18:26,756 INFO L857 garLoopResultBuilder]: For program point L20-14(lines 20 22) no Hoare annotation was computed. [2021-08-25 16:18:26,756 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 16:18:26,756 INFO L857 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2021-08-25 16:18:26,756 INFO L857 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2021-08-25 16:18:26,756 INFO L853 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|))) (let ((.cse14 (select .cse6 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse12 (select .cse6 |ULTIMATE.start_main_~#x~0.offset|)) (.cse13 (select .cse6 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse15 (select .cse6 (+ |ULTIMATE.start_main_~#x~0.offset| 12)))) (let ((.cse7 (<= 0 (+ .cse15 2147483648))) (.cse9 (<= .cse15 2147483647)) (.cse0 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse8 (<= .cse13 2147483647)) (.cse1 (<= .cse12 2147483647)) (.cse2 (<= .cse14 2147483647)) (.cse3 (<= 0 (+ .cse14 2147483648))) (.cse10 (<= 0 (+ .cse13 2147483648))) (.cse4 (<= 0 (+ 2147483648 .cse12)))) (or (and .cse0 (= ULTIMATE.start_main_~i~1 2) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (select .cse6 (+ |ULTIMATE.start_main_~#x~0.offset| (- 4) (* ULTIMATE.start_main_~i~1 4))))) (and .cse0 (<= 0 (+ .cse5 2147483648)) (<= .cse5 2147483647) (= ULTIMATE.start_main_~i~1 1))) (and .cse0 (= ULTIMATE.start_main_~i~1 4) .cse7 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4) (and .cse0 (= ULTIMATE.start_main_~i~1 0)) (let ((.cse11 (select .cse6 (+ |ULTIMATE.start_main_~#x~0.offset| 16)))) (and .cse0 (<= 0 (+ .cse11 2147483648)) .cse7 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 (<= .cse11 2147483647))) (and .cse0 .cse8 (= ULTIMATE.start_main_~i~1 3) .cse1 .cse2 .cse3 .cse10 .cse4))))) [2021-08-25 16:18:26,756 INFO L857 garLoopResultBuilder]: For program point L34-4(lines 34 36) no Hoare annotation was computed. [2021-08-25 16:18:26,756 INFO L857 garLoopResultBuilder]: For program point L43-2(lines 43 45) no Hoare annotation was computed. [2021-08-25 16:18:26,757 INFO L853 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse32 (select |#memory_int| |ULTIMATE.start_main_~#x~0.base|)) (.cse23 (+ ULTIMATE.start_main_~ret2~0 4294967296)) (.cse36 (mod ULTIMATE.start_main_~ret~1 4294967296))) (let ((.cse18 (= .cse36 ULTIMATE.start_main_~ret2~0)) (.cse19 (= .cse36 |ULTIMATE.start_sum_#res|)) (.cse16 (= .cse23 .cse36)) (.cse17 (= .cse36 (+ |ULTIMATE.start_sum_#res| 4294967296))) (.cse25 (select .cse32 (+ |ULTIMATE.start_main_~#x~0.offset| 4))) (.cse27 (select .cse32 |ULTIMATE.start_main_~#x~0.offset|)) (.cse26 (select .cse32 (+ |ULTIMATE.start_main_~#x~0.offset| 8))) (.cse1 (select .cse32 (+ |ULTIMATE.start_main_~#x~0.offset| 12))) (.cse0 (select .cse32 (+ |ULTIMATE.start_main_~#x~0.offset| 16)))) (let ((.cse4 (<= 0 (+ ULTIMATE.start_sum_~ret~0 10737418240))) (.cse10 (<= ULTIMATE.start_main_~temp~0 2147483647)) (.cse12 (<= ULTIMATE.start_sum_~ret~0 10737418235)) (.cse14 (<= 0 (+ ULTIMATE.start_main_~temp~0 2147483648))) (.cse2 (= |ULTIMATE.start_main_~#x~0.offset| 0)) (.cse3 (let ((.cse35 (mod ULTIMATE.start_sum_~ret~0 4294967296))) (or (= .cse35 ULTIMATE.start_main_~ret2~0) (= .cse23 .cse35)))) (.cse28 (<= 0 (+ .cse0 2147483648))) (.cse5 (<= 0 (+ .cse1 2147483648))) (.cse6 (<= .cse26 2147483647)) (.cse7 (<= .cse27 2147483647)) (.cse8 (<= .cse25 2147483647)) (.cse9 (<= 5 ULTIMATE.start_sum_~i~0)) (.cse11 (<= 0 (+ .cse25 2147483648))) (.cse13 (<= .cse1 2147483647)) (.cse15 (<= ULTIMATE.start_main_~ret~1 2147483647)) (.cse20 (<= 0 (+ .cse26 2147483648))) (.cse21 (<= 0 (+ ULTIMATE.start_main_~ret~1 2147483648))) (.cse22 (<= 0 (+ 2147483648 .cse27))) (.cse30 (<= .cse0 2147483647)) (.cse31 (or (and (<= 0 ULTIMATE.start_main_~ret~1) .cse18 .cse19) (and .cse16 .cse17 (< ULTIMATE.start_main_~ret~1 0))))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 16 (* 4 ULTIMATE.start_main_~i~2)) .cse11 .cse12 .cse13 .cse14 .cse15 (or (and .cse16 .cse17) (and .cse18 .cse19)) .cse20 .cse21 .cse22 (let ((.cse24 (mod (+ .cse1 .cse25 ULTIMATE.start_main_~temp~0 .cse26 .cse27) 4294967296))) (or (and (= .cse23 .cse24) (< 2147483647 .cse24)) (and (= .cse24 ULTIMATE.start_main_~ret2~0) (<= .cse24 2147483647))))) (and .cse2 .cse3 .cse28 .cse4 .cse5 (let ((.cse29 (mod (+ .cse0 .cse1 .cse25 ULTIMATE.start_main_~temp~0 .cse27) 4294967296))) (or (= .cse23 .cse29) (= .cse29 ULTIMATE.start_main_~ret2~0))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_main_~i~2 3) .cse13 .cse14 .cse15 .cse21 .cse22 .cse30 .cse31 (= .cse1 .cse26)) (and .cse2 (= ULTIMATE.start_main_~i~2 1) .cse3 .cse28 (= (select .cse32 (+ (* ULTIMATE.start_main_~i~2 4) |ULTIMATE.start_main_~#x~0.offset|)) .cse27) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (let ((.cse33 (mod (+ .cse0 .cse1 .cse25 ULTIMATE.start_main_~temp~0 .cse26) 4294967296))) (or (= .cse33 ULTIMATE.start_main_~ret~1) (= (+ ULTIMATE.start_main_~ret~1 4294967296) .cse33))) .cse13 .cse14 .cse15 .cse20 .cse21 .cse30 .cse31) (and .cse2 (= ULTIMATE.start_main_~i~2 2) (= .cse25 .cse26) .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 (let ((.cse34 (mod (+ .cse0 .cse1 ULTIMATE.start_main_~temp~0 .cse26 .cse27) 4294967296))) (or (= .cse23 .cse34) (= ULTIMATE.start_main_~ret2~0 .cse34))) .cse13 .cse14 .cse15 .cse20 .cse21 .cse22 .cse30 .cse31) (and .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_main_~temp~0 .cse27) .cse9 (= ULTIMATE.start_sum_~ret~0 (+ .cse0 .cse1 .cse25 .cse26 .cse27)) .cse11 .cse13 (= ULTIMATE.start_main_~i~2 0) .cse15 .cse20 .cse21 .cse22 .cse30 .cse31))))) [2021-08-25 16:18:26,757 INFO L857 garLoopResultBuilder]: For program point L43-4(lines 43 45) no Hoare annotation was computed. [2021-08-25 16:18:26,760 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 16:18:26,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 04:18:26 BoogieIcfgContainer [2021-08-25 16:18:26,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 16:18:26,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 16:18:26,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 16:18:26,854 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 16:18:26,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:17:38" (3/4) ... [2021-08-25 16:18:26,857 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 16:18:26,872 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-25 16:18:26,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 16:18:26,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 16:18:26,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 16:18:26,893 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((x == 0 && (((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 <= 2147483647) || (2147483647 < (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result + 4294967296))) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647 [2021-08-25 16:18:26,894 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((x == 0 && (((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 <= 2147483647) || (2147483647 < (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result + 4294967296))) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647 [2021-08-25 16:18:26,894 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((unknown-#memory_int-unknown[x][x + 16] == unknown-#memory_int-unknown[x][x + 12] && x == 0) && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && temp <= 2147483647) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret <= 10737418235) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) || (ret % 4294967296 == ret2 && ret % 4294967296 == \result))) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && ((ret2 + 4294967296 == (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 && 2147483647 < (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296) || ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret2 && (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 <= 2147483647))) || ((((((((((((((((((((x == 0 && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret2 + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret2)) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && temp <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret <= 10737418235) && i == 3) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0))) && unknown-#memory_int-unknown[x][x + 12] == unknown-#memory_int-unknown[x][x + 8])) || ((((((((((((((((((((x == 0 && i == 1) && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && unknown-#memory_int-unknown[x][i * 4 + x] == unknown-#memory_int-unknown[x][x]) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && temp <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret <= 10737418235) && ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) % 4294967296 == ret || ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) % 4294967296)) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0)))) || ((((((((((((((((((((x == 0 && i == 2) && unknown-#memory_int-unknown[x][x + 4] == unknown-#memory_int-unknown[x][x + 8]) && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && 5 <= i) && temp <= 2147483647) && ret <= 10737418235) && (ret2 + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || ret2 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296)) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0)))) || ((((((((((((((((((x == 0 && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && temp == unknown-#memory_int-unknown[x][x]) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && i == 0) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0))) [2021-08-25 16:18:26,895 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((x == 0 && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] || 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8])) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0)) [2021-08-25 16:18:26,923 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 16:18:26,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 16:18:26,924 INFO L168 Benchmark]: Toolchain (without parser) took 48469.34 ms. Allocated memory was 54.5 MB in the beginning and 541.1 MB in the end (delta: 486.5 MB). Free memory was 31.8 MB in the beginning and 353.6 MB in the end (delta: -321.7 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.1 GB. [2021-08-25 16:18:26,924 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 36.5 MB in the beginning and 36.5 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 16:18:26,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.89 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.6 MB in the beginning and 51.4 MB in the end (delta: -19.8 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2021-08-25 16:18:26,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.08 ms. Allocated memory is still 67.1 MB. Free memory was 51.4 MB in the beginning and 49.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 16:18:26,925 INFO L168 Benchmark]: Boogie Preprocessor took 14.21 ms. Allocated memory is still 67.1 MB. Free memory was 49.5 MB in the beginning and 48.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 16:18:26,925 INFO L168 Benchmark]: RCFGBuilder took 322.19 ms. Allocated memory is still 67.1 MB. Free memory was 48.2 MB in the beginning and 46.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-08-25 16:18:26,926 INFO L168 Benchmark]: TraceAbstraction took 47872.40 ms. Allocated memory was 67.1 MB in the beginning and 541.1 MB in the end (delta: 474.0 MB). Free memory was 45.7 MB in the beginning and 362.0 MB in the end (delta: -316.3 MB). Peak memory consumption was 345.1 MB. Max. memory is 16.1 GB. [2021-08-25 16:18:26,926 INFO L168 Benchmark]: Witness Printer took 69.44 ms. Allocated memory is still 541.1 MB. Free memory was 362.0 MB in the beginning and 353.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 16:18:26,929 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 36.5 MB in the beginning and 36.5 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 163.89 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.6 MB in the beginning and 51.4 MB in the end (delta: -19.8 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 23.08 ms. Allocated memory is still 67.1 MB. Free memory was 51.4 MB in the beginning and 49.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 14.21 ms. Allocated memory is still 67.1 MB. Free memory was 49.5 MB in the beginning and 48.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 322.19 ms. Allocated memory is still 67.1 MB. Free memory was 48.2 MB in the beginning and 46.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 47872.40 ms. Allocated memory was 67.1 MB in the beginning and 541.1 MB in the end (delta: 474.0 MB). Free memory was 45.7 MB in the beginning and 362.0 MB in the end (delta: -316.3 MB). Peak memory consumption was 345.1 MB. Max. memory is 16.1 GB. * Witness Printer took 69.44 ms. Allocated memory is still 541.1 MB. Free memory was 362.0 MB in the beginning and 353.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47706.4ms, OverallIterations: 12, TraceHistogramMax: 6, EmptinessCheckTime: 35.7ms, AutomataDifference: 14225.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6267.7ms, InitialAbstractionConstructionTime: 6.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 252 SDtfs, 253 SDslu, 880 SDs, 0 SdLazy, 4816 SolverSat, 293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4906.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3833 ImplicationChecksByTransitivity, 20322.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=11, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 74.2ms AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 41 NumberOfFragments, 7325 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 73.2ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 634 FormulaSimplificationTreeSizeReductionInter, 6168.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 141.4ms SsaConstructionTime, 1822.5ms SatisfiabilityAnalysisTime, 20949.9ms InterpolantComputationTime, 999 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 976 ConstructedInterpolants, 0 QuantifiedInterpolants, 26977 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1801 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 873/1204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((x == 0 && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] || 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8])) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4]) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 3 == i) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) || ((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + -4 + i * 4]) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i == 1)) || ((((((((((((x == 0 && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647)) || (((((((((((((((x == 0 && x == x) && unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + -4 + i * 4] == ret) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 4 <= i) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i <= 4)) || ((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && ret == 0) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i == 0)) || ((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] == ret) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && 2 == i) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4]) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 3 == i) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) || ((((((((((((((((((x == 0 && x == x) && unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + -4 + i * 4] == ret) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 4 <= i) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i <= 4)) || (((((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + -4 + i * 4]) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i == 1)) || (((((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && ret == 0) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i == 0)) || (((((((((((((((((x == 0 && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && 2 == i) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && ret == unknown-#memory_int-unknown[x][x + i * 4 + -8] + unknown-#memory_int-unknown[x][x + -4 + i * 4]) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647)) || (((((((((((((((x == 0 && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((x == 0 && (((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 <= 2147483647) || (2147483647 < (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result + 4294967296))) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((x == x && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && ((4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret))) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && unknown-#memory_int-unknown[x][0] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][16] + 2147483648) && x == 0) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4]) && unknown-#memory_int-unknown[x][8] <= 2147483647) && 4 <= i) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][12] <= 2147483647) && i <= 4) || (((((((((((((((((((x == x && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + -4 + i * 4]) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && ((4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret))) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && unknown-#memory_int-unknown[x][0] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][16] + 2147483648) && x == 0) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][8] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][12] <= 2147483647) && i == 1)) || (((((((((((((((((((x == x && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && ((4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret))) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && unknown-#memory_int-unknown[x][0] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][16] + 2147483648) && x == 0) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && 2 == i) && ret == unknown-#memory_int-unknown[x][x + i * 4 + -8] + unknown-#memory_int-unknown[x][x + -4 + i * 4]) && unknown-#memory_int-unknown[x][8] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][12] <= 2147483647)) || (((((((((((((((((((x == x && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && ret == 0) && ((4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret))) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && unknown-#memory_int-unknown[x][0] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][16] + 2147483648) && x == 0) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][8] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && i == 0) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][12] <= 2147483647)) || (((((((((((((((((((x == x && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && ((4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret) || (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] && ret2 == ret))) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && unknown-#memory_int-unknown[x][0] <= 2147483647) && x == x) && 0 <= unknown-#memory_int-unknown[x][16] + 2147483648) && x == 0) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4]) && 3 == i) && unknown-#memory_int-unknown[x][8] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][0]) && unknown-#memory_int-unknown[x][12] <= 2147483647)) || ((((((((((((((((((x == 0 && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && ((2147483647 < ret % 4294967296 && ret2 + 4294967296 == ret % 4294967296) || (ret % 4294967296 == ret2 && ret % 4294967296 <= 2147483647))) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && (4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8] || 4294967296 * ((unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8]) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][x + 16 := temp][0] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 4] + temp + unknown-#memory_int-unknown[x][x + 16 := temp][x + 12] + unknown-#memory_int-unknown[x][x + 16 := temp][x + 8])) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((((((((((x == 0 && (((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 <= 2147483647) || (2147483647 < (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == \result + 4294967296))) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret)) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((unknown-#memory_int-unknown[x][x + 16] == unknown-#memory_int-unknown[x][x + 12] && x == 0) && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && temp <= 2147483647) && 16 == 4 * i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret <= 10737418235) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) || (ret % 4294967296 == ret2 && ret % 4294967296 == \result))) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && ((ret2 + 4294967296 == (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 && 2147483647 < (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296) || ((unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret2 && (unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 <= 2147483647))) || ((((((((((((((((((((x == 0 && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && (ret2 + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x]) % 4294967296 || (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x]) % 4294967296 == ret2)) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && temp <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret <= 10737418235) && i == 3) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0))) && unknown-#memory_int-unknown[x][x + 12] == unknown-#memory_int-unknown[x][x + 8])) || ((((((((((((((((((((x == 0 && i == 1) && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && unknown-#memory_int-unknown[x][i * 4 + x] == unknown-#memory_int-unknown[x][x]) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 5 <= i) && temp <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && ret <= 10737418235) && ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) % 4294967296 == ret || ret + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) % 4294967296)) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0)))) || ((((((((((((((((((((x == 0 && i == 2) && unknown-#memory_int-unknown[x][x + 4] == unknown-#memory_int-unknown[x][x + 8]) && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= ret + 10737418240) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && 5 <= i) && temp <= 2147483647) && ret <= 10737418235) && (ret2 + 4294967296 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296 || ret2 == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) % 4294967296)) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= temp + 2147483648) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0)))) || ((((((((((((((((((x == 0 && (ret % 4294967296 == ret2 || ret2 + 4294967296 == ret % 4294967296)) && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && temp == unknown-#memory_int-unknown[x][x]) && 5 <= i) && ret == unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x]) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && i == 0) && ret <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= ret + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647) && (((0 <= ret && ret % 4294967296 == ret2) && ret % 4294967296 == \result) || ((ret2 + 4294967296 == ret % 4294967296 && ret % 4294967296 == \result + 4294967296) && ret < 0))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((x == 0 && i == 2) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) || (((x == 0 && 0 <= unknown-#memory_int-unknown[x][x + -4 + i * 4] + 2147483648) && unknown-#memory_int-unknown[x][x + -4 + i * 4] <= 2147483647) && i == 1)) || (((((((((x == 0 && i == 4) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x])) || (x == 0 && i == 0)) || ((((((((((x == 0 && 0 <= unknown-#memory_int-unknown[x][x + 16] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 12] + 2147483648) && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && unknown-#memory_int-unknown[x][x + 12] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[x][x + 16] <= 2147483647)) || (((((((x == 0 && unknown-#memory_int-unknown[x][x + 8] <= 2147483647) && i == 3) && unknown-#memory_int-unknown[x][x] <= 2147483647) && unknown-#memory_int-unknown[x][x + 4] <= 2147483647) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 2147483648) && 0 <= unknown-#memory_int-unknown[x][x + 8] + 2147483648) && 0 <= 2147483648 + unknown-#memory_int-unknown[x][x]) RESULT: Ultimate proved your program to be correct! [2021-08-25 16:18:26,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...