./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/list-ext-properties/test-0232_1-2.i -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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:46:50,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:46:50,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:46:51,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:46:51,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:46:51,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:46:51,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:46:51,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:46:51,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:46:51,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:46:51,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:46:51,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:46:51,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:46:51,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:46:51,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:46:51,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:46:51,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:46:51,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:46:51,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:46:51,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:46:51,044 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:46:51,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:46:51,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:46:51,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:46:51,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:46:51,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:46:51,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:46:51,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:46:51,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:46:51,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:46:51,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:46:51,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:46:51,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:46:51,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:46:51,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:46:51,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:46:51,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:46:51,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:46:51,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:46:51,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:46:51,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:46:51,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:46:51,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:46:51,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:46:51,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:46:51,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:46:51,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:46:51,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:46:51,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:46:51,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:46:51,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:46:51,094 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:46:51,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:46:51,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:46:51,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:46:51,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:46:51,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:46:51,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:46:51,096 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:46:51,097 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:46:51,097 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:46:51,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:46:51,097 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:46:51,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:46:51,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:46:51,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:46:51,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:46:51,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:46:51,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:46:51,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:46:51,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:46:51,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:46:51,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:46:51,099 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2022-07-12 18:46:51,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:46:51,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:46:51,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:46:51,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:46:51,334 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:46:51,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2022-07-12 18:46:51,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9600410/d3f806cada9e436083cd2df64fb30ce5/FLAGf617ab0b4 [2022-07-12 18:46:51,824 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:46:51,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2022-07-12 18:46:51,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9600410/d3f806cada9e436083cd2df64fb30ce5/FLAGf617ab0b4 [2022-07-12 18:46:51,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9600410/d3f806cada9e436083cd2df64fb30ce5 [2022-07-12 18:46:51,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:46:51,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:46:51,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:46:51,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:46:51,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:46:51,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:46:51" (1/1) ... [2022-07-12 18:46:51,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710d010c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:51, skipping insertion in model container [2022-07-12 18:46:51,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:46:51" (1/1) ... [2022-07-12 18:46:51,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:46:51,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:46:52,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:46:52,223 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:46:52,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:46:52,292 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:46:52,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52 WrapperNode [2022-07-12 18:46:52,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:46:52,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:46:52,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:46:52,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:46:52,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,333 INFO L137 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2022-07-12 18:46:52,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:46:52,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:46:52,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:46:52,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:46:52,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:46:52,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:46:52,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:46:52,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:46:52,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (1/1) ... [2022-07-12 18:46:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:46:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:46:52,404 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-12 18:46:52,412 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-12 18:46:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:46:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:46:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:46:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:46:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:46:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:46:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:46:52,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:46:52,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:46:52,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:46:52,519 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:46:52,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:46:52,793 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:46:52,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:46:52,799 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:46:52,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:46:52 BoogieIcfgContainer [2022-07-12 18:46:52,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:46:52,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:46:52,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:46:52,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:46:52,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:46:51" (1/3) ... [2022-07-12 18:46:52,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c583b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:46:52, skipping insertion in model container [2022-07-12 18:46:52,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:46:52" (2/3) ... [2022-07-12 18:46:52,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c583b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:46:52, skipping insertion in model container [2022-07-12 18:46:52,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:46:52" (3/3) ... [2022-07-12 18:46:52,809 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2022-07-12 18:46:52,826 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:46:52,827 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-12 18:46:52,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:46:52,875 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@52705524, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c74d067 [2022-07-12 18:46:52,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-12 18:46:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 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-12 18:46:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 18:46:52,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:52,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 18:46:52,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-07-12 18:46:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:52,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043176152] [2022-07-12 18:46:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:53,130 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-12 18:46:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043176152] [2022-07-12 18:46:53,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043176152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:53,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:53,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:46:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131200487] [2022-07-12 18:46:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:46:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:46:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:46:53,167 INFO L87 Difference]: Start difference. First operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12 18:46:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:53,304 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-07-12 18:46:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:46:53,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-12 18:46:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:53,313 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:46:53,313 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:46:53,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 18:46:53,317 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:53,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 69 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:46:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-07-12 18:46:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 0 states have call successors, (0), 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-12 18:46:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-07-12 18:46:53,347 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 4 [2022-07-12 18:46:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:53,348 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-07-12 18:46:53,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12 18:46:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-07-12 18:46:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 18:46:53,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:53,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 18:46:53,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:46:53,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-07-12 18:46:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:53,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773705555] [2022-07-12 18:46:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:53,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:53,415 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-12 18:46:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:53,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773705555] [2022-07-12 18:46:53,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773705555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:53,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:53,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:46:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094149156] [2022-07-12 18:46:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:46:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:46:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:46:53,419 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12 18:46:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:53,515 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-07-12 18:46:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:46:53,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-12 18:46:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:53,517 INFO L225 Difference]: With dead ends: 93 [2022-07-12 18:46:53,517 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 18:46:53,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 18:46:53,519 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 143 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:53,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 49 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 18:46:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2022-07-12 18:46:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 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-12 18:46:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-12 18:46:53,527 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 4 [2022-07-12 18:46:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:53,527 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-12 18:46:53,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12 18:46:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-12 18:46:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:46:53,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:53,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:46:53,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:46:53,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:53,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-07-12 18:46:53,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:53,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521626748] [2022-07-12 18:46:53,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:53,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:53,559 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-12 18:46:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:53,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521626748] [2022-07-12 18:46:53,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521626748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:53,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:53,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:46:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626412328] [2022-07-12 18:46:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:53,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:46:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:53,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:46:53,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:46:53,563 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-12 18:46:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:53,614 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-07-12 18:46:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:46:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-12 18:46:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:53,616 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:46:53,616 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:46:53,616 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-12 18:46:53,617 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:53,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:46:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:46:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2022-07-12 18:46:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 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-12 18:46:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-07-12 18:46:53,624 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2022-07-12 18:46:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:53,625 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-07-12 18:46:53,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-12 18:46:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-07-12 18:46:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:46:53,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:53,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:46:53,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:46:53,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-07-12 18:46:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:53,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987790270] [2022-07-12 18:46:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:53,676 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-12 18:46:53,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987790270] [2022-07-12 18:46:53,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987790270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:53,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:53,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:46:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485390296] [2022-07-12 18:46:53,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:53,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:46:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:53,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:46:53,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:46:53,679 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-12 18:46:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:53,717 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-12 18:46:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:46:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-12 18:46:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:53,718 INFO L225 Difference]: With dead ends: 76 [2022-07-12 18:46:53,719 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 18:46:53,719 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-12 18:46:53,720 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:53,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:46:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 18:46:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-12 18:46:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 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-12 18:46:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-07-12 18:46:53,726 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2022-07-12 18:46:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:53,726 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-07-12 18:46:53,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-12 18:46:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-07-12 18:46:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:46:53,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:53,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:46:53,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:46:53,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-07-12 18:46:53,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:53,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648274919] [2022-07-12 18:46:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:53,813 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-12 18:46:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648274919] [2022-07-12 18:46:53,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648274919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:53,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:53,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:46:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054517764] [2022-07-12 18:46:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:53,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:46:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:46:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:46:53,816 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 18:46:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:53,995 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-07-12 18:46:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:46:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 18:46:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:53,996 INFO L225 Difference]: With dead ends: 86 [2022-07-12 18:46:53,997 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:46:53,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:46:53,998 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:53,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 349 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:46:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-07-12 18:46:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 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-12 18:46:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-12 18:46:54,003 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 10 [2022-07-12 18:46:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:54,003 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-12 18:46:54,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 18:46:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-12 18:46:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:46:54,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:54,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:46:54,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:46:54,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053176, now seen corresponding path program 1 times [2022-07-12 18:46:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:54,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350123412] [2022-07-12 18:46:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:54,082 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-12 18:46:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:54,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350123412] [2022-07-12 18:46:54,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350123412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:54,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:46:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630189818] [2022-07-12 18:46:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:46:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:46:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:46:54,085 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:46:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:54,216 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-07-12 18:46:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:46:54,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:46:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:54,217 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:46:54,217 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:46:54,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-12 18:46:54,220 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 109 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:54,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 102 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:46:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-07-12 18:46:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 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-12 18:46:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-12 18:46:54,239 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 17 [2022-07-12 18:46:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:54,240 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-12 18:46:54,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:46:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-12 18:46:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:46:54,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:54,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:46:54,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:46:54,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053177, now seen corresponding path program 1 times [2022-07-12 18:46:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:54,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132683711] [2022-07-12 18:46:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:54,362 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-12 18:46:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132683711] [2022-07-12 18:46:54,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132683711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:54,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:54,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:46:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913477987] [2022-07-12 18:46:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:46:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:46:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:46:54,365 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:46:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:54,482 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-07-12 18:46:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:46:54,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:46:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:54,484 INFO L225 Difference]: With dead ends: 91 [2022-07-12 18:46:54,484 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:46:54,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:46:54,485 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:54,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 99 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:46:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-07-12 18:46:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 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-12 18:46:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-07-12 18:46:54,489 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2022-07-12 18:46:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:54,490 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-07-12 18:46:54,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:46:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-07-12 18:46:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:46:54,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:54,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:46:54,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:46:54,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2076126984, now seen corresponding path program 1 times [2022-07-12 18:46:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:54,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457869613] [2022-07-12 18:46:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:54,570 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-12 18:46:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457869613] [2022-07-12 18:46:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457869613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:54,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:54,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:46:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336416491] [2022-07-12 18:46:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:54,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:46:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:46:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:46:54,573 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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-12 18:46:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:54,585 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-07-12 18:46:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:46:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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-12 18:46:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:54,586 INFO L225 Difference]: With dead ends: 78 [2022-07-12 18:46:54,587 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 18:46:54,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:46:54,588 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:54,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:46:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 18:46:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-07-12 18:46:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 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-12 18:46:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-07-12 18:46:54,592 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 18 [2022-07-12 18:46:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:54,593 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-07-12 18:46:54,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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-12 18:46:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-07-12 18:46:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:46:54,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:54,594 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-12 18:46:54,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:46:54,594 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939784, now seen corresponding path program 1 times [2022-07-12 18:46:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:54,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639996961] [2022-07-12 18:46:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:54,776 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-12 18:46:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:54,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639996961] [2022-07-12 18:46:54,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639996961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:54,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:54,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:46:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764204553] [2022-07-12 18:46:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:46:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:46:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:46:54,781 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:54,924 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-07-12 18:46:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:46:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 18:46:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:54,925 INFO L225 Difference]: With dead ends: 73 [2022-07-12 18:46:54,925 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 18:46:54,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:46:54,926 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 154 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:54,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 142 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 18:46:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 18:46:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 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-12 18:46:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-07-12 18:46:54,929 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 20 [2022-07-12 18:46:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:54,929 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-07-12 18:46:54,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-07-12 18:46:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:46:54,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:54,930 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-12 18:46:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:46:54,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939783, now seen corresponding path program 1 times [2022-07-12 18:46:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:54,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420832197] [2022-07-12 18:46:54,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:54,989 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-12 18:46:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420832197] [2022-07-12 18:46:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420832197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:54,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:54,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:46:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248351503] [2022-07-12 18:46:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:46:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:46:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:46:54,992 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:55,058 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-07-12 18:46:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:46:55,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 18:46:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:55,059 INFO L225 Difference]: With dead ends: 72 [2022-07-12 18:46:55,059 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 18:46:55,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:46:55,061 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:55,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:46:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 18:46:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-12 18:46:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 0 states have call successors, (0), 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-12 18:46:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2022-07-12 18:46:55,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2022-07-12 18:46:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:55,072 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2022-07-12 18:46:55,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-07-12 18:46:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:46:55,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:55,073 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, 1] [2022-07-12 18:46:55,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:46:55,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1054427643, now seen corresponding path program 1 times [2022-07-12 18:46:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:55,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982273130] [2022-07-12 18:46:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:55,279 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-12 18:46:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:55,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982273130] [2022-07-12 18:46:55,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982273130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:55,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:55,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:46:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646979060] [2022-07-12 18:46:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:55,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:46:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:55,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:46:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:46:55,282 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:55,718 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-07-12 18:46:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:46:55,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:46:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:55,719 INFO L225 Difference]: With dead ends: 137 [2022-07-12 18:46:55,719 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 18:46:55,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:46:55,721 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 241 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:55,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 220 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:46:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 18:46:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2022-07-12 18:46:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 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-12 18:46:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-07-12 18:46:55,724 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2022-07-12 18:46:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:55,725 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-07-12 18:46:55,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-07-12 18:46:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:46:55,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:55,726 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, 1, 1] [2022-07-12 18:46:55,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:46:55,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1672481337, now seen corresponding path program 1 times [2022-07-12 18:46:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:55,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069826669] [2022-07-12 18:46:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:55,934 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-12 18:46:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:55,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069826669] [2022-07-12 18:46:55,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069826669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:46:55,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:46:55,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:46:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153089785] [2022-07-12 18:46:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:46:55,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:46:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:46:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:46:55,937 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:56,402 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-07-12 18:46:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:46:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 18:46:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:56,403 INFO L225 Difference]: With dead ends: 136 [2022-07-12 18:46:56,403 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 18:46:56,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:46:56,404 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 275 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:56,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 179 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:46:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 18:46:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 86. [2022-07-12 18:46:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 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-12 18:46:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-07-12 18:46:56,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2022-07-12 18:46:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:56,409 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-07-12 18:46:56,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:46:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-07-12 18:46:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:46:56,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:56,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:46:56,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:46:56,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2022-07-12 18:46:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:56,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994005859] [2022-07-12 18:46:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:46:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994005859] [2022-07-12 18:46:56,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994005859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:46:56,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267946964] [2022-07-12 18:46:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:56,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:46:56,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:46:56,551 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-12 18:46:56,580 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-12 18:46:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:56,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 18:46:56,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:46:56,827 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-12 18:46:56,886 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 18:46:56,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-12 18:46:56,964 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:46:56,965 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 33 treesize of output 24 [2022-07-12 18:46:57,042 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:46:57,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 16 [2022-07-12 18:46:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:46:57,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:46:57,173 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 38 treesize of output 34 [2022-07-12 18:46:57,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:46:57,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 255 [2022-07-12 18:46:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:46:57,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267946964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:46:57,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:46:57,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2022-07-12 18:46:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422309437] [2022-07-12 18:46:57,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:46:57,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:46:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:57,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:46:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:46:57,733 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:46:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:46:58,058 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2022-07-12 18:46:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:46:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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 22 [2022-07-12 18:46:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:46:58,060 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:46:58,060 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:46:58,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:46:58,061 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 225 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:46:58,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 371 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 194 Unchecked, 0.2s Time] [2022-07-12 18:46:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:46:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 94. [2022-07-12 18:46:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.375) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 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-12 18:46:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-12 18:46:58,064 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 22 [2022-07-12 18:46:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:46:58,064 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-12 18:46:58,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:46:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-12 18:46:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:46:58,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:46:58,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:46:58,092 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-12 18:46:58,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 18:46:58,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:46:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:46:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2022-07-12 18:46:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:46:58,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066948658] [2022-07-12 18:46:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:46:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:46:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:46:58,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066948658] [2022-07-12 18:46:58,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066948658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:46:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732012267] [2022-07-12 18:46:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:46:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:46:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:46:58,424 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-12 18:46:58,428 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-12 18:46:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:46:58,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 18:46:58,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:46:58,654 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-12 18:46:58,660 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-12 18:46:58,719 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:46:58,720 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 15 treesize of output 15 [2022-07-12 18:46:58,726 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 16 treesize of output 18 [2022-07-12 18:46:58,801 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:46:58,801 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 33 treesize of output 24 [2022-07-12 18:46:58,813 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:46:58,814 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-12 18:46:58,887 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:46:58,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 16 [2022-07-12 18:46:58,895 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:46:58,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 10 [2022-07-12 18:46:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:46:58,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:46:59,146 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 32 treesize of output 28 [2022-07-12 18:46:59,160 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 66 treesize of output 62 [2022-07-12 18:46:59,163 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 102 treesize of output 94 [2022-07-12 18:46:59,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:46:59,409 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 85 treesize of output 87 [2022-07-12 18:46:59,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:46:59,434 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 93 treesize of output 133 [2022-07-12 18:46:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:46:59,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732012267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:46:59,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:46:59,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-07-12 18:46:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890791330] [2022-07-12 18:46:59,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:46:59,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:46:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:46:59,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:46:59,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:46:59,541 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 18:47:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:00,254 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2022-07-12 18:47:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:47:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 22 [2022-07-12 18:47:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:00,256 INFO L225 Difference]: With dead ends: 217 [2022-07-12 18:47:00,256 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 18:47:00,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:47:00,257 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 400 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:00,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 764 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 488 Invalid, 0 Unknown, 286 Unchecked, 0.3s Time] [2022-07-12 18:47:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 18:47:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 94. [2022-07-12 18:47:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 93 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-12 18:47:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-12 18:47:00,260 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 22 [2022-07-12 18:47:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:00,260 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-12 18:47:00,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 18:47:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-12 18:47:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:47:00,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:00,261 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, 1, 1, 1] [2022-07-12 18:47:00,289 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-12 18:47:00,461 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,SelfDestructingSolverStorable13 [2022-07-12 18:47:00,462 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -307313795, now seen corresponding path program 1 times [2022-07-12 18:47:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:00,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593111691] [2022-07-12 18:47:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:00,621 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-12 18:47:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:00,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593111691] [2022-07-12 18:47:00,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593111691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:00,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:00,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:47:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251515635] [2022-07-12 18:47:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:00,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:47:00,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:00,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:47:00,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:47:00,623 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:01,003 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-07-12 18:47:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:47:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:47:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:01,004 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:47:01,004 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:47:01,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:47:01,005 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 172 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:01,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 210 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:47:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-07-12 18:47:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.356164383561644) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 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-12 18:47:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2022-07-12 18:47:01,008 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 23 [2022-07-12 18:47:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:01,008 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2022-07-12 18:47:01,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2022-07-12 18:47:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:01,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:01,009 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, 1, 1, 1, 1] [2022-07-12 18:47:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:47:01,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -936792950, now seen corresponding path program 1 times [2022-07-12 18:47:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405940] [2022-07-12 18:47:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:01,122 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-12 18:47:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:01,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405940] [2022-07-12 18:47:01,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:01,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:01,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:47:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648220683] [2022-07-12 18:47:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:01,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:01,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:01,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:01,125 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-12 18:47:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:01,212 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-12 18:47:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-12 18:47:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:01,213 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:47:01,213 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:47:01,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:47:01,214 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 114 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:01,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 51 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:47:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-12 18:47:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 93 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-12 18:47:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-12 18:47:01,216 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 24 [2022-07-12 18:47:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:01,216 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-12 18:47:01,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-12 18:47:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-12 18:47:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:01,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:01,217 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, 1, 1, 1, 1] [2022-07-12 18:47:01,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:47:01,217 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -936792949, now seen corresponding path program 1 times [2022-07-12 18:47:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:01,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008390524] [2022-07-12 18:47:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:01,267 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-12 18:47:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:01,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008390524] [2022-07-12 18:47:01,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008390524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:01,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:01,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:01,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125196986] [2022-07-12 18:47:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:01,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:01,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:01,270 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12 18:47:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:01,306 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-07-12 18:47:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-12 18:47:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:01,308 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:47:01,308 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:47:01,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12 18:47:01,309 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:01,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:47:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-12 18:47:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 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-12 18:47:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-07-12 18:47:01,311 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 24 [2022-07-12 18:47:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:01,312 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-07-12 18:47:01,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12 18:47:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-07-12 18:47:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:47:01,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:01,312 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, 1, 1, 1, 1, 1] [2022-07-12 18:47:01,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:47:01,313 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1024189665, now seen corresponding path program 1 times [2022-07-12 18:47:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:01,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348527424] [2022-07-12 18:47:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:01,352 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-12 18:47:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348527424] [2022-07-12 18:47:01,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348527424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:01,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:01,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:01,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889416584] [2022-07-12 18:47:01,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:01,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:01,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:01,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:01,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:01,354 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:01,411 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-07-12 18:47:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 18:47:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:01,412 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:47:01,412 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 18:47:01,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12 18:47:01,413 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:01,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 101 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 18:47:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-12 18:47:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 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-12 18:47:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-07-12 18:47:01,416 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 25 [2022-07-12 18:47:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:01,416 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-07-12 18:47:01,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-07-12 18:47:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:47:01,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:01,417 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:47:01,417 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1685108650, now seen corresponding path program 1 times [2022-07-12 18:47:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:01,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846517597] [2022-07-12 18:47:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:01,460 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-12 18:47:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:01,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846517597] [2022-07-12 18:47:01,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846517597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:01,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:01,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668306005] [2022-07-12 18:47:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:01,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:01,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:01,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:01,462 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12 18:47:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:01,537 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-07-12 18:47:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-12 18:47:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:01,538 INFO L225 Difference]: With dead ends: 87 [2022-07-12 18:47:01,538 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 18:47:01,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12 18:47:01,539 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:01,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 83 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 18:47:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-12 18:47:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 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-12 18:47:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-07-12 18:47:01,542 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 26 [2022-07-12 18:47:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:01,543 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-07-12 18:47:01,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12 18:47:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-07-12 18:47:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:47:01,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:01,544 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 18:47:01,545 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash 698760707, now seen corresponding path program 1 times [2022-07-12 18:47:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:01,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993246448] [2022-07-12 18:47:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:01,785 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-12 18:47:01,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:01,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993246448] [2022-07-12 18:47:01,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993246448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:01,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:01,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:47:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114800876] [2022-07-12 18:47:01,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:01,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:47:01,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:47:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:47:01,786 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 18:47:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:02,261 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-07-12 18:47:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:47:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 18:47:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:02,262 INFO L225 Difference]: With dead ends: 91 [2022-07-12 18:47:02,262 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:47:02,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:47:02,263 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 166 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:02,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 187 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:47:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-12 18:47:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 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-12 18:47:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-07-12 18:47:02,266 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 27 [2022-07-12 18:47:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:02,266 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-07-12 18:47:02,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 18:47:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-07-12 18:47:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:47:02,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:02,266 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:02,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 18:47:02,267 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash 186745549, now seen corresponding path program 1 times [2022-07-12 18:47:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:02,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442676417] [2022-07-12 18:47:02,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:02,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:02,322 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-12 18:47:02,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:02,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442676417] [2022-07-12 18:47:02,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442676417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:02,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:02,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:47:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859081261] [2022-07-12 18:47:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:02,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:02,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:02,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:02,325 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:02,430 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-12 18:47:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 18:47:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:02,431 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:47:02,432 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:47:02,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:47:02,432 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 104 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:02,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 68 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:47:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-12 18:47:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 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-12 18:47:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-12 18:47:02,436 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 28 [2022-07-12 18:47:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:02,436 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-12 18:47:02,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-12 18:47:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:47:02,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:02,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:02,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:47:02,437 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash -973971529, now seen corresponding path program 1 times [2022-07-12 18:47:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:02,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490913489] [2022-07-12 18:47:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:02,993 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-12 18:47:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:02,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490913489] [2022-07-12 18:47:02,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490913489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:02,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:02,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 18:47:02,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196441161] [2022-07-12 18:47:02,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:02,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:47:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:02,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:47:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:47:02,995 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:03,686 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-12 18:47:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:47:03,689 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:47:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:03,689 INFO L225 Difference]: With dead ends: 127 [2022-07-12 18:47:03,689 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 18:47:03,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:47:03,690 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:03,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 345 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:47:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 18:47:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2022-07-12 18:47:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.1818181818181819) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 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-12 18:47:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-07-12 18:47:03,693 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 32 [2022-07-12 18:47:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:03,693 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-07-12 18:47:03,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-07-12 18:47:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:47:03,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:03,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:03,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:47:03,694 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash -973970341, now seen corresponding path program 1 times [2022-07-12 18:47:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:03,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913154377] [2022-07-12 18:47:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:03,729 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-12 18:47:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913154377] [2022-07-12 18:47:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913154377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:03,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:03,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:47:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937645401] [2022-07-12 18:47:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:03,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:03,732 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:03,743 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-12 18:47:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:47:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:03,745 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:47:03,745 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:47:03,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:03,746 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:03,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 187 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:47:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2022-07-12 18:47:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 95 states have internal predecessors, (100), 0 states have call successors, (0), 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-12 18:47:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-07-12 18:47:03,749 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 32 [2022-07-12 18:47:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:03,749 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-07-12 18:47:03,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-07-12 18:47:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:47:03,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:03,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:03,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 18:47:03,751 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:47:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1880889347, now seen corresponding path program 1 times [2022-07-12 18:47:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:03,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071476158] [2022-07-12 18:47:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:47:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:04,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071476158] [2022-07-12 18:47:04,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071476158] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:04,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190234415] [2022-07-12 18:47:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:04,103 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-12 18:47:04,135 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-12 18:47:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:04,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 18:47:04,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:04,241 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-12 18:47:04,264 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:47:04,264 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-12 18:47:04,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:47:04,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 18:47:04,423 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 23 treesize of output 22 [2022-07-12 18:47:04,505 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 18:47:04,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 18:47:04,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-12 18:47:04,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-12 18:47:04,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 46 treesize of output 22 [2022-07-12 18:47:04,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:04,958 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:47:04,959 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-07-12 18:47:05,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12 18:47:05,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:05,069 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:47:05,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2022-07-12 18:47:05,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 52 treesize of output 32 [2022-07-12 18:47:05,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:05,453 INFO L356 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-07-12 18:47:05,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 27 [2022-07-12 18:47:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:05,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:05,606 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 80 treesize of output 76 [2022-07-12 18:47:35,892 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 879 treesize of output 863 [2022-07-12 18:47:39,038 WARN L855 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_append_~plist#1.base|) 1)) (let ((.cse23 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse25 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (let ((.cse24 (forall ((v_ArrVal_679 Int)) (or (< v_ArrVal_679 0) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_16| Int)) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse59 (let ((.cse61 (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse62 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse64 (select (select .cse62 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse63 (store (select .cse62 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse64))) (store .cse63 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse62 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse63) v_arrayElimCell_59) (+ 4 .cse64))))))))) (store .cse61 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse60 (+ v_ArrVal_679 4))) (or (= (select (select .cse59 v_arrayElimCell_58) .cse60) 0) (= (select (select .cse59 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse60) 0))))))))))) (.cse26 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int) (v_ArrVal_679 Int)) (let ((.cse53 (let ((.cse55 (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse56 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse58 (select (select .cse56 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse57 (store (select .cse56 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse58))) (store .cse57 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse56 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse57) v_arrayElimCell_59) (+ 4 .cse58))))))))) (store .cse55 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse54 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select .cse53 v_arrayElimCell_58) .cse54) 0) (= (select (select .cse53 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse54) 0))))) (.cse27 (forall ((v_ArrVal_679 Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_16| Int)) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (forall ((v_arrayElimCell_59 Int)) (= (select (select (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse46 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse48 (select (select .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse47 (store (select .cse46 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse48))) (store .cse47 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse46 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse47) v_arrayElimCell_59) (+ 4 .cse48))))))))) (store .cse45 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) (+ v_ArrVal_679 4)) 0)) (forall ((v_arrayElimCell_58 Int)) (= (select (select (let ((.cse49 (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse50 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse52 (select (select .cse50 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse51 (store (select .cse50 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse52))) (store .cse51 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse50 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse51) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 .cse52))))))))) (store .cse49 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) v_arrayElimCell_58) (+ v_ArrVal_679 4)) 0)))) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)))) (< v_ArrVal_679 0)))) (.cse28 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int) (v_ArrVal_679 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (let ((.cse44 (select (select .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse37 (store (select .cse36 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse44))) (let ((.cse38 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4)) (.cse39 (store .cse36 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse37)) (.cse40 (+ 4 .cse44))) (let ((.cse42 (let ((.cse43 (store .cse36 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse37 .cse38 (select (select .cse39 v_arrayElimCell_59) .cse40))))) (store .cse43 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse41 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (= (select (select (let ((.cse35 (store .cse36 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse37 .cse38 (select (select .cse39 |c_ULTIMATE.start_append_~item~0#1.base|) .cse40))))) (store .cse35 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse41) 0) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select .cse42 v_arrayElimCell_58) .cse41) 0) (= (select (select .cse42 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse41) 0))))))))) (.cse9 (not .cse25)) (.cse10 (not .cse23))) (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int) (v_ArrVal_679 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (let ((.cse8 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (let ((.cse3 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4)) (.cse4 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse2)) (.cse5 (+ 4 .cse8)) (.cse6 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (= (select (select (let ((.cse0 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse2 .cse3 (select (select .cse4 |c_ULTIMATE.start_append_~item~0#1.base|) .cse5))))) (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse6) 0) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select (let ((.cse7 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse2 .cse3 (select (select .cse4 v_arrayElimCell_59) .cse5))))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) v_arrayElimCell_58) .cse6) 0))))))) .cse9 .cse10) (forall ((v_ArrVal_679 Int)) (or (< v_ArrVal_679 0) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_16| Int)) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int)) (or (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse12 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse14 (select (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse13 (store (select .cse12 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse14))) (store .cse13 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse12 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse13) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 .cse14))))))))) (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) (+ v_ArrVal_679 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (forall ((v_arrayElimCell_59 Int)) (= (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse16 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse17 (store (select .cse16 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse18))) (store .cse17 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse16 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse17) v_arrayElimCell_59) (+ 4 .cse18))))))))) (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) (+ v_ArrVal_679 4)) 0)) (forall ((v_arrayElimCell_58 Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse20 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse21 (store (select .cse20 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse22))) (store .cse21 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse20 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse21) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 .cse22))))))))) (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) v_arrayElimCell_58) (+ v_ArrVal_679 4)) 0)))) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)))))) (or .cse23 (and .cse24 (or .cse25 .cse26) .cse27)) (or .cse28 .cse23) (or (and .cse24 (or .cse26 .cse23) .cse27) .cse25) (or .cse25 .cse28) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_ArrVal_679 Int)) (let ((.cse29 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (store .cse32 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse34 (select (select .cse32 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse33 (store (select .cse32 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse34))) (store .cse33 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse32 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse33) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 .cse34))))))))) (store .cse31 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse30 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (= (select (select .cse29 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse30) 0) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select .cse29 v_arrayElimCell_58) .cse30) 0)))) .cse9 .cse10))))) is different from true [2022-07-12 18:47:39,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:39,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:39,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:39,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:39,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:39,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:39,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:47:39,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3511 treesize of output 3418 [2022-07-12 18:47:41,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:41,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:41,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:41,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:41,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:47:41,263 INFO L356 Elim1Store]: treesize reduction 47, result has 73.9 percent of original size [2022-07-12 18:47:41,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 58767 treesize of output 55411