./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:19:29,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:19:29,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:19:29,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:19:29,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:19:29,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:19:29,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:19:29,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:19:29,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:19:29,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:19:29,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:19:29,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:19:29,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:19:29,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:19:29,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:19:29,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:19:29,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:19:29,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:19:29,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:19:29,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:19:29,088 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:19:29,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:19:29,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:19:29,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:19:29,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:19:29,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:19:29,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:19:29,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:19:29,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:19:29,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:19:29,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:19:29,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:19:29,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:19:29,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:19:29,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:19:29,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:19:29,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:19:29,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:19:29,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:19:29,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:19:29,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:19:29,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:19:29,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:19:29,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:19:29,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:19:29,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:19:29,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:19:29,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:19:29,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:19:29,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:19:29,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:19:29,137 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:19:29,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:19:29,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:19:29,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:19:29,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:19:29,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:19:29,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:19:29,139 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:19:29,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:19:29,140 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:19:29,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:19:29,140 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:19:29,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:19:29,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:19:29,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:19:29,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:19:29,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:19:29,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:19:29,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:19:29,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:19:29,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:19:29,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:19:29,142 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 [2022-07-21 17:19:29,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:19:29,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:19:29,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:19:29,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:19:29,475 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:19:29,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-07-21 17:19:29,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc610f487/268200366114480aaefedccff9fc27f4/FLAGd80890118 [2022-07-21 17:19:29,910 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:19:29,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-07-21 17:19:29,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc610f487/268200366114480aaefedccff9fc27f4/FLAGd80890118 [2022-07-21 17:19:29,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc610f487/268200366114480aaefedccff9fc27f4 [2022-07-21 17:19:29,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:19:29,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:19:29,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:19:29,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:19:29,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:19:29,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:19:29" (1/1) ... [2022-07-21 17:19:29,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:29, skipping insertion in model container [2022-07-21 17:19:29,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:19:29" (1/1) ... [2022-07-21 17:19:29,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:19:29,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:19:30,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:19:30,093 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:19:30,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:19:30,148 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:19:30,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30 WrapperNode [2022-07-21 17:19:30,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:19:30,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:19:30,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:19:30,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:19:30,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,184 INFO L137 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2022-07-21 17:19:30,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:19:30,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:19:30,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:19:30,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:19:30,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:19:30,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:19:30,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:19:30,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:19:30,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (1/1) ... [2022-07-21 17:19:30,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:19:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:30,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 17:19:30,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 17:19:30,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:19:30,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:19:30,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:19:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:19:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 17:19:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:19:30,317 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:19:30,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:19:30,493 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:19:30,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:19:30,500 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 17:19:30,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:19:30 BoogieIcfgContainer [2022-07-21 17:19:30,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:19:30,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:19:30,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:19:30,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:19:30,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:19:29" (1/3) ... [2022-07-21 17:19:30,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa99dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:19:30, skipping insertion in model container [2022-07-21 17:19:30,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:19:30" (2/3) ... [2022-07-21 17:19:30,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa99dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:19:30, skipping insertion in model container [2022-07-21 17:19:30,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:19:30" (3/3) ... [2022-07-21 17:19:30,506 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2022-07-21 17:19:30,536 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:19:30,536 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-21 17:19:30,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:19:30,578 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@635b3406, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12ee67bc [2022-07-21 17:19:30,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-21 17:19:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:19:30,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:30,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:19:30,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:30,591 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-07-21 17:19:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:30,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315107332] [2022-07-21 17:19:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315107332] [2022-07-21 17:19:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315107332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:30,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:30,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:19:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824452780] [2022-07-21 17:19:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:30,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:19:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:19:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:19:30,815 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:30,906 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-21 17:19:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:19:30,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-07-21 17:19:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:30,915 INFO L225 Difference]: With dead ends: 69 [2022-07-21 17:19:30,915 INFO L226 Difference]: Without dead ends: 65 [2022-07-21 17:19:30,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:19:30,925 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:30,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:19:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-21 17:19:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-07-21 17:19:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 38 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) [2022-07-21 17:19:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-07-21 17:19:30,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 5 [2022-07-21 17:19:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:30,952 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-21 17:19:30,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-07-21 17:19:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 17:19:30,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:30,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:30,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:19:30,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811544, now seen corresponding path program 1 times [2022-07-21 17:19:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:30,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685708850] [2022-07-21 17:19:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:31,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:31,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685708850] [2022-07-21 17:19:31,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685708850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:31,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:31,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:19:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622150277] [2022-07-21 17:19:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:31,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:19:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:19:31,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:19:31,015 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:31,087 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-07-21 17:19:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:19:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-07-21 17:19:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:31,089 INFO L225 Difference]: With dead ends: 70 [2022-07-21 17:19:31,089 INFO L226 Difference]: Without dead ends: 70 [2022-07-21 17:19:31,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:19:31,091 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:31,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-21 17:19:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2022-07-21 17:19:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.5) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-21 17:19:31,095 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-07-21 17:19:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:31,095 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-21 17:19:31,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-21 17:19:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:19:31,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:31,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:31,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:19:31,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash -489510905, now seen corresponding path program 1 times [2022-07-21 17:19:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:31,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136514804] [2022-07-21 17:19:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:31,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136514804] [2022-07-21 17:19:31,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136514804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:31,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:31,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:19:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548202290] [2022-07-21 17:19:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:31,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:19:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:19:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:19:31,147 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:31,175 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-21 17:19:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:19:31,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:19:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:31,177 INFO L225 Difference]: With dead ends: 75 [2022-07-21 17:19:31,177 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 17:19:31,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:19:31,178 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:31,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 152 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 17:19:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2022-07-21 17:19:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 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) [2022-07-21 17:19:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-21 17:19:31,183 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2022-07-21 17:19:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:31,183 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-21 17:19:31,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-21 17:19:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:19:31,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:31,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:31,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:19:31,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -489508983, now seen corresponding path program 1 times [2022-07-21 17:19:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:31,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029362432] [2022-07-21 17:19:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029362432] [2022-07-21 17:19:31,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029362432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:31,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:31,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:19:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678064675] [2022-07-21 17:19:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:31,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:19:31,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:19:31,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:19:31,267 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:31,301 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-07-21 17:19:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:19:31,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:19:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:31,303 INFO L225 Difference]: With dead ends: 43 [2022-07-21 17:19:31,303 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 17:19:31,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:19:31,304 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:31,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 17:19:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-21 17:19:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-21 17:19:31,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2022-07-21 17:19:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:31,311 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-21 17:19:31,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-21 17:19:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:19:31,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:31,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:31,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:19:31,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash -489508982, now seen corresponding path program 1 times [2022-07-21 17:19:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103600926] [2022-07-21 17:19:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:31,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103600926] [2022-07-21 17:19:31,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103600926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:31,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:31,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:19:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586249620] [2022-07-21 17:19:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:31,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:19:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:19:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:19:31,426 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:31,476 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-07-21 17:19:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:19:31,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:19:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:31,478 INFO L225 Difference]: With dead ends: 50 [2022-07-21 17:19:31,478 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 17:19:31,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:19:31,486 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:31,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 17:19:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-21 17:19:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-21 17:19:31,498 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2022-07-21 17:19:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:31,498 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-21 17:19:31,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-21 17:19:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:19:31,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:31,500 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:19:31,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839934, now seen corresponding path program 1 times [2022-07-21 17:19:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:31,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820683676] [2022-07-21 17:19:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820683676] [2022-07-21 17:19:31,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820683676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:31,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:31,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:19:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941063478] [2022-07-21 17:19:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:31,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:19:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:31,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:19:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:19:31,543 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:31,565 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-07-21 17:19:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:19:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:19:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:31,566 INFO L225 Difference]: With dead ends: 47 [2022-07-21 17:19:31,567 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 17:19:31,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:19:31,576 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:31,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 17:19:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-21 17:19:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-21 17:19:31,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2022-07-21 17:19:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:31,587 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-21 17:19:31,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-21 17:19:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:19:31,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:31,588 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:31,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:19:31,588 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839933, now seen corresponding path program 1 times [2022-07-21 17:19:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:31,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522142582] [2022-07-21 17:19:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522142582] [2022-07-21 17:19:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522142582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354545908] [2022-07-21 17:19:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:31,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:31,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:31,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:19:31,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:19:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:31,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:19:31,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:31,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:19:31,855 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:19:31,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 17:19:31,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:19:32,066 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:19:32,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:19:32,144 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:19:32,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 17:19:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:32,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:39,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~n#1_3| Int) (v_ArrVal_54 Int)) (or (and (<= 0 |c_ULTIMATE.start_main_~#b~0#1.offset|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_12| Int)) (<= (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4) (select (store |c_#length| |v_ULTIMATE.start_foo_~#a~0#1.base_12| v_ArrVal_54) |c_ULTIMATE.start_main_~#b~0#1.base|)))) (not (<= (* |v_ULTIMATE.start_foo_~n#1_3| 4) v_ArrVal_54)) (< |v_ULTIMATE.start_foo_~n#1_3| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))) is different from false [2022-07-21 17:19:43,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 17:19:48,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_13| Int) (|v_ULTIMATE.start_foo_~n#1_3| Int) (v_ArrVal_54 Int) (v_ArrVal_52 Int)) (or (not (<= (* |v_ULTIMATE.start_foo_~n#1_3| 4) v_ArrVal_54)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_13| |c_ULTIMATE.start_main_~#b~0#1.base|) (and (<= 0 |c_ULTIMATE.start_main_~#b~0#1.offset|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_12| Int)) (<= (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_foo_~#a~0#1.base_13| v_ArrVal_52) |v_ULTIMATE.start_foo_~#a~0#1.base_12| v_ArrVal_54) |c_ULTIMATE.start_main_~#b~0#1.base|)))) (< |v_ULTIMATE.start_foo_~n#1_3| (+ |c_ULTIMATE.start_main_~i~2#1| 1)))) is different from false [2022-07-21 17:19:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 17:19:48,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354545908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:48,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:48,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2022-07-21 17:19:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573299183] [2022-07-21 17:19:48,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:48,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:19:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:48,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:19:48,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=140, Unknown=6, NotChecked=50, Total=240 [2022-07-21 17:19:48,812 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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) [2022-07-21 17:19:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:49,337 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2022-07-21 17:19:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 17:19:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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 16 [2022-07-21 17:19:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:49,340 INFO L225 Difference]: With dead ends: 183 [2022-07-21 17:19:49,340 INFO L226 Difference]: Without dead ends: 183 [2022-07-21 17:19:49,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=182, Invalid=576, Unknown=6, NotChecked=106, Total=870 [2022-07-21 17:19:49,340 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 351 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:49,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 152 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 148 Invalid, 0 Unknown, 404 Unchecked, 0.2s Time] [2022-07-21 17:19:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-21 17:19:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 101. [2022-07-21 17:19:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 100 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2022-07-21 17:19:49,347 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 16 [2022-07-21 17:19:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:49,355 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2022-07-21 17:19:49,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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) [2022-07-21 17:19:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2022-07-21 17:19:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:19:49,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:49,356 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:49,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:49,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:49,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash -411430410, now seen corresponding path program 1 times [2022-07-21 17:19:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:49,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528563619] [2022-07-21 17:19:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:49,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528563619] [2022-07-21 17:19:49,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528563619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:49,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:49,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:19:49,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399116022] [2022-07-21 17:19:49,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:49,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:19:49,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:49,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:19:49,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:49,600 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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) [2022-07-21 17:19:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:49,620 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-07-21 17:19:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:19:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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 [2022-07-21 17:19:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:49,621 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:19:49,621 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:19:49,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:19:49,622 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:49,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:19:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-21 17:19:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 99 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2022-07-21 17:19:49,636 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 17 [2022-07-21 17:19:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:49,636 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2022-07-21 17:19:49,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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) [2022-07-21 17:19:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-07-21 17:19:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:19:49,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:49,637 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:49,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:19:49,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -411430409, now seen corresponding path program 1 times [2022-07-21 17:19:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:49,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722746630] [2022-07-21 17:19:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:49,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722746630] [2022-07-21 17:19:49,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722746630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:49,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886059812] [2022-07-21 17:19:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:49,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:19:49,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:19:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:49,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:19:49,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:49,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:19:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:49,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:49,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886059812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:49,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:49,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-21 17:19:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325764291] [2022-07-21 17:19:49,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:49,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:19:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:19:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:19:49,815 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:49,880 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2022-07-21 17:19:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:19:49,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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 [2022-07-21 17:19:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:49,881 INFO L225 Difference]: With dead ends: 147 [2022-07-21 17:19:49,881 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 17:19:49,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:19:49,882 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 83 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:49,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 68 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 17:19:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2022-07-21 17:19:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 104 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2022-07-21 17:19:49,885 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 17 [2022-07-21 17:19:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:49,885 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2022-07-21 17:19:49,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2022-07-21 17:19:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:19:49,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:49,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:49,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:50,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 17:19:50,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:50,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 130511665, now seen corresponding path program 1 times [2022-07-21 17:19:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:50,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941479184] [2022-07-21 17:19:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941479184] [2022-07-21 17:19:50,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941479184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:19:50,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:19:50,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:19:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276363522] [2022-07-21 17:19:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:19:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:19:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:19:50,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:19:50,140 INFO L87 Difference]: Start difference. First operand 105 states and 137 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:50,170 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2022-07-21 17:19:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:19:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-07-21 17:19:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:50,171 INFO L225 Difference]: With dead ends: 104 [2022-07-21 17:19:50,171 INFO L226 Difference]: Without dead ends: 104 [2022-07-21 17:19:50,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:19:50,172 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:50,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-21 17:19:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-21 17:19:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 103 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2022-07-21 17:19:50,176 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 18 [2022-07-21 17:19:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:50,178 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2022-07-21 17:19:50,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2022-07-21 17:19:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 17:19:50,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:50,180 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:50,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:19:50,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 130511666, now seen corresponding path program 1 times [2022-07-21 17:19:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331241562] [2022-07-21 17:19:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:50,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331241562] [2022-07-21 17:19:50,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331241562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:50,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813030603] [2022-07-21 17:19:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:50,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:50,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:19:50,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:19:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:50,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:19:50,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:50,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:50,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813030603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:50,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:50,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-21 17:19:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190616366] [2022-07-21 17:19:50,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:50,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:19:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:19:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:19:50,336 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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) [2022-07-21 17:19:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:50,396 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-07-21 17:19:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:19:50,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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 18 [2022-07-21 17:19:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:50,397 INFO L225 Difference]: With dead ends: 111 [2022-07-21 17:19:50,398 INFO L226 Difference]: Without dead ends: 111 [2022-07-21 17:19:50,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:19:50,398 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:50,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 96 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-21 17:19:50,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2022-07-21 17:19:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 103 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-21 17:19:50,403 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 18 [2022-07-21 17:19:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:50,403 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-21 17:19:50,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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) [2022-07-21 17:19:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-21 17:19:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:19:50,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:50,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:50,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:50,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:50,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash 624099572, now seen corresponding path program 1 times [2022-07-21 17:19:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:50,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725993769] [2022-07-21 17:19:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:50,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:50,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725993769] [2022-07-21 17:19:50,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725993769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:50,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328503899] [2022-07-21 17:19:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:50,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:50,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:19:50,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 17:19:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:50,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:19:50,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:50,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:50,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328503899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:50,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:50,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-21 17:19:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943028465] [2022-07-21 17:19:50,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:50,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:19:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:19:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:19:50,722 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:50,749 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2022-07-21 17:19:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:19:50,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:19:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:50,750 INFO L225 Difference]: With dead ends: 168 [2022-07-21 17:19:50,750 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:19:50,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:19:50,751 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 151 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:50,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:19:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-07-21 17:19:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 159 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2022-07-21 17:19:50,754 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 20 [2022-07-21 17:19:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:50,754 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2022-07-21 17:19:50,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2022-07-21 17:19:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:19:50,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:50,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:50,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:50,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:50,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1752050598, now seen corresponding path program 1 times [2022-07-21 17:19:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:50,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502994342] [2022-07-21 17:19:50,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502994342] [2022-07-21 17:19:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502994342] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451585607] [2022-07-21 17:19:51,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:51,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:51,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:51,016 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) [2022-07-21 17:19:51,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:19:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:51,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:19:51,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:51,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:51,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451585607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:51,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:51,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-21 17:19:51,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291408548] [2022-07-21 17:19:51,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:51,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:19:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:51,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:19:51,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:19:51,159 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:51,261 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-07-21 17:19:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:19:51,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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 21 [2022-07-21 17:19:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:51,262 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:19:51,263 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:19:51,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:19:51,264 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 112 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:51,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 121 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:19:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:19:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-21 17:19:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 157 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2022-07-21 17:19:51,267 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 21 [2022-07-21 17:19:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:51,267 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2022-07-21 17:19:51,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-07-21 17:19:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:19:51,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:51,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:51,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:51,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 17:19:51,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash -93493367, now seen corresponding path program 1 times [2022-07-21 17:19:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:51,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554645866] [2022-07-21 17:19:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554645866] [2022-07-21 17:19:51,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554645866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195855110] [2022-07-21 17:19:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:51,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:51,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:51,540 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) [2022-07-21 17:19:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 17:19:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:51,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 17:19:51,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:51,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:51,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-21 17:19:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:51,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195855110] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:51,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:51,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-21 17:19:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120593021] [2022-07-21 17:19:51,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:51,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:19:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:19:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:19:51,715 INFO L87 Difference]: Start difference. First operand 158 states and 196 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:51,828 INFO L93 Difference]: Finished difference Result 220 states and 264 transitions. [2022-07-21 17:19:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:19:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 23 [2022-07-21 17:19:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:51,830 INFO L225 Difference]: With dead ends: 220 [2022-07-21 17:19:51,830 INFO L226 Difference]: Without dead ends: 220 [2022-07-21 17:19:51,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:19:51,830 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:51,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 115 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:19:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-21 17:19:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 163. [2022-07-21 17:19:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 157 states have (on average 1.2802547770700636) internal successors, (201), 162 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2022-07-21 17:19:51,833 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 23 [2022-07-21 17:19:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:51,833 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2022-07-21 17:19:51,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2022-07-21 17:19:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:19:51,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:51,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:51,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:52,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:52,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1409452358, now seen corresponding path program 1 times [2022-07-21 17:19:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:52,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64588449] [2022-07-21 17:19:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:52,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64588449] [2022-07-21 17:19:52,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64588449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:52,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589740365] [2022-07-21 17:19:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:52,090 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) [2022-07-21 17:19:52,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 17:19:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:52,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:19:52,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:52,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:52,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589740365] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:52,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:52,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-21 17:19:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292496486] [2022-07-21 17:19:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:19:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:19:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:19:52,214 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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) [2022-07-21 17:19:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:52,286 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2022-07-21 17:19:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:19:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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 27 [2022-07-21 17:19:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:52,287 INFO L225 Difference]: With dead ends: 158 [2022-07-21 17:19:52,288 INFO L226 Difference]: Without dead ends: 158 [2022-07-21 17:19:52,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:19:52,288 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:52,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 106 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:19:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-21 17:19:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2022-07-21 17:19:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 147 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-07-21 17:19:52,291 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 27 [2022-07-21 17:19:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:52,291 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-07-21 17:19:52,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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) [2022-07-21 17:19:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-07-21 17:19:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:19:52,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:52,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:52,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:52,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:52,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1360755252, now seen corresponding path program 1 times [2022-07-21 17:19:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:52,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178987837] [2022-07-21 17:19:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:52,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178987837] [2022-07-21 17:19:52,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178987837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:52,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089131908] [2022-07-21 17:19:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:52,548 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) [2022-07-21 17:19:52,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 17:19:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:52,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:19:52,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:52,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:19:52,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089131908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:19:52,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:19:52,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-21 17:19:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225356226] [2022-07-21 17:19:52,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:52,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:19:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:19:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:19:52,684 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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) [2022-07-21 17:19:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:52,798 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2022-07-21 17:19:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:19:52,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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) Word has length 27 [2022-07-21 17:19:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:52,799 INFO L225 Difference]: With dead ends: 150 [2022-07-21 17:19:52,799 INFO L226 Difference]: Without dead ends: 150 [2022-07-21 17:19:52,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:19:52,800 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 168 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:52,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 162 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:19:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-21 17:19:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-21 17:19:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 146 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:19:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-07-21 17:19:52,802 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 27 [2022-07-21 17:19:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:52,802 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-07-21 17:19:52,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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) [2022-07-21 17:19:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-07-21 17:19:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:19:52,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:52,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:52,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:53,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 17:19:53,003 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:19:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -144329733, now seen corresponding path program 1 times [2022-07-21 17:19:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:53,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325614217] [2022-07-21 17:19:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:19:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325614217] [2022-07-21 17:19:53,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325614217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255308396] [2022-07-21 17:19:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:53,139 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) [2022-07-21 17:19:53,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:19:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:53,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-21 17:19:53,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:53,255 INFO L390 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 11 treesize of output 7 [2022-07-21 17:19:53,330 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:19:53,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 17:19:53,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:19:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:53,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:07,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-21 17:20:07,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-21 17:20:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:20:07,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255308396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:07,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:07,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 31 [2022-07-21 17:20:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717745274] [2022-07-21 17:20:07,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:07,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 17:20:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 17:20:07,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=830, Unknown=6, NotChecked=0, Total=930 [2022-07-21 17:20:07,866 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:08,486 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2022-07-21 17:20:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 17:20:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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 31 [2022-07-21 17:20:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:08,487 INFO L225 Difference]: With dead ends: 127 [2022-07-21 17:20:08,487 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 17:20:08,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=344, Invalid=2200, Unknown=6, NotChecked=0, Total=2550 [2022-07-21 17:20:08,489 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 82 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:08,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 330 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 463 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2022-07-21 17:20:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 17:20:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-21 17:20:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 123 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-21 17:20:08,490 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 31 [2022-07-21 17:20:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:08,491 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-21 17:20:08,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-21 17:20:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:20:08,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:08,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:20:08,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:08,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 17:20:08,703 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2032716941, now seen corresponding path program 1 times [2022-07-21 17:20:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:08,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029667405] [2022-07-21 17:20:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:20:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:08,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029667405] [2022-07-21 17:20:08,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029667405] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:08,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548542447] [2022-07-21 17:20:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:08,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:08,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:08,828 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) [2022-07-21 17:20:08,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 17:20:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:08,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 17:20:08,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:09,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 21 [2022-07-21 17:20:09,032 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:09,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:09,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:09,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:09,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-21 17:20:09,215 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:20:09,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:20:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548542447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:09,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:09,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-07-21 17:20:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183024319] [2022-07-21 17:20:09,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 17:20:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 17:20:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:20:09,300 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:09,585 INFO L93 Difference]: Finished difference Result 208 states and 248 transitions. [2022-07-21 17:20:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:20:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 states have internal predecessors, (121), 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 41 [2022-07-21 17:20:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:09,586 INFO L225 Difference]: With dead ends: 208 [2022-07-21 17:20:09,586 INFO L226 Difference]: Without dead ends: 208 [2022-07-21 17:20:09,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-07-21 17:20:09,587 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 159 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:09,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 235 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 241 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-07-21 17:20:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-21 17:20:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 99. [2022-07-21 17:20:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1914893617021276) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-07-21 17:20:09,589 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 41 [2022-07-21 17:20:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:09,589 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-07-21 17:20:09,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-07-21 17:20:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:20:09,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:09,589 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:20:09,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 17:20:09,799 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1410284307, now seen corresponding path program 1 times [2022-07-21 17:20:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:09,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364979831] [2022-07-21 17:20:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:09,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364979831] [2022-07-21 17:20:09,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364979831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435086615] [2022-07-21 17:20:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:09,869 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) [2022-07-21 17:20:09,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 17:20:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:09,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 17:20:09,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:09,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:20:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:10,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435086615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:10,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:10,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-21 17:20:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209882536] [2022-07-21 17:20:10,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:10,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:20:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:20:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:20:10,079 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:10,214 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2022-07-21 17:20:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:20:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 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 42 [2022-07-21 17:20:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:10,215 INFO L225 Difference]: With dead ends: 126 [2022-07-21 17:20:10,215 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 17:20:10,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:20:10,216 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:10,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 170 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:20:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 17:20:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2022-07-21 17:20:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.1875) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-07-21 17:20:10,217 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 42 [2022-07-21 17:20:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:10,218 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-07-21 17:20:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-07-21 17:20:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:20:10,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:10,218 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:20:10,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:10,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:10,427 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash 183114832, now seen corresponding path program 2 times [2022-07-21 17:20:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:10,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608505076] [2022-07-21 17:20:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608505076] [2022-07-21 17:20:10,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608505076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:10,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126584264] [2022-07-21 17:20:10,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:20:10,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:10,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:10,488 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:10,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 17:20:10,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:20:10,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:10,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:20:10,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:10,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:20:10,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126584264] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:10,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:10,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-21 17:20:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196813851] [2022-07-21 17:20:10,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:10,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:20:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:20:10,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:20:10,678 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:10,847 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-07-21 17:20:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:20:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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 46 [2022-07-21 17:20:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:10,848 INFO L225 Difference]: With dead ends: 118 [2022-07-21 17:20:10,848 INFO L226 Difference]: Without dead ends: 118 [2022-07-21 17:20:10,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:20:10,848 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 302 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:10,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 170 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:20:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-21 17:20:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2022-07-21 17:20:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-07-21 17:20:10,850 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2022-07-21 17:20:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:10,850 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-07-21 17:20:10,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-07-21 17:20:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:20:10,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:10,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-21 17:20:10,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:11,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:11,051 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 457132991, now seen corresponding path program 2 times [2022-07-21 17:20:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:11,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331017606] [2022-07-21 17:20:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:20:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331017606] [2022-07-21 17:20:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331017606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413735474] [2022-07-21 17:20:11,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:20:11,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:11,137 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 17:20:11,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:20:11,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:11,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:20:11,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:20:11,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 17:20:11,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413735474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:11,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:11,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-21 17:20:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443625641] [2022-07-21 17:20:11,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:11,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:20:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:20:11,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:20:11,335 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:11,429 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-07-21 17:20:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:20:11,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 47 [2022-07-21 17:20:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:11,438 INFO L225 Difference]: With dead ends: 101 [2022-07-21 17:20:11,438 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 17:20:11,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:20:11,438 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:11,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:20:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 17:20:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-07-21 17:20:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-21 17:20:11,440 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2022-07-21 17:20:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:11,441 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-21 17:20:11,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-21 17:20:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:20:11,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:11,441 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-21 17:20:11,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:11,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 17:20:11,650 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash -269976254, now seen corresponding path program 3 times [2022-07-21 17:20:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:11,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113692378] [2022-07-21 17:20:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 17:20:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113692378] [2022-07-21 17:20:11,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113692378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230094595] [2022-07-21 17:20:11,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:20:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:11,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:11,757 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:11,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 17:20:11,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 17:20:11,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:11,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 17:20:11,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:11,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:20:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 17:20:11,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 17:20:12,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230094595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:12,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:12,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 17 [2022-07-21 17:20:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42438612] [2022-07-21 17:20:12,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:12,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 17:20:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 17:20:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:20:12,141 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:12,687 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-21 17:20:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:20:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 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 52 [2022-07-21 17:20:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:12,688 INFO L225 Difference]: With dead ends: 128 [2022-07-21 17:20:12,688 INFO L226 Difference]: Without dead ends: 128 [2022-07-21 17:20:12,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 17:20:12,689 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 204 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:12,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 208 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:20:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-21 17:20:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2022-07-21 17:20:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-21 17:20:12,691 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 52 [2022-07-21 17:20:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:12,691 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-21 17:20:12,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-21 17:20:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 17:20:12,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:12,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-21 17:20:12,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:12,908 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1642790799, now seen corresponding path program 2 times [2022-07-21 17:20:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:12,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666356429] [2022-07-21 17:20:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:20:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:12,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666356429] [2022-07-21 17:20:12,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666356429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:12,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088358408] [2022-07-21 17:20:12,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:20:12,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:12,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:12,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:12,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 17:20:13,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:20:13,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:13,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:20:13,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:20:13,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:20:13,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088358408] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:13,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:13,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-21 17:20:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047670235] [2022-07-21 17:20:13,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:13,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:20:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:20:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:20:13,198 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:13,329 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-07-21 17:20:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:20:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 56 [2022-07-21 17:20:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:13,329 INFO L225 Difference]: With dead ends: 110 [2022-07-21 17:20:13,330 INFO L226 Difference]: Without dead ends: 110 [2022-07-21 17:20:13,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:20:13,330 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 96 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:13,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 253 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:20:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-21 17:20:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-07-21 17:20:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.11) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-07-21 17:20:13,332 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 56 [2022-07-21 17:20:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:13,332 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-07-21 17:20:13,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-07-21 17:20:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 17:20:13,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:13,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-21 17:20:13,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:13,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:13,544 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash 74449076, now seen corresponding path program 3 times [2022-07-21 17:20:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:13,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511159606] [2022-07-21 17:20:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:20:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:13,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511159606] [2022-07-21 17:20:13,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511159606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:13,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124718416] [2022-07-21 17:20:13,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:20:13,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:13,759 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:13,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 17:20:13,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 17:20:13,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:13,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 17:20:13,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:13,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:20:13,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:20:13,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:13,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 17:20:13,879 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:13,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:13,968 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:20:13,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-21 17:20:14,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:20:14,199 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-21 17:20:14,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:20:14,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 17:20:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 17:20:14,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:14,868 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:20:14,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-21 17:20:18,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:18,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:18,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 17:20:18,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124718416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:18,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:18,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2022-07-21 17:20:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527202344] [2022-07-21 17:20:18,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:18,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 17:20:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 17:20:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=796, Unknown=1, NotChecked=0, Total=992 [2022-07-21 17:20:18,580 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:19,530 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2022-07-21 17:20:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 17:20:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 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 60 [2022-07-21 17:20:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:19,532 INFO L225 Difference]: With dead ends: 169 [2022-07-21 17:20:19,532 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 17:20:19,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=521, Invalid=1928, Unknown=1, NotChecked=0, Total=2450 [2022-07-21 17:20:19,533 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 231 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:19,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 396 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 293 Unchecked, 0.1s Time] [2022-07-21 17:20:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 17:20:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2022-07-21 17:20:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1383647798742138) internal successors, (181), 162 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2022-07-21 17:20:19,541 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 60 [2022-07-21 17:20:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:19,541 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2022-07-21 17:20:19,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2022-07-21 17:20:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 17:20:19,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:19,542 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-21 17:20:19,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:19,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 17:20:19,755 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash -809246151, now seen corresponding path program 1 times [2022-07-21 17:20:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:19,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359399995] [2022-07-21 17:20:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 33 proven. 92 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:20:19,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:19,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359399995] [2022-07-21 17:20:19,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359399995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365677280] [2022-07-21 17:20:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:19,879 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:19,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 17:20:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:19,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:20:19,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:20,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:20,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 21 [2022-07-21 17:20:20,154 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:20,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:20,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:20,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:20,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-21 17:20:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:20,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365677280] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:20,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:20,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-07-21 17:20:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797652889] [2022-07-21 17:20:20,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:20,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 17:20:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 17:20:20,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:20:20,566 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:21,022 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2022-07-21 17:20:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:20:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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 75 [2022-07-21 17:20:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:21,023 INFO L225 Difference]: With dead ends: 244 [2022-07-21 17:20:21,023 INFO L226 Difference]: Without dead ends: 244 [2022-07-21 17:20:21,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 17:20:21,024 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 279 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:21,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 355 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 349 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-07-21 17:20:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-21 17:20:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 175. [2022-07-21 17:20:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 171 states have (on average 1.1461988304093567) internal successors, (196), 174 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-07-21 17:20:21,028 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 75 [2022-07-21 17:20:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:21,028 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-07-21 17:20:21,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-07-21 17:20:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 17:20:21,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:21,034 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-21 17:20:21,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-21 17:20:21,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:21,251 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 683173057, now seen corresponding path program 1 times [2022-07-21 17:20:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965215990] [2022-07-21 17:20:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 88 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:21,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:21,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965215990] [2022-07-21 17:20:21,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965215990] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:21,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961332275] [2022-07-21 17:20:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:21,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:21,351 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:21,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-21 17:20:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:21,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:20:21,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:21,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-21 17:20:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:21,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:21,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961332275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:21,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:21,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-21 17:20:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079259665] [2022-07-21 17:20:21,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:21,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 17:20:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 17:20:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:20:21,717 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:21,955 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2022-07-21 17:20:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:20:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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 76 [2022-07-21 17:20:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:21,956 INFO L225 Difference]: With dead ends: 223 [2022-07-21 17:20:21,956 INFO L226 Difference]: Without dead ends: 223 [2022-07-21 17:20:21,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:20:21,957 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 106 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:21,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 311 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:20:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-21 17:20:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 178. [2022-07-21 17:20:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 177 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2022-07-21 17:20:21,959 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 76 [2022-07-21 17:20:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:21,959 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2022-07-21 17:20:21,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2022-07-21 17:20:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-21 17:20:21,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:21,960 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-07-21 17:20:21,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-21 17:20:22,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:22,179 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1737117148, now seen corresponding path program 2 times [2022-07-21 17:20:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146650850] [2022-07-21 17:20:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 137 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146650850] [2022-07-21 17:20:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146650850] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723683941] [2022-07-21 17:20:22,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:20:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:22,250 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:22,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-21 17:20:22,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:20:22,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:22,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:20:22,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:22,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:20:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723683941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:22,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-07-21 17:20:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715574102] [2022-07-21 17:20:22,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:22,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:20:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:20:22,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:20:22,576 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:22,847 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2022-07-21 17:20:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:20:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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 80 [2022-07-21 17:20:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:22,848 INFO L225 Difference]: With dead ends: 220 [2022-07-21 17:20:22,848 INFO L226 Difference]: Without dead ends: 220 [2022-07-21 17:20:22,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 17:20:22,849 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 390 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:22,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 247 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:20:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-21 17:20:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2022-07-21 17:20:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.127906976744186) internal successors, (194), 175 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2022-07-21 17:20:22,852 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 80 [2022-07-21 17:20:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:22,852 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2022-07-21 17:20:22,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2022-07-21 17:20:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-21 17:20:22,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:22,853 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-21 17:20:22,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:23,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:23,071 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2063647327, now seen corresponding path program 4 times [2022-07-21 17:20:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:23,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452604927] [2022-07-21 17:20:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 17:20:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:23,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452604927] [2022-07-21 17:20:23,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452604927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:23,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903755162] [2022-07-21 17:20:23,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 17:20:23,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:23,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:23,163 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:23,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-21 17:20:23,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 17:20:23,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:23,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:20:23,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 17:20:23,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 17:20:23,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903755162] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:20:23,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:20:23,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2022-07-21 17:20:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603565678] [2022-07-21 17:20:23,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:23,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 17:20:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 17:20:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:20:23,523 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:23,796 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2022-07-21 17:20:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 17:20:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 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 89 [2022-07-21 17:20:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:23,803 INFO L225 Difference]: With dead ends: 197 [2022-07-21 17:20:23,803 INFO L226 Difference]: Without dead ends: 197 [2022-07-21 17:20:23,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2022-07-21 17:20:23,804 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 120 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:23,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 315 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:20:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-21 17:20:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-07-21 17:20:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 187 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2022-07-21 17:20:23,807 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 89 [2022-07-21 17:20:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:23,807 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2022-07-21 17:20:23,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:20:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-07-21 17:20:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 17:20:23,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:23,808 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-21 17:20:23,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-21 17:20:24,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 17:20:24,023 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:20:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1513850931, now seen corresponding path program 5 times [2022-07-21 17:20:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:24,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420305089] [2022-07-21 17:20:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 17:20:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:24,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420305089] [2022-07-21 17:20:24,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420305089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:24,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128643526] [2022-07-21 17:20:24,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 17:20:24,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:24,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:24,362 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:24,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-21 17:20:24,540 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-21 17:20:24,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:20:24,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-21 17:20:24,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:24,634 INFO L390 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 15 treesize of output 11 [2022-07-21 17:20:24,699 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:24,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:24,744 INFO L390 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 19 treesize of output 21 [2022-07-21 17:20:24,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:24,915 INFO L390 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 28 treesize of output 27 [2022-07-21 17:20:24,994 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:24,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:25,059 INFO L390 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 31 treesize of output 31 [2022-07-21 17:20:25,154 INFO L390 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 31 treesize of output 31 [2022-07-21 17:20:25,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,367 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-21 17:20:25,439 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:25,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:25,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:25,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-07-21 17:20:25,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:25,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2022-07-21 17:20:25,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:25,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2022-07-21 17:20:26,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 25 [2022-07-21 17:20:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 229 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:20:26,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:20:28,601 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:20:28,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:22:55,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) is different from false [2022-07-21 17:22:57,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) is different from false [2022-07-21 17:22:57,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-07-21 17:22:59,177 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:22:59,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:22:59,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_833)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-21 17:22:59,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_833 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-21 17:22:59,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-07-21 17:23:05,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:23:05,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 635 treesize of output 383 [2022-07-21 17:23:05,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:23:05,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:23:05,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:23:05,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 337 [2022-07-21 17:23:05,260 INFO L356 Elim1Store]: treesize reduction 69, result has 5.5 percent of original size [2022-07-21 17:23:05,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2169 treesize of output 2055 [2022-07-21 17:23:05,291 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:23:05,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:23:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 9 proven. 75 refuted. 3 times theorem prover too weak. 10 trivial. 146 not checked. [2022-07-21 17:23:08,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128643526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:23:08,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:23:08,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 41, 41] total 95 [2022-07-21 17:23:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731399726] [2022-07-21 17:23:08,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:23:08,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-21 17:23:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:23:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-21 17:23:08,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=7327, Unknown=101, NotChecked=1074, Total=8930 [2022-07-21 17:23:08,276 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:23:32,243 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse8 (+ 392 .cse5)) (.cse9 (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (= (+ (- 1) |c_ULTIMATE.start_main_~i~2#1|) 1) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 8) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= .cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 4)))) (= 400 .cse9) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (<= .cse8 .cse9)))) is different from false [2022-07-21 17:23:32,249 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse6) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-07-21 17:23:32,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse11 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 8))) 0) (or .cse11 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse10) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 4)))) (not .cse11) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-07-21 17:23:32,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse11 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 8))) 0) (or .cse11 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse10) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse10 (- 4)))) (not .cse11) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-21 17:23:32,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse6) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse6 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-21 17:23:32,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse12 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 8))) 0) (or (<= (+ 392 .cse11) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse12) (<= 1 (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 4)))) (not .cse12) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-21 17:23:32,296 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 8))) 0) (or (<= (+ 392 .cse11) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 (select .cse10 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-21 17:23:34,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_#res#1|) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-07-21 17:23:42,742 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse6 0) 0) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (not (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse6 8)) (<= 1 (select .cse6 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,752 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1))) (< 0 (+ 3 |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~i~1#1|)) (< 0 |c_ULTIMATE.start_main_~i~2#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))))) is different from false [2022-07-21 17:23:42,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse6 8)) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (<= 1 (select .cse6 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (= |c_ULTIMATE.start_foo_#t~mem3#1| (select .cse0 (+ |c_ULTIMATE.start_foo_~b#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse6) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse6) 0) (<= 2 (select .cse0 8)) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse13 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12) v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse12 4) v_ArrVal_836))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (<= 1 (select .cse0 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* |c_ULTIMATE.start_foo_~i~1#1| 4)) (.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (select .cse10 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse11)) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse11)) 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse10 8)) (<= 1 (select .cse10 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (or (< (+ |c_ULTIMATE.start_foo_~i~1#1| 1) |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse17 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse17) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse17 4) v_ArrVal_836))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#b~0#1.base| .cse15)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse13 (store (select .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse14))) (or (< v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse13) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse13 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse14)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 (+ |c_ULTIMATE.start_foo_~i~1#1| 1)))))))))) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,806 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-07-21 17:23:42,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse10)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse8 (store (select .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse9))) (or (< v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse8) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse7 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse8 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse9)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (or (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse16 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse16) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse16 4) v_ArrVal_836))) (let ((.cse11 (store .cse15 |c_ULTIMATE.start_main_~#b~0#1.base| .cse14)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse12 (store (select .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse13))) (or (< v_ArrVal_841 (select (select (store .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse12) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse12 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse13)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse17 8)) (<= 1 (select .cse17 4)) (= (select .cse17 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,834 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0) (<= 2 (select .cse7 8)) (<= 1 (select .cse7 4)) (= (select .cse7 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (select .cse5 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6)) |c_ULTIMATE.start_foo_#t~mem3#1|) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse6 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse5 8)) (<= 1 (select .cse5 4)) (= (select .cse5 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse6 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|)))) is different from false [2022-07-21 17:23:42,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse8 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse0 (select .cse13 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (<= 1 .cse0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse6) (= (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8 (- 4))) 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse12)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse11))) (or (< v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse10) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse10 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse11)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_foo_~i~1#1|) 0) (<= .cse0 (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse8))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse6) 0) (<= 2 (select .cse13 8)) (= (select .cse13 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse8 (- 4))) 0) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-21 17:23:42,865 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse6 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse8 |c_ULTIMATE.start_foo_~b#1.offset|) 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse12)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse11))) (or (< v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse10) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse9 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse10 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse11)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse8 8)) (<= 1 .cse5) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-21 17:23:42,874 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse5 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse6 |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse7) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse8 |c_ULTIMATE.start_foo_~b#1.offset|) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse7) 0) (<= 2 (select .cse8 8)) (<= 1 .cse5) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-07-21 17:23:42,881 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse7 (select .cse6 4))) (and (= (select .cse6 0) 0) (<= .cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (<= (select .cse6 (* |c_ULTIMATE.start_foo_~i~1#1| 4)) |c_ULTIMATE.start_foo_#t~mem3#1|) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse7) (<= 2 (select .cse6 8)))))) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0))) is different from false [2022-07-21 17:23:42,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) .cse5) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse9)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse8))) (or (< v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse7) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse6 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse7 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse8)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse13 (select .cse10 4)) (.cse11 (select .cse10 8))) (and (= (select .cse10 0) 0) (<= .cse11 (select .cse12 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse13 (select .cse12 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse13) (<= 2 .cse11))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (+ (* (- 1) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse5) 0))) is different from false [2022-07-21 17:23:44,900 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) |c_ULTIMATE.start_foo_~#a~0#1.offset|) 0) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse7 (select .cse4 4)) (.cse5 (select .cse4 8))) (and (= (select .cse4 0) 0) (<= .cse5 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse7 (select .cse6 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse7) (<= 2 .cse5))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-21 17:23:46,905 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0)) is different from false [2022-07-21 17:23:48,694 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse8 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0))) is different from false [2022-07-21 17:23:50,701 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)) is different from false [2022-07-21 17:23:52,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse8 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-21 17:23:54,711 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (select .cse4 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse8)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse7))) (or (< v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse6) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse5 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse6 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse7)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-21 17:23:56,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (and (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|)) (.cse3 (select .cse0 4)) (.cse1 (select .cse0 8))) (and (= (select .cse0 0) 0) (<= .cse1 (select .cse2 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (<= .cse3 (select .cse2 4)) (<= 1 .cse3) (<= 2 .cse1))))) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse5 (store (select .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse6))) (or (< v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse5) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse4 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse5 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse6)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= 1 (+ (- 1) |c_ULTIMATE.start_bar_~i~0#1|)) (<= (select .cse8 (+ (- 4) (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|))) is different from false [2022-07-21 17:23:58,735 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_bar_~res~0#1|) (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_bar_#t~mem1#1|) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-21 17:24:00,741 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_bar_~res~0#1|)) is different from false [2022-07-21 17:24:02,642 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-21 17:24:04,650 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= 3 |c_ULTIMATE.start_bar_#res#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2022-07-21 17:24:06,654 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_foo_#t~ret4#1|)) is different from false