./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0504_1.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-0504_1.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 ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:47:17,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:47:17,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:47:17,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:47:17,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:47:17,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:47:17,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:47:17,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:47:17,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:47:17,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:47:17,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:47:17,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:47:17,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:47:17,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:47:17,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:47:17,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:47:17,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:47:17,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:47:17,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:47:17,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:47:17,253 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:47:17,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:47:17,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:47:17,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:47:17,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:47:17,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:47:17,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:47:17,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:47:17,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:47:17,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:47:17,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:47:17,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:47:17,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:47:17,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:47:17,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:47:17,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:47:17,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:47:17,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:47:17,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:47:17,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:47:17,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:47:17,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:47:17,265 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:47:17,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:47:17,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:47:17,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:47:17,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:47:17,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:47:17,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:47:17,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:47:17,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:47:17,290 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:47:17,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:47:17,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:47:17,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:47:17,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:47:17,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:47:17,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:47:17,291 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:47:17,292 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:47:17,292 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:47:17,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:47:17,292 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:47:17,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:47:17,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:47:17,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:47:17,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:47:17,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:47:17,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:47:17,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:47:17,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:47:17,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:47:17,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:47:17,294 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 -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2022-07-12 18:47:17,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:47:17,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:47:17,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:47:17,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:47:17,483 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:47:17,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2022-07-12 18:47:17,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8c04b54/b984350b75af4152b5fe2fe83ce182f0/FLAG1b2dbf12e [2022-07-12 18:47:17,882 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:47:17,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2022-07-12 18:47:17,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8c04b54/b984350b75af4152b5fe2fe83ce182f0/FLAG1b2dbf12e [2022-07-12 18:47:17,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8c04b54/b984350b75af4152b5fe2fe83ce182f0 [2022-07-12 18:47:17,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:47:17,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:47:17,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:47:17,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:47:17,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:47:17,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:47:17" (1/1) ... [2022-07-12 18:47:17,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147f3f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:17, skipping insertion in model container [2022-07-12 18:47:17,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:47:17" (1/1) ... [2022-07-12 18:47:17,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:47:17,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:47:18,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:47:18,207 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:47:18,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:47:18,260 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:47:18,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18 WrapperNode [2022-07-12 18:47:18,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:47:18,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:47:18,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:47:18,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:47:18,268 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:47:18" (1/1) ... [2022-07-12 18:47:18,293 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:47:18" (1/1) ... [2022-07-12 18:47:18,320 INFO L137 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2022-07-12 18:47:18,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:47:18,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:47:18,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:47:18,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:47:18,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:47:18,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:47:18,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:47:18,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:47:18,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (1/1) ... [2022-07-12 18:47:18,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:47:18,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:18,392 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:47:18,408 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:47:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:47:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:47:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:47:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:47:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:47:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:47:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:47:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:47:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:47:18,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:47:18,515 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:47:18,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:47:18,757 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:47:18,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:47:18,763 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 18:47:18,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:47:18 BoogieIcfgContainer [2022-07-12 18:47:18,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:47:18,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:47:18,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:47:18,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:47:18,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:47:17" (1/3) ... [2022-07-12 18:47:18,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c22caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:47:18, skipping insertion in model container [2022-07-12 18:47:18,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:18" (2/3) ... [2022-07-12 18:47:18,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c22caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:47:18, skipping insertion in model container [2022-07-12 18:47:18,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:47:18" (3/3) ... [2022-07-12 18:47:18,773 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2022-07-12 18:47:18,783 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:47:18,784 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-07-12 18:47:18,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:47:18,837 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@3d883bda, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e3e935a [2022-07-12 18:47:18,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2022-07-12 18:47:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 50 states have (on average 2.14) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:47:18,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:18,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:47:18,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 28793288, now seen corresponding path program 1 times [2022-07-12 18:47:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:18,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917115092] [2022-07-12 18:47:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:18,956 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:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:18,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917115092] [2022-07-12 18:47:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917115092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:18,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:18,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410375244] [2022-07-12 18:47:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:18,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:47:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:18,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:47:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:47:18,984 INFO L87 Difference]: Start difference. First operand has 94 states, 50 states have (on average 2.14) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:47:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,004 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-12 18:47:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:47:19,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:47:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,012 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:47:19,013 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 18:47:19,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:47:19,018 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 18:47:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-12 18:47:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.020408163265306) internal successors, (99), 91 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:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-07-12 18:47:19,059 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 5 [2022-07-12 18:47:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,060 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-07-12 18:47:19,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:47:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-07-12 18:47:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:47:19,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1806850220, now seen corresponding path program 1 times [2022-07-12 18:47:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112869536] [2022-07-12 18:47:19,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,125 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:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112869536] [2022-07-12 18:47:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112869536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93436199] [2022-07-12 18:47:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,132 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,163 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-07-12 18:47:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 18:47:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,165 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:47:19,165 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:47:19,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:47:19,167 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:47:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-07-12 18:47:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 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:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-07-12 18:47:19,179 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 7 [2022-07-12 18:47:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,180 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-07-12 18:47:19,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-07-12 18:47:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:47:19,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2022-07-12 18:47:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480015467] [2022-07-12 18:47:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,243 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:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480015467] [2022-07-12 18:47:19,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480015467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667501264] [2022-07-12 18:47:19,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,246 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,335 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-07-12 18:47:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 18:47:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,340 INFO L225 Difference]: With dead ends: 121 [2022-07-12 18:47:19,340 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 18:47:19,340 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:47:19,346 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 18:47:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2022-07-12 18:47:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.830188679245283) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 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:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-12 18:47:19,355 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 7 [2022-07-12 18:47:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,355 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-12 18:47:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-12 18:47:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:47:19,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:47:19,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2022-07-12 18:47:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183565035] [2022-07-12 18:47:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,399 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:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183565035] [2022-07-12 18:47:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183565035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135473780] [2022-07-12 18:47:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,401 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,476 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2022-07-12 18:47:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 18:47:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,478 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:47:19,478 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 18:47:19,478 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:47:19,482 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 18:47:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 90. [2022-07-12 18:47:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 89 states have internal predecessors, (104), 0 states have call successors, (0), 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:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-07-12 18:47:19,487 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 7 [2022-07-12 18:47:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,487 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-07-12 18:47:19,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-07-12 18:47:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:47:19,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:19,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:47:19,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 177781672, now seen corresponding path program 1 times [2022-07-12 18:47:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061507287] [2022-07-12 18:47:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,504 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:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061507287] [2022-07-12 18:47:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061507287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356999903] [2022-07-12 18:47:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,506 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,544 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2022-07-12 18:47:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:47:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,545 INFO L225 Difference]: With dead ends: 92 [2022-07-12 18:47:19,546 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:47:19,546 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:47:19,547 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:47:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-12 18:47:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.728813559322034) internal successors, (102), 88 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2022-07-12 18:47:19,550 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 8 [2022-07-12 18:47:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,551 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2022-07-12 18:47:19,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2022-07-12 18:47:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:47:19,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,552 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:47:19,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:47:19,552 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash 875833349, now seen corresponding path program 1 times [2022-07-12 18:47:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572673061] [2022-07-12 18:47:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,652 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:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572673061] [2022-07-12 18:47:19,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572673061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17114796] [2022-07-12 18:47:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:19,655 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:47:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,740 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-07-12 18:47:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:19,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:47:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,741 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:47:19,741 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 18:47:19,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:19,742 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 180 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 90 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 18:47:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2022-07-12 18:47:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 78 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:47:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-12 18:47:19,745 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 17 [2022-07-12 18:47:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,746 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-12 18:47:19,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:47:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-12 18:47:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:47:19,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,746 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:47:19,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:47:19,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1380999357, now seen corresponding path program 1 times [2022-07-12 18:47:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701447490] [2022-07-12 18:47:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,814 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:19,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701447490] [2022-07-12 18:47:19,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701447490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317983317] [2022-07-12 18:47:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,815 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:47:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,822 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-07-12 18:47:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:47:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,823 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:47:19,824 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 18:47:19,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:47:19,825 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 18:47:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2022-07-12 18:47:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 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:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2022-07-12 18:47:19,833 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 18 [2022-07-12 18:47:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,833 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2022-07-12 18:47:19,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:47:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2022-07-12 18:47:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:47:19,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,834 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:47:19,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:47:19,835 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1381030048, now seen corresponding path program 1 times [2022-07-12 18:47:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103577059] [2022-07-12 18:47:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,885 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:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103577059] [2022-07-12 18:47:19,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103577059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126351092] [2022-07-12 18:47:19,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,887 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:47:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:19,926 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-07-12 18:47:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:19,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:47:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:19,927 INFO L225 Difference]: With dead ends: 98 [2022-07-12 18:47:19,927 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 18:47:19,928 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:47:19,928 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:19,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 18:47:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 18:47:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.52) internal successors, (114), 97 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2022-07-12 18:47:19,931 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 18 [2022-07-12 18:47:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:19,932 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2022-07-12 18:47:19,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:47:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-07-12 18:47:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:47:19,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:19,933 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:47:19,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:47:19,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1381030049, now seen corresponding path program 1 times [2022-07-12 18:47:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:19,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565679170] [2022-07-12 18:47:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:19,969 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:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:19,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565679170] [2022-07-12 18:47:19,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565679170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:19,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:19,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018873865] [2022-07-12 18:47:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:19,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:19,971 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:47:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,002 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-07-12 18:47:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:47:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,003 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:47:20,003 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:47:20,004 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:47:20,004 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:47:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-12 18:47:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 93 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-07-12 18:47:20,008 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 18 [2022-07-12 18:47:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,009 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-07-12 18:47:20,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:47:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-07-12 18:47:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:47:20,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,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] [2022-07-12 18:47:20,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:47:20,010 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 774470346, now seen corresponding path program 1 times [2022-07-12 18:47:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384945984] [2022-07-12 18:47:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,073 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:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384945984] [2022-07-12 18:47:20,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384945984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:47:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416941798] [2022-07-12 18:47:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:20,076 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:47:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,184 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2022-07-12 18:47:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:20,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:47:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,186 INFO L225 Difference]: With dead ends: 168 [2022-07-12 18:47:20,186 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 18:47:20,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:47:20,187 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 235 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 18:47:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 112. [2022-07-12 18:47:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2022-07-12 18:47:20,190 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 21 [2022-07-12 18:47:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,190 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2022-07-12 18:47:20,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:47:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2022-07-12 18:47:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:47:20,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,191 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:47:20,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:47:20,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash 774470347, now seen corresponding path program 1 times [2022-07-12 18:47:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192352452] [2022-07-12 18:47:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,339 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:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192352452] [2022-07-12 18:47:20,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192352452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:47:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460654226] [2022-07-12 18:47:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:47:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:47:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:47:20,342 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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:47:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,622 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2022-07-12 18:47:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:47:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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:47:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,623 INFO L225 Difference]: With dead ends: 198 [2022-07-12 18:47:20,623 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 18:47:20,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:47:20,624 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 292 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 246 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 18:47:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 112. [2022-07-12 18:47:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 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:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2022-07-12 18:47:20,626 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 21 [2022-07-12 18:47:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,627 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-07-12 18:47:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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:47:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2022-07-12 18:47:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:47:20,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:47:20,627 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -181494867, now seen corresponding path program 1 times [2022-07-12 18:47:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876732240] [2022-07-12 18:47:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876732240] [2022-07-12 18:47:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876732240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723080434] [2022-07-12 18:47:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:20,680 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:47:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,764 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2022-07-12 18:47:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:47:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,765 INFO L225 Difference]: With dead ends: 146 [2022-07-12 18:47:20,765 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:47:20,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:20,766 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 95 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 112 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:47:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2022-07-12 18:47:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 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:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2022-07-12 18:47:20,770 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 22 [2022-07-12 18:47:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,770 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2022-07-12 18:47:20,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:47:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2022-07-12 18:47:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:47:20,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:47:20,773 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -181494866, now seen corresponding path program 1 times [2022-07-12 18:47:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525060481] [2022-07-12 18:47:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525060481] [2022-07-12 18:47:20,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525060481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:20,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:20,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015077682] [2022-07-12 18:47:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:20,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:20,830 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:47:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:20,923 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2022-07-12 18:47:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:47:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:20,925 INFO L225 Difference]: With dead ends: 187 [2022-07-12 18:47:20,925 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 18:47:20,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:20,926 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 86 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:20,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 151 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 18:47:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 138. [2022-07-12 18:47:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 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:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2022-07-12 18:47:20,932 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 22 [2022-07-12 18:47:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:20,932 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2022-07-12 18:47:20,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:47:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2022-07-12 18:47:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:47:20,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:20,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:47:20,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1331373881, now seen corresponding path program 1 times [2022-07-12 18:47:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:20,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633292827] [2022-07-12 18:47:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:20,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633292827] [2022-07-12 18:47:20,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633292827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:20,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681427904] [2022-07-12 18:47:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:20,988 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:47:20,994 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:47:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:47:21,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:21,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681427904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:47:21,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-07-12 18:47:21,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64702312] [2022-07-12 18:47:21,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:21,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:21,124 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:21,136 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2022-07-12 18:47:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:21,137 INFO L225 Difference]: With dead ends: 138 [2022-07-12 18:47:21,137 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 18:47:21,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:47:21,156 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:21,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 18:47:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-12 18:47:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 137 states have internal predecessors, (163), 0 states have call successors, (0), 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:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2022-07-12 18:47:21,158 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 23 [2022-07-12 18:47:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:21,159 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2022-07-12 18:47:21,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2022-07-12 18:47:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:21,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:21,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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:21,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:47:21,364 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,SelfDestructingSolverStorable13 [2022-07-12 18:47:21,365 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1677094766, now seen corresponding path program 1 times [2022-07-12 18:47:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:21,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4227989] [2022-07-12 18:47:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4227989] [2022-07-12 18:47:21,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4227989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153854373] [2022-07-12 18:47:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:21,394 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:21,520 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2022-07-12 18:47:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:21,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:21,521 INFO L225 Difference]: With dead ends: 185 [2022-07-12 18:47:21,522 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 18:47:21,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:21,522 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 133 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:21,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 162 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 18:47:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2022-07-12 18:47:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 147 states have internal predecessors, (182), 0 states have call successors, (0), 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:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 182 transitions. [2022-07-12 18:47:21,525 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 182 transitions. Word has length 24 [2022-07-12 18:47:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:21,525 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 182 transitions. [2022-07-12 18:47:21,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2022-07-12 18:47:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:47:21,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:21,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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:21,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:47:21,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1677094767, now seen corresponding path program 1 times [2022-07-12 18:47:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:21,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566791046] [2022-07-12 18:47:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566791046] [2022-07-12 18:47:21,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566791046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688084526] [2022-07-12 18:47:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:21,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:21,563 INFO L87 Difference]: Start difference. First operand 148 states and 182 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:21,694 INFO L93 Difference]: Finished difference Result 238 states and 293 transitions. [2022-07-12 18:47:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:21,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:21,696 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:47:21,696 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:47:21,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:21,697 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 136 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:21,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 180 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:47:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 166. [2022-07-12 18:47:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 165 states have internal predecessors, (215), 0 states have call successors, (0), 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:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2022-07-12 18:47:21,700 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 24 [2022-07-12 18:47:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:21,701 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2022-07-12 18:47:21,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2022-07-12 18:47:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:47:21,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:21,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:47:21,702 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1024288817, now seen corresponding path program 1 times [2022-07-12 18:47:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268951373] [2022-07-12 18:47:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268951373] [2022-07-12 18:47:21,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268951373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:47:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323824938] [2022-07-12 18:47:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:21,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:47:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:21,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:47:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:47:21,800 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:21,952 INFO L93 Difference]: Finished difference Result 238 states and 303 transitions. [2022-07-12 18:47:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:47:21,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:21,953 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:47:21,953 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:47:21,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:47:21,953 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 106 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:21,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 310 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:47:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 175. [2022-07-12 18:47:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 156 states have (on average 1.4487179487179487) internal successors, (226), 174 states have internal predecessors, (226), 0 states have call successors, (0), 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:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 226 transitions. [2022-07-12 18:47:21,956 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 226 transitions. Word has length 27 [2022-07-12 18:47:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:21,957 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 226 transitions. [2022-07-12 18:47:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 226 transitions. [2022-07-12 18:47:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:47:21,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:21,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:21,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:47:21,957 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1688183339, now seen corresponding path program 1 times [2022-07-12 18:47:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591899351] [2022-07-12 18:47:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:21,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591899351] [2022-07-12 18:47:21,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591899351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:21,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:21,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747108511] [2022-07-12 18:47:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:22,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:22,001 INFO L87 Difference]: Start difference. First operand 175 states and 226 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:22,091 INFO L93 Difference]: Finished difference Result 205 states and 261 transitions. [2022-07-12 18:47:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:22,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:22,092 INFO L225 Difference]: With dead ends: 205 [2022-07-12 18:47:22,092 INFO L226 Difference]: Without dead ends: 205 [2022-07-12 18:47:22,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:22,093 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 130 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:22,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 203 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-12 18:47:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2022-07-12 18:47:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 174 states have (on average 1.5) internal successors, (261), 192 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 261 transitions. [2022-07-12 18:47:22,096 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 261 transitions. Word has length 28 [2022-07-12 18:47:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:22,097 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 261 transitions. [2022-07-12 18:47:22,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 261 transitions. [2022-07-12 18:47:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:47:22,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:22,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:22,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:47:22,099 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:22,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1397370251, now seen corresponding path program 1 times [2022-07-12 18:47:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:22,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252623670] [2022-07-12 18:47:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252623670] [2022-07-12 18:47:22,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252623670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111265496] [2022-07-12 18:47:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:22,142 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:47:22,143 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:47:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:47:22,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111265496] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:22,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:47:22,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-07-12 18:47:22,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717829828] [2022-07-12 18:47:22,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:22,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:22,297 INFO L87 Difference]: Start difference. First operand 193 states and 261 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:22,314 INFO L93 Difference]: Finished difference Result 247 states and 325 transitions. [2022-07-12 18:47:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 18:47:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:22,315 INFO L225 Difference]: With dead ends: 247 [2022-07-12 18:47:22,315 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 18:47:22,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 1 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:22,316 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 50 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:22,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 269 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 18:47:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2022-07-12 18:47:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 212 states have (on average 1.5235849056603774) internal successors, (323), 230 states have internal predecessors, (323), 0 states have call successors, (0), 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:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2022-07-12 18:47:22,320 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 31 [2022-07-12 18:47:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:22,320 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2022-07-12 18:47:22,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2022-07-12 18:47:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:47:22,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:22,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:22,340 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:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:22,532 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 368804521, now seen corresponding path program 1 times [2022-07-12 18:47:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:22,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704812668] [2022-07-12 18:47:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:22,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704812668] [2022-07-12 18:47:22,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704812668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:22,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648511949] [2022-07-12 18:47:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:22,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:22,590 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:22,592 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:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:22,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:47:22,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:22,751 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 13 treesize of output 9 [2022-07-12 18:47:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:22,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648511949] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:22,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:47:22,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2022-07-12 18:47:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405124656] [2022-07-12 18:47:22,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:22,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:22,842 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:22,948 INFO L93 Difference]: Finished difference Result 236 states and 327 transitions. [2022-07-12 18:47:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:22,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:22,950 INFO L225 Difference]: With dead ends: 236 [2022-07-12 18:47:22,950 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 18:47:22,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:47:22,951 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:22,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 213 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-07-12 18:47:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 18:47:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-07-12 18:47:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 205 states have (on average 1.5365853658536586) internal successors, (315), 223 states have internal predecessors, (315), 0 states have call successors, (0), 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:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 315 transitions. [2022-07-12 18:47:22,959 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 315 transitions. Word has length 32 [2022-07-12 18:47:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:22,959 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 315 transitions. [2022-07-12 18:47:22,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 315 transitions. [2022-07-12 18:47:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:47:22,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:22,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 18:47:22,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:23,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:23,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash -917642468, now seen corresponding path program 1 times [2022-07-12 18:47:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:23,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789302327] [2022-07-12 18:47:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:23,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789302327] [2022-07-12 18:47:23,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789302327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115919554] [2022-07-12 18:47:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:23,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:23,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:23,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:23,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:47:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:23,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:47:23,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:23,336 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:23,376 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:47:23,376 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 17 treesize of output 21 [2022-07-12 18:47:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:23,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:23,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115919554] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:23,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:47:23,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-12 18:47:23,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350504196] [2022-07-12 18:47:23,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:23,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:47:23,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:47:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:47:23,527 INFO L87 Difference]: Start difference. First operand 224 states and 315 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:23,581 INFO L93 Difference]: Finished difference Result 305 states and 406 transitions. [2022-07-12 18:47:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 18:47:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:23,583 INFO L225 Difference]: With dead ends: 305 [2022-07-12 18:47:23,583 INFO L226 Difference]: Without dead ends: 305 [2022-07-12 18:47:23,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:23,585 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 163 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:23,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 192 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-07-12 18:47:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-12 18:47:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2022-07-12 18:47:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 234 states have (on average 1.5128205128205128) internal successors, (354), 252 states have internal predecessors, (354), 0 states have call successors, (0), 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:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2022-07-12 18:47:23,589 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 33 [2022-07-12 18:47:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:23,590 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2022-07-12 18:47:23,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2022-07-12 18:47:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:47:23,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:23,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 18:47:23,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:23,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:23,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -917642467, now seen corresponding path program 1 times [2022-07-12 18:47:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:23,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58656946] [2022-07-12 18:47:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58656946] [2022-07-12 18:47:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58656946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963860228] [2022-07-12 18:47:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:23,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:23,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:47:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:23,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:47:23,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:23,966 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:24,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:24,051 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 14 treesize of output 16 [2022-07-12 18:47:24,056 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:47:24,057 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:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:24,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:24,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-12 18:47:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:24,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963860228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:24,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:47:24,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2022-07-12 18:47:24,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196521478] [2022-07-12 18:47:24,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:47:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:47:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:47:24,371 INFO L87 Difference]: Start difference. First operand 253 states and 354 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 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:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:24,577 INFO L93 Difference]: Finished difference Result 273 states and 367 transitions. [2022-07-12 18:47:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:24,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 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) Word has length 33 [2022-07-12 18:47:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:24,580 INFO L225 Difference]: With dead ends: 273 [2022-07-12 18:47:24,580 INFO L226 Difference]: Without dead ends: 273 [2022-07-12 18:47:24,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:47:24,580 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 379 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:24,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 207 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 146 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-07-12 18:47:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-12 18:47:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2022-07-12 18:47:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 205 states have (on average 1.5170731707317073) internal successors, (311), 221 states have internal predecessors, (311), 0 states have call successors, (0), 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:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 311 transitions. [2022-07-12 18:47:24,584 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 311 transitions. Word has length 33 [2022-07-12 18:47:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:24,584 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 311 transitions. [2022-07-12 18:47:24,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 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:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 311 transitions. [2022-07-12 18:47:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:47:24,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:24,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:24,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:24,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 18:47:24,785 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash -499896363, now seen corresponding path program 1 times [2022-07-12 18:47:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:24,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72779444] [2022-07-12 18:47:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:24,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:24,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626490243] [2022-07-12 18:47:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:24,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:24,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:24,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:24,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:47:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:24,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:47:24,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:24,933 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:24,946 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:47:24,964 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 18:47:24,965 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:47:24,992 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:47:24,993 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:47:25,018 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 25 treesize of output 13 [2022-07-12 18:47:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:25,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:25,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:25,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72779444] [2022-07-12 18:47:25,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:25,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626490243] [2022-07-12 18:47:25,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626490243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:25,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:47:25,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-12 18:47:25,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358079315] [2022-07-12 18:47:25,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:25,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:47:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:47:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:47:25,122 INFO L87 Difference]: Start difference. First operand 222 states and 311 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:25,275 INFO L93 Difference]: Finished difference Result 232 states and 320 transitions. [2022-07-12 18:47:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:47:25,276 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 35 [2022-07-12 18:47:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:25,276 INFO L225 Difference]: With dead ends: 232 [2022-07-12 18:47:25,277 INFO L226 Difference]: Without dead ends: 232 [2022-07-12 18:47:25,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:47:25,277 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 19 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:25,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 368 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2022-07-12 18:47:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-12 18:47:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2022-07-12 18:47:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 205 states have (on average 1.5073170731707317) internal successors, (309), 220 states have internal predecessors, (309), 0 states have call successors, (0), 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:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 309 transitions. [2022-07-12 18:47:25,280 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 309 transitions. Word has length 35 [2022-07-12 18:47:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:25,281 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 309 transitions. [2022-07-12 18:47:25,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 309 transitions. [2022-07-12 18:47:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:47:25,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:25,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:25,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:25,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:25,482 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:25,482 INFO L85 PathProgramCache]: Analyzing trace with hash -499896362, now seen corresponding path program 1 times [2022-07-12 18:47:25,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:25,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074887350] [2022-07-12 18:47:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:25,501 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:25,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788581002] [2022-07-12 18:47:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:25,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:47:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:25,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 18:47:25,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:25,636 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:25,674 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:47:25,678 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:47:25,707 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 18:47:25,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 32 [2022-07-12 18:47:25,720 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:47:25,723 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:47:25,780 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:47:25,780 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 39 treesize of output 30 [2022-07-12 18:47:25,790 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:47:25,791 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 38 treesize of output 29 [2022-07-12 18:47:25,824 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 31 treesize of output 19 [2022-07-12 18:47:25,827 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 26 treesize of output 14 [2022-07-12 18:47:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:25,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:30,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-12 18:47:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:30,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:30,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074887350] [2022-07-12 18:47:30,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:30,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788581002] [2022-07-12 18:47:30,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788581002] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:30,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:47:30,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-07-12 18:47:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541921223] [2022-07-12 18:47:30,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:30,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:47:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:47:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:47:30,145 INFO L87 Difference]: Start difference. First operand 221 states and 309 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:30,447 INFO L93 Difference]: Finished difference Result 297 states and 415 transitions. [2022-07-12 18:47:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:47:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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 35 [2022-07-12 18:47:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:30,448 INFO L225 Difference]: With dead ends: 297 [2022-07-12 18:47:30,448 INFO L226 Difference]: Without dead ends: 297 [2022-07-12 18:47:30,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:47:30,449 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 60 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:30,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 420 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 107 Unchecked, 0.1s Time] [2022-07-12 18:47:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-12 18:47:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 208. [2022-07-12 18:47:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 193 states have (on average 1.528497409326425) internal successors, (295), 207 states have internal predecessors, (295), 0 states have call successors, (0), 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:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 295 transitions. [2022-07-12 18:47:30,452 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 295 transitions. Word has length 35 [2022-07-12 18:47:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:30,452 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 295 transitions. [2022-07-12 18:47:30,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 295 transitions. [2022-07-12 18:47:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:47:30,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:30,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:30,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 18:47:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:30,663 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1032157181, now seen corresponding path program 1 times [2022-07-12 18:47:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:30,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710986523] [2022-07-12 18:47:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:30,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:30,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131056677] [2022-07-12 18:47:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:30,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:30,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:30,678 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:30,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:47:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:30,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:47:30,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:30,807 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:30,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:30,848 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 14 treesize of output 16 [2022-07-12 18:47:30,853 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:47:30,853 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:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:30,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:31,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-12 18:47:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:31,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710986523] [2022-07-12 18:47:31,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:31,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131056677] [2022-07-12 18:47:31,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131056677] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:31,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:47:31,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-12 18:47:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032841990] [2022-07-12 18:47:31,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:31,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:47:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:47:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:47:31,118 INFO L87 Difference]: Start difference. First operand 208 states and 295 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:31,235 INFO L93 Difference]: Finished difference Result 234 states and 321 transitions. [2022-07-12 18:47:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:31,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:47:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:31,237 INFO L225 Difference]: With dead ends: 234 [2022-07-12 18:47:31,237 INFO L226 Difference]: Without dead ends: 234 [2022-07-12 18:47:31,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:47:31,237 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 304 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:31,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 144 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 18:47:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-12 18:47:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2022-07-12 18:47:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 198 states have (on average 1.52020202020202) internal successors, (301), 212 states have internal predecessors, (301), 0 states have call successors, (0), 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:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2022-07-12 18:47:31,240 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 36 [2022-07-12 18:47:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:31,240 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2022-07-12 18:47:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2022-07-12 18:47:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:47:31,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:31,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:31,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:31,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 18:47:31,452 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 234396292, now seen corresponding path program 1 times [2022-07-12 18:47:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245032542] [2022-07-12 18:47:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:31,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:31,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190504516] [2022-07-12 18:47:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:31,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:31,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:31,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:31,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:47:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:31,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:47:31,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 18:47:31,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245032542] [2022-07-12 18:47:31,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190504516] [2022-07-12 18:47:31,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190504516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:31,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:31,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:47:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773740920] [2022-07-12 18:47:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:31,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:31,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:31,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:31,642 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:31,744 INFO L93 Difference]: Finished difference Result 229 states and 306 transitions. [2022-07-12 18:47:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:31,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 18:47:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:31,746 INFO L225 Difference]: With dead ends: 229 [2022-07-12 18:47:31,746 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 18:47:31,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:47:31,746 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 137 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:31,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 130 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 18:47:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 213. [2022-07-12 18:47:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 212 states have internal predecessors, (299), 0 states have call successors, (0), 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:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2022-07-12 18:47:31,766 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 38 [2022-07-12 18:47:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:31,766 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-12 18:47:31,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2022-07-12 18:47:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:47:31,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:31,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:31,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:47:31,987 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -716826511, now seen corresponding path program 1 times [2022-07-12 18:47:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437993227] [2022-07-12 18:47:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:32,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:32,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445467977] [2022-07-12 18:47:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:32,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:32,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 18:47:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:32,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:47:32,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 18:47:32,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:32,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:32,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437993227] [2022-07-12 18:47:32,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:32,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445467977] [2022-07-12 18:47:32,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445467977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:32,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:32,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:32,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011460230] [2022-07-12 18:47:32,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:32,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:32,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:32,184 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:32,234 INFO L93 Difference]: Finished difference Result 221 states and 295 transitions. [2022-07-12 18:47:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:47:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:47:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:32,235 INFO L225 Difference]: With dead ends: 221 [2022-07-12 18:47:32,235 INFO L226 Difference]: Without dead ends: 221 [2022-07-12 18:47:32,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 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:47:32,236 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:32,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 134 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-12 18:47:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2022-07-12 18:47:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 178 states have (on average 1.4606741573033708) internal successors, (260), 192 states have internal predecessors, (260), 0 states have call successors, (0), 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:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 260 transitions. [2022-07-12 18:47:32,240 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 260 transitions. Word has length 41 [2022-07-12 18:47:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:32,240 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 260 transitions. [2022-07-12 18:47:32,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 260 transitions. [2022-07-12 18:47:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:47:32,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:32,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:32,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:32,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 18:47:32,460 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash -716826470, now seen corresponding path program 1 times [2022-07-12 18:47:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:32,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167528466] [2022-07-12 18:47:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:32,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:32,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38509285] [2022-07-12 18:47:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:32,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:32,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:32,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:32,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 18:47:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:32,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:47:32,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:32,617 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:32,642 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:47:32,691 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 17 treesize of output 9 [2022-07-12 18:47:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:32,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:32,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167528466] [2022-07-12 18:47:32,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:32,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38509285] [2022-07-12 18:47:32,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38509285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:32,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:32,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:47:32,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269720737] [2022-07-12 18:47:32,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:32,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:47:32,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:32,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:47:32,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:47:32,708 INFO L87 Difference]: Start difference. First operand 193 states and 260 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:32,959 INFO L93 Difference]: Finished difference Result 271 states and 347 transitions. [2022-07-12 18:47:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:47:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:47:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:32,960 INFO L225 Difference]: With dead ends: 271 [2022-07-12 18:47:32,960 INFO L226 Difference]: Without dead ends: 271 [2022-07-12 18:47:32,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:47:32,961 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 209 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:32,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 246 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-12 18:47:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 202. [2022-07-12 18:47:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 187 states have (on average 1.4598930481283423) internal successors, (273), 201 states have internal predecessors, (273), 0 states have call successors, (0), 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:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 273 transitions. [2022-07-12 18:47:32,964 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 273 transitions. Word has length 41 [2022-07-12 18:47:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:32,964 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 273 transitions. [2022-07-12 18:47:32,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 273 transitions. [2022-07-12 18:47:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:47:32,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:32,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:32,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:33,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 18:47:33,171 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash -716826469, now seen corresponding path program 1 times [2022-07-12 18:47:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:33,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789574699] [2022-07-12 18:47:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:33,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:33,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99570400] [2022-07-12 18:47:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:33,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:33,187 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:33,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 18:47:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:33,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:47:33,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:33,381 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:47:33,385 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:47:33,461 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 17 treesize of output 9 [2022-07-12 18:47:33,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:47:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:33,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789574699] [2022-07-12 18:47:33,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99570400] [2022-07-12 18:47:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99570400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:33,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:47:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275968094] [2022-07-12 18:47:33,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:33,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:47:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:47:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:47:33,486 INFO L87 Difference]: Start difference. First operand 202 states and 273 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:33,844 INFO L93 Difference]: Finished difference Result 306 states and 393 transitions. [2022-07-12 18:47:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:47:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:47:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:33,845 INFO L225 Difference]: With dead ends: 306 [2022-07-12 18:47:33,845 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 18:47:33,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:47:33,846 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 240 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:33,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 373 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 18:47:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 202. [2022-07-12 18:47:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 187 states have (on average 1.4491978609625669) internal successors, (271), 201 states have internal predecessors, (271), 0 states have call successors, (0), 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:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 271 transitions. [2022-07-12 18:47:33,849 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 271 transitions. Word has length 41 [2022-07-12 18:47:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:33,849 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 271 transitions. [2022-07-12 18:47:33,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 271 transitions. [2022-07-12 18:47:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:47:33,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:33,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:33,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:34,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 18:47:34,059 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1675466949, now seen corresponding path program 1 times [2022-07-12 18:47:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074592079] [2022-07-12 18:47:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:34,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:34,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036756556] [2022-07-12 18:47:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:34,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:34,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:34,073 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:34,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 18:47:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:34,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:47:34,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:47:34,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:34,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074592079] [2022-07-12 18:47:34,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:34,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036756556] [2022-07-12 18:47:34,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036756556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:34,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:34,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954854454] [2022-07-12 18:47:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:34,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:34,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:34,223 INFO L87 Difference]: Start difference. First operand 202 states and 271 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:34,265 INFO L93 Difference]: Finished difference Result 224 states and 294 transitions. [2022-07-12 18:47:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 43 [2022-07-12 18:47:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:34,266 INFO L225 Difference]: With dead ends: 224 [2022-07-12 18:47:34,266 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 18:47:34,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:47:34,267 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:34,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 18:47:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 200. [2022-07-12 18:47:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 187 states have (on average 1.4010695187165776) internal successors, (262), 199 states have internal predecessors, (262), 0 states have call successors, (0), 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:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2022-07-12 18:47:34,270 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 43 [2022-07-12 18:47:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:34,270 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2022-07-12 18:47:34,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2022-07-12 18:47:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:47:34,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:34,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:34,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:34,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:34,488 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1675466948, now seen corresponding path program 1 times [2022-07-12 18:47:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:34,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162508663] [2022-07-12 18:47:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:34,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 18:47:34,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801311973] [2022-07-12 18:47:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:34,501 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:34,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 18:47:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:34,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:47:34,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:34,669 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:47:34,672 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:47:34,737 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 23 treesize of output 15 [2022-07-12 18:47:34,738 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 19 treesize of output 11 [2022-07-12 18:47:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:34,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:34,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162508663] [2022-07-12 18:47:34,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 18:47:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801311973] [2022-07-12 18:47:34,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801311973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:34,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:34,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:47:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930490841] [2022-07-12 18:47:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:34,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:47:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:47:34,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:47:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:47:34,788 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:35,275 INFO L93 Difference]: Finished difference Result 342 states and 430 transitions. [2022-07-12 18:47:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:47:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-12 18:47:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:35,277 INFO L225 Difference]: With dead ends: 342 [2022-07-12 18:47:35,277 INFO L226 Difference]: Without dead ends: 342 [2022-07-12 18:47:35,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:47:35,278 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 271 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:35,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 474 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:47:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-12 18:47:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 204. [2022-07-12 18:47:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 203 states have internal predecessors, (266), 0 states have call successors, (0), 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:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 266 transitions. [2022-07-12 18:47:35,281 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 266 transitions. Word has length 43 [2022-07-12 18:47:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:35,282 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 266 transitions. [2022-07-12 18:47:35,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 266 transitions. [2022-07-12 18:47:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:47:35,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:35,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2022-07-12 18:47:35,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:35,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:35,499 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash 829486443, now seen corresponding path program 1 times [2022-07-12 18:47:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:47:35,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079918190] [2022-07-12 18:47:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:47:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:47:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079918190] [2022-07-12 18:47:35,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079918190] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:47:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853179144] [2022-07-12 18:47:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:35,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:35,717 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:47:35,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 18:47:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:35,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 18:47:35,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:35,873 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:35,887 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:47:35,892 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:47:35,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:35,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:47:35,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:35,920 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 21 treesize of output 20 [2022-07-12 18:47:35,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:35,928 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 21 treesize of output 20 [2022-07-12 18:47:35,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:35,934 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 21 treesize of output 20 [2022-07-12 18:47:36,040 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:47:36,040 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 17 treesize of output 21 [2022-07-12 18:47:36,092 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 14 treesize of output 16 [2022-07-12 18:47:36,099 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 14 treesize of output 16 [2022-07-12 18:47:36,108 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 14 treesize of output 16 [2022-07-12 18:47:36,119 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 14 treesize of output 16 [2022-07-12 18:47:36,128 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 14 treesize of output 16 [2022-07-12 18:47:36,137 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 14 treesize of output 16 [2022-07-12 18:47:36,146 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 14 treesize of output 16 [2022-07-12 18:47:36,152 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 14 treesize of output 16 [2022-07-12 18:47:36,165 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 14 treesize of output 16 [2022-07-12 18:47:36,175 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 14 treesize of output 16 [2022-07-12 18:47:36,268 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 18:47:36,268 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 18:47:36,282 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:47:36,283 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:47:36,332 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 41 treesize of output 39 [2022-07-12 18:47:36,336 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 52 treesize of output 52 [2022-07-12 18:47:36,340 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 18:47:36,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:36,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:47:36,556 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 18:47:36,558 INFO L158 Benchmark]: Toolchain (without parser) took 18644.72ms. Allocated memory was 117.4MB in the beginning and 188.7MB in the end (delta: 71.3MB). Free memory was 78.3MB in the beginning and 104.2MB in the end (delta: -25.9MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2022-07-12 18:47:36,559 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:47:36,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.14ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 83.8MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 18:47:36,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.09ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 81.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:47:36,559 INFO L158 Benchmark]: Boogie Preprocessor took 40.97ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:47:36,559 INFO L158 Benchmark]: RCFGBuilder took 403.02ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 62.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 18:47:36,559 INFO L158 Benchmark]: TraceAbstraction took 17790.50ms. Allocated memory was 117.4MB in the beginning and 188.7MB in the end (delta: 71.3MB). Free memory was 61.7MB in the beginning and 104.2MB in the end (delta: -42.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2022-07-12 18:47:36,560 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.14ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 83.8MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.09ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 81.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.97ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.02ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 62.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17790.50ms. Allocated memory was 117.4MB in the beginning and 188.7MB in the end (delta: 71.3MB). Free memory was 61.7MB in the beginning and 104.2MB in the end (delta: -42.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 18:47:36,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-0504_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:47:38,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:47:38,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:47:38,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:47:38,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:47:38,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:47:38,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:47:38,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:47:38,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:47:38,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:47:38,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:47:38,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:47:38,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:47:38,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:47:38,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:47:38,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:47:38,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:47:38,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:47:38,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:47:38,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:47:38,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:47:38,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:47:38,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:47:38,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:47:38,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:47:38,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:47:38,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:47:38,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:47:38,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:47:38,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:47:38,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:47:38,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:47:38,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:47:38,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:47:38,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:47:38,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:47:38,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:47:38,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:47:38,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:47:38,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:47:38,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:47:38,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:47:38,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:47:38,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:47:38,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:47:38,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:47:38,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:47:38,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:47:38,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:47:38,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:47:38,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:47:38,325 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:47:38,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:47:38,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:47:38,326 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:47:38,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:47:38,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:47:38,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:47:38,334 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:47:38,334 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:47:38,334 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:47:38,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:47:38,335 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:47:38,335 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:47:38,335 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:47:38,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:47:38,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:47:38,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:47:38,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:47:38,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:47:38,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:47:38,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:47:38,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:47:38,336 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:47:38,337 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:47:38,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:47:38,337 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> ad4b9fd301578a7ddb25530c70896459a49284f596306d3b6d0c853e43916174 [2022-07-12 18:47:38,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:47:38,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:47:38,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:47:38,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:47:38,615 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:47:38,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0504_1.i [2022-07-12 18:47:38,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0166d13d3/870e5e65a9514b77b8d9296b581bc926/FLAG906c1a5c6 [2022-07-12 18:47:38,987 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:47:39,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0504_1.i [2022-07-12 18:47:39,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0166d13d3/870e5e65a9514b77b8d9296b581bc926/FLAG906c1a5c6 [2022-07-12 18:47:39,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0166d13d3/870e5e65a9514b77b8d9296b581bc926 [2022-07-12 18:47:39,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:47:39,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:47:39,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:47:39,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:47:39,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:47:39,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef0eecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39, skipping insertion in model container [2022-07-12 18:47:39,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:47:39,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:47:39,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:47:39,683 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:47:39,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:47:39,750 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:47:39,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39 WrapperNode [2022-07-12 18:47:39,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:47:39,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:47:39,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:47:39,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:47:39,757 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:47:39" (1/1) ... [2022-07-12 18:47:39,781 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:47:39" (1/1) ... [2022-07-12 18:47:39,805 INFO L137 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2022-07-12 18:47:39,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:47:39,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:47:39,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:47:39,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:47:39,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:47:39,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:47:39,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:47:39,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:47:39,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (1/1) ... [2022-07-12 18:47:39,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:47:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:47:39,855 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:47:39,861 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:47:39,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:47:39,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:47:39,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:47:39,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:47:39,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:47:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:47:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:47:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:47:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:47:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:47:40,020 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:47:40,021 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:47:40,374 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:47:40,379 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:47:40,379 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 18:47:40,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:47:40 BoogieIcfgContainer [2022-07-12 18:47:40,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:47:40,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:47:40,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:47:40,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:47:40,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:47:39" (1/3) ... [2022-07-12 18:47:40,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6568cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:47:40, skipping insertion in model container [2022-07-12 18:47:40,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:47:39" (2/3) ... [2022-07-12 18:47:40,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6568cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:47:40, skipping insertion in model container [2022-07-12 18:47:40,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:47:40" (3/3) ... [2022-07-12 18:47:40,385 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504_1.i [2022-07-12 18:47:40,394 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:47:40,394 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-07-12 18:47:40,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:47:40,425 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@5fe1bdf9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bafc681 [2022-07-12 18:47:40,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2022-07-12 18:47:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:47:40,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:40,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:47:40,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 28700584, now seen corresponding path program 1 times [2022-07-12 18:47:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:40,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935047844] [2022-07-12 18:47:40,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:40,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:40,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:40,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:47:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:40,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:47:40,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:40,547 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:40,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:40,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935047844] [2022-07-12 18:47:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935047844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:40,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034632696] [2022-07-12 18:47:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:40,569 INFO L87 Difference]: Start difference. First operand has 90 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:47:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:40,603 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-12 18:47:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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:47:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:40,612 INFO L225 Difference]: With dead ends: 97 [2022-07-12 18:47:40,612 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 18:47:40,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:40,616 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:40,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 18:47:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2022-07-12 18:47:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 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:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-07-12 18:47:40,638 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 5 [2022-07-12 18:47:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:40,638 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-07-12 18:47:40,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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:47:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-07-12 18:47:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:47:40,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:40,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:47:40,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:40,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:40,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 28699819, now seen corresponding path program 1 times [2022-07-12 18:47:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:40,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190591995] [2022-07-12 18:47:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:40,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:40,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:47:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:40,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:47:40,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:40,921 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:40,931 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:40,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:40,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:40,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190591995] [2022-07-12 18:47:40,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190591995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:40,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:40,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797068074] [2022-07-12 18:47:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:40,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:40,935 INFO L87 Difference]: Start difference. First operand 90 states and 96 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:47:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:41,102 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-07-12 18:47:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:41,103 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:47:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:41,104 INFO L225 Difference]: With dead ends: 115 [2022-07-12 18:47:41,105 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 18:47:41,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:41,106 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:41,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 67 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 18:47:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2022-07-12 18:47:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.872340425531915) internal successors, (88), 81 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:47:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-12 18:47:41,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 5 [2022-07-12 18:47:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:41,112 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-12 18:47:41,112 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:47:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-12 18:47:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:47:41,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:41,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:47:41,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 18:47:41,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:41,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 28699820, now seen corresponding path program 1 times [2022-07-12 18:47:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520698548] [2022-07-12 18:47:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:41,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:41,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:41,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:47:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:41,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:47:41,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:41,368 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:41,380 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:41,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:41,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:41,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520698548] [2022-07-12 18:47:41,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520698548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:41,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:41,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527220063] [2022-07-12 18:47:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:41,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:41,382 INFO L87 Difference]: Start difference. First operand 82 states and 88 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:47:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:41,579 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2022-07-12 18:47:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:41,581 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:47:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:41,582 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:47:41,582 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 18:47:41,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:41,583 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 51 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:41,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 105 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 18:47:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2022-07-12 18:47:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 81 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:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2022-07-12 18:47:41,592 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 5 [2022-07-12 18:47:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:41,592 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2022-07-12 18:47:41,592 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:47:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2022-07-12 18:47:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:47:41,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:41,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:47:41,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:41,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:41,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 889717790, now seen corresponding path program 1 times [2022-07-12 18:47:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:41,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665500463] [2022-07-12 18:47:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:41,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:41,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:47:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:47:41,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:41,846 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:41,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:41,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:41,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665500463] [2022-07-12 18:47:41,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665500463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:41,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:41,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055890697] [2022-07-12 18:47:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:41,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:41,849 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:41,949 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-12 18:47:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 18:47:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:41,950 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:47:41,950 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 18:47:41,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:47:41,951 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:41,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 18:47:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-12 18:47:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 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:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-07-12 18:47:41,955 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 6 [2022-07-12 18:47:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:41,955 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-07-12 18:47:41,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-07-12 18:47:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:47:41,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:41,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:41,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:42,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1286398787, now seen corresponding path program 1 times [2022-07-12 18:47:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671028313] [2022-07-12 18:47:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:42,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:42,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:42,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:42,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:47:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:42,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:47:42,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:42,242 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:42,248 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:42,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:42,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:47:42,317 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:47:42,317 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:42,336 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:42,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:42,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:42,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671028313] [2022-07-12 18:47:42,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671028313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:42,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:42,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466031968] [2022-07-12 18:47:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:42,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:42,341 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:42,499 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-07-12 18:47:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 18:47:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:42,500 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:47:42,500 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 18:47:42,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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:42,501 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 106 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:42,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 48 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 18:47:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-07-12 18:47:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 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:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-07-12 18:47:42,505 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2022-07-12 18:47:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:42,505 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-07-12 18:47:42,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-07-12 18:47:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:47:42,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:42,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:42,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:42,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:42,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1223687433, now seen corresponding path program 1 times [2022-07-12 18:47:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:42,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875815582] [2022-07-12 18:47:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:42,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:42,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:42,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:47:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:42,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:47:42,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:42,822 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:42,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:42,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:42,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875815582] [2022-07-12 18:47:42,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875815582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:42,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:42,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807286416] [2022-07-12 18:47:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:42,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:42,825 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:42,842 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-12 18:47:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:42,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:47:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:42,843 INFO L225 Difference]: With dead ends: 104 [2022-07-12 18:47:42,844 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 18:47:42,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:47:42,846 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:42,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 145 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 18:47:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-07-12 18:47:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 93 states have internal predecessors, (110), 0 states have call successors, (0), 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:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2022-07-12 18:47:42,856 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 14 [2022-07-12 18:47:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:42,857 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2022-07-12 18:47:42,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2022-07-12 18:47:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:47:42,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:42,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:42,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:43,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:43,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1223656742, now seen corresponding path program 1 times [2022-07-12 18:47:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:43,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714034103] [2022-07-12 18:47:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:43,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:43,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:43,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:47:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:43,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:47:43,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:43,141 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:43,146 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:43,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:43,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:43,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714034103] [2022-07-12 18:47:43,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714034103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:43,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:43,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979003901] [2022-07-12 18:47:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:43,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:43,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:43,150 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:43,262 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-07-12 18:47:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:47:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:43,263 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:47:43,263 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:47:43,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:47:43,264 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:43,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:47:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-12 18:47:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-12 18:47:43,267 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 14 [2022-07-12 18:47:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:43,267 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-12 18:47:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-12 18:47:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:47:43,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:43,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:43,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:43,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:43,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1223656741, now seen corresponding path program 1 times [2022-07-12 18:47:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567922664] [2022-07-12 18:47:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:43,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:43,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:43,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:47:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:43,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:47:43,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:43,552 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:43,565 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:43,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:43,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:43,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567922664] [2022-07-12 18:47:43,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567922664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:43,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:43,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:47:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067175406] [2022-07-12 18:47:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:43,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:47:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:47:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:47:43,566 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:43,660 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-07-12 18:47:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:47:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:47:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:43,661 INFO L225 Difference]: With dead ends: 86 [2022-07-12 18:47:43,661 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:47:43,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:47:43,662 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:43,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:47:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:47:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-12 18:47:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 85 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:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-07-12 18:47:43,668 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 14 [2022-07-12 18:47:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:43,668 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-07-12 18:47:43,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-07-12 18:47:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:47:43,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:43,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:43,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 18:47:43,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:43,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 857288497, now seen corresponding path program 1 times [2022-07-12 18:47:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:43,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675569018] [2022-07-12 18:47:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:43,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:43,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:43,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:43,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:47:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:43,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:47:43,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:43,947 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:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:43,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:43,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:43,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675569018] [2022-07-12 18:47:43,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675569018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:43,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:43,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933591794] [2022-07-12 18:47:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:43,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:43,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:43,976 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:44,195 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-07-12 18:47:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:47:44,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:47:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:44,196 INFO L225 Difference]: With dead ends: 120 [2022-07-12 18:47:44,196 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 18:47:44,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:47:44,197 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 86 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:44,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 18:47:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 88. [2022-07-12 18:47:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 87 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:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-07-12 18:47:44,200 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 16 [2022-07-12 18:47:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:44,200 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-07-12 18:47:44,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-07-12 18:47:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:47:44,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:44,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:47:44,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:44,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:44,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 857288498, now seen corresponding path program 1 times [2022-07-12 18:47:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:44,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525360986] [2022-07-12 18:47:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:44,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:44,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:47:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:44,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:47:44,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:44,476 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:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:44,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:44,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525360986] [2022-07-12 18:47:44,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525360986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:44,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:44,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:47:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849293374] [2022-07-12 18:47:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:44,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:44,527 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:44,757 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2022-07-12 18:47:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:44,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:47:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:44,759 INFO L225 Difference]: With dead ends: 157 [2022-07-12 18:47:44,759 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 18:47:44,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:47:44,759 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:44,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 18:47:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2022-07-12 18:47:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 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:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2022-07-12 18:47:44,762 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 16 [2022-07-12 18:47:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:44,762 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2022-07-12 18:47:44,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2022-07-12 18:47:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:47:44,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:44,763 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:47:44,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:44,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:44,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 806139317, now seen corresponding path program 1 times [2022-07-12 18:47:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:44,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392660715] [2022-07-12 18:47:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:44,971 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:44,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:47:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:45,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:47:45,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:45,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:45,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392660715] [2022-07-12 18:47:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392660715] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:45,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:47:45,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 18:47:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47716675] [2022-07-12 18:47:45,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:45,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:45,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:45,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:45,093 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:45,153 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-07-12 18:47:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 18:47:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:45,154 INFO L225 Difference]: With dead ends: 146 [2022-07-12 18:47:45,154 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:47:45,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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:45,155 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 202 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 185 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:47:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:47:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 131. [2022-07-12 18:47:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 130 states have internal predecessors, (165), 0 states have call successors, (0), 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:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2022-07-12 18:47:45,158 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 17 [2022-07-12 18:47:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:45,158 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2022-07-12 18:47:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2022-07-12 18:47:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:47:45,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:45,158 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:47:45,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:45,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:45,359 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1724432386, now seen corresponding path program 1 times [2022-07-12 18:47:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:45,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496802723] [2022-07-12 18:47:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:45,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:45,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:45,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:45,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:47:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:45,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:47:45,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:45,458 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:47:45,473 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:47:45,474 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 21 treesize of output 20 [2022-07-12 18:47:45,503 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:47:45,504 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 21 treesize of output 20 [2022-07-12 18:47:45,549 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:47:45,549 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:47:45,580 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:47:45,580 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-07-12 18:47:45,591 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:45,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:45,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:45,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496802723] [2022-07-12 18:47:45,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496802723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:45,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:45,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:47:45,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023831448] [2022-07-12 18:47:45,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:45,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:45,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:45,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:45,593 INFO L87 Difference]: Start difference. First operand 131 states and 165 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:47:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:45,760 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2022-07-12 18:47:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:45,760 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:47:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:45,761 INFO L225 Difference]: With dead ends: 200 [2022-07-12 18:47:45,761 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 18:47:45,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:47:45,762 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 46 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:45,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-07-12 18:47:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 18:47:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2022-07-12 18:47:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 142 states have internal predecessors, (179), 0 states have call successors, (0), 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:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 179 transitions. [2022-07-12 18:47:45,765 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 179 transitions. Word has length 17 [2022-07-12 18:47:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:45,765 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 179 transitions. [2022-07-12 18:47:45,765 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:47:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 179 transitions. [2022-07-12 18:47:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:47:45,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:45,765 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:47:45,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:45,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:45,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1724432387, now seen corresponding path program 1 times [2022-07-12 18:47:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:45,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170096822] [2022-07-12 18:47:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:45,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:45,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:45,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:45,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:47:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:46,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:47:46,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:46,096 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:46,099 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:46,129 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:47:46,135 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:47:46,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:46,167 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 21 treesize of output 20 [2022-07-12 18:47:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:46,173 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 21 treesize of output 20 [2022-07-12 18:47:46,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:46,188 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 21 treesize of output 20 [2022-07-12 18:47:46,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:46,196 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 21 treesize of output 20 [2022-07-12 18:47:46,233 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:47:46,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 18:47:46,245 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:47:46,246 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:46,336 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 18 [2022-07-12 18:47:46,341 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 18 [2022-07-12 18:47:46,386 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:47:46,387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2022-07-12 18:47:46,391 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 22 treesize of output 10 [2022-07-12 18:47:46,405 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:46,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:46,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170096822] [2022-07-12 18:47:46,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170096822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:46,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:47:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443323550] [2022-07-12 18:47:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:46,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:46,407 INFO L87 Difference]: Start difference. First operand 143 states and 179 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:47:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:46,815 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2022-07-12 18:47:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:47:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:47:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:46,816 INFO L225 Difference]: With dead ends: 194 [2022-07-12 18:47:46,816 INFO L226 Difference]: Without dead ends: 194 [2022-07-12 18:47:46,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:47:46,817 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:46,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 170 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2022-07-12 18:47:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-12 18:47:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 143. [2022-07-12 18:47:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 142 states have internal predecessors, (177), 0 states have call successors, (0), 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:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2022-07-12 18:47:46,820 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 17 [2022-07-12 18:47:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:46,820 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2022-07-12 18:47:46,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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:47:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2022-07-12 18:47:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:47:46,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:46,821 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:47:46,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:47,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:47,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash -779472846, now seen corresponding path program 1 times [2022-07-12 18:47:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:47,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913641414] [2022-07-12 18:47:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:47,029 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:47,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:47:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:47,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:47:47,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:47,101 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:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:47,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:47,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913641414] [2022-07-12 18:47:47,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913641414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:47,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:47,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167058840] [2022-07-12 18:47:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:47,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:47,131 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:47:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:47,477 INFO L93 Difference]: Finished difference Result 201 states and 246 transitions. [2022-07-12 18:47:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:47:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:47,478 INFO L225 Difference]: With dead ends: 201 [2022-07-12 18:47:47,478 INFO L226 Difference]: Without dead ends: 201 [2022-07-12 18:47:47,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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:47:47,479 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 124 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:47,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 128 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:47:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-12 18:47:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 161. [2022-07-12 18:47:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.4859154929577465) internal successors, (211), 160 states have internal predecessors, (211), 0 states have call successors, (0), 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:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2022-07-12 18:47:47,482 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 211 transitions. Word has length 18 [2022-07-12 18:47:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:47,482 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 211 transitions. [2022-07-12 18:47:47,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:47:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2022-07-12 18:47:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:47:47,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:47,483 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:47:47,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:47,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:47,688 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash -779472845, now seen corresponding path program 1 times [2022-07-12 18:47:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:47,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870101687] [2022-07-12 18:47:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:47,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:47,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:47,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:47,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:47:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:47,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:47:47,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:47,761 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:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:47,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:47,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:47,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870101687] [2022-07-12 18:47:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870101687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:47,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500904204] [2022-07-12 18:47:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:47:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:47:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:47:47,829 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:47:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:48,192 INFO L93 Difference]: Finished difference Result 272 states and 360 transitions. [2022-07-12 18:47:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:47:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:47:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:48,194 INFO L225 Difference]: With dead ends: 272 [2022-07-12 18:47:48,194 INFO L226 Difference]: Without dead ends: 272 [2022-07-12 18:47:48,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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:47:48,194 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 125 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:48,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 161 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:47:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-12 18:47:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 197. [2022-07-12 18:47:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 196 states have internal predecessors, (277), 0 states have call successors, (0), 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:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 277 transitions. [2022-07-12 18:47:48,198 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 277 transitions. Word has length 18 [2022-07-12 18:47:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:48,199 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 277 transitions. [2022-07-12 18:47:48,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:47:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 277 transitions. [2022-07-12 18:47:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:47:48,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:48,199 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:47:48,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 18:47:48,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:48,406 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1612692029, now seen corresponding path program 1 times [2022-07-12 18:47:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:48,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935846348] [2022-07-12 18:47:48,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:48,408 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:48,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:47:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:48,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:47:48,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:48,511 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:48,523 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:47:48,544 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:47:48,545 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 21 treesize of output 20 [2022-07-12 18:47:48,560 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:47:48,561 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 21 treesize of output 20 [2022-07-12 18:47:48,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:47:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:48,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:48,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935846348] [2022-07-12 18:47:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935846348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:48,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:48,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:47:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244514098] [2022-07-12 18:47:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:48,630 INFO L87 Difference]: Start difference. First operand 197 states and 277 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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:47:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:49,197 INFO L93 Difference]: Finished difference Result 296 states and 395 transitions. [2022-07-12 18:47:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:47:49,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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:47:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:49,198 INFO L225 Difference]: With dead ends: 296 [2022-07-12 18:47:49,199 INFO L226 Difference]: Without dead ends: 296 [2022-07-12 18:47:49,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:47:49,199 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:49,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 238 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:47:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-12 18:47:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 207. [2022-07-12 18:47:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 188 states have (on average 1.553191489361702) internal successors, (292), 206 states have internal predecessors, (292), 0 states have call successors, (0), 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:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 292 transitions. [2022-07-12 18:47:49,203 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 292 transitions. Word has length 21 [2022-07-12 18:47:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:49,203 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 292 transitions. [2022-07-12 18:47:49,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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:47:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 292 transitions. [2022-07-12 18:47:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:47:49,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:49,204 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:47:49,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:49,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:49,411 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1612692030, now seen corresponding path program 1 times [2022-07-12 18:47:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:49,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553551911] [2022-07-12 18:47:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:49,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:49,420 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:49,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:47:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:49,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:47:49,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:49,528 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:47:49,532 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:47:49,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:49,554 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 21 treesize of output 20 [2022-07-12 18:47:49,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:49,562 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 21 treesize of output 20 [2022-07-12 18:47:49,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:49,571 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 21 treesize of output 20 [2022-07-12 18:47:49,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:49,576 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 21 treesize of output 20 [2022-07-12 18:47:49,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:47:49,640 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 15 treesize of output 10 [2022-07-12 18:47:49,644 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:47:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:49,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:49,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553551911] [2022-07-12 18:47:49,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553551911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:49,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:49,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:47:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668842105] [2022-07-12 18:47:49,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:49,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:49,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:49,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:49,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:49,675 INFO L87 Difference]: Start difference. First operand 207 states and 292 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:47:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:50,262 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2022-07-12 18:47:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:47:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:47:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:50,263 INFO L225 Difference]: With dead ends: 269 [2022-07-12 18:47:50,263 INFO L226 Difference]: Without dead ends: 269 [2022-07-12 18:47:50,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:47:50,264 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 153 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:50,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 356 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:47:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-12 18:47:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 191. [2022-07-12 18:47:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 172 states have (on average 1.494186046511628) internal successors, (257), 190 states have internal predecessors, (257), 0 states have call successors, (0), 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:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 257 transitions. [2022-07-12 18:47:50,267 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 257 transitions. Word has length 21 [2022-07-12 18:47:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 257 transitions. [2022-07-12 18:47:50,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:47:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 257 transitions. [2022-07-12 18:47:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:47:50,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:50,272 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:47:50,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:50,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:50,479 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1546155751, now seen corresponding path program 1 times [2022-07-12 18:47:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:50,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879493590] [2022-07-12 18:47:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:50,481 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:50,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:47:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:50,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:47:50,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:50,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:47:50,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:50,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879493590] [2022-07-12 18:47:50,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879493590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:47:50,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:47:50,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:47:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270429832] [2022-07-12 18:47:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:47:50,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:47:50,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:47:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:47:50,651 INFO L87 Difference]: Start difference. First operand 191 states and 257 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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:47:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:50,923 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2022-07-12 18:47:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:47:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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:47:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:50,924 INFO L225 Difference]: With dead ends: 221 [2022-07-12 18:47:50,924 INFO L226 Difference]: Without dead ends: 221 [2022-07-12 18:47:50,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:47:50,924 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 157 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:50,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 139 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-12 18:47:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2022-07-12 18:47:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 181 states have (on average 1.5303867403314917) internal successors, (277), 199 states have internal predecessors, (277), 0 states have call successors, (0), 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:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 277 transitions. [2022-07-12 18:47:50,928 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 277 transitions. Word has length 22 [2022-07-12 18:47:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:50,928 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 277 transitions. [2022-07-12 18:47:50,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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:47:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 277 transitions. [2022-07-12 18:47:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:47:50,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:50,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 18:47:50,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:51,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:51,140 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 858860942, now seen corresponding path program 1 times [2022-07-12 18:47:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818207185] [2022-07-12 18:47:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:51,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:51,141 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:51,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:47:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:51,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:47:51,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:51,270 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:51,298 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 18:47:51,298 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 18 treesize of output 25 [2022-07-12 18:47:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:51,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:51,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:51,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818207185] [2022-07-12 18:47:51,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818207185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:51,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:47:51,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-12 18:47:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496978161] [2022-07-12 18:47:51,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:47:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:47:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:47:51,369 INFO L87 Difference]: Start difference. First operand 200 states and 277 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:51,584 INFO L93 Difference]: Finished difference Result 221 states and 294 transitions. [2022-07-12 18:47:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:47:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:51,585 INFO L225 Difference]: With dead ends: 221 [2022-07-12 18:47:51,585 INFO L226 Difference]: Without dead ends: 221 [2022-07-12 18:47:51,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 2 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:47:51,586 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 88 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:51,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 99 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:47:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-12 18:47:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2022-07-12 18:47:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 198 states have internal predecessors, (275), 0 states have call successors, (0), 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:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 275 transitions. [2022-07-12 18:47:51,589 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 275 transitions. Word has length 25 [2022-07-12 18:47:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:51,589 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 275 transitions. [2022-07-12 18:47:51,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 275 transitions. [2022-07-12 18:47:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:47:51,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:51,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 18:47:51,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:51,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:51,797 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 858860943, now seen corresponding path program 1 times [2022-07-12 18:47:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:51,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288141974] [2022-07-12 18:47:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:51,800 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:51,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:47:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:51,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:47:51,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:51,934 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:51,936 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:51,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:47:51,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:47:52,004 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:47:52,004 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 12 treesize of output 12 [2022-07-12 18:47:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:52,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:47:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:56,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:47:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288141974] [2022-07-12 18:47:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288141974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:47:56,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:47:56,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 18:47:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461769544] [2022-07-12 18:47:56,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:47:56,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:47:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:47:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:47:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:47:56,423 INFO L87 Difference]: Start difference. First operand 199 states and 275 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:47:56,719 INFO L93 Difference]: Finished difference Result 285 states and 391 transitions. [2022-07-12 18:47:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:47:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 18:47:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:47:56,721 INFO L225 Difference]: With dead ends: 285 [2022-07-12 18:47:56,721 INFO L226 Difference]: Without dead ends: 285 [2022-07-12 18:47:56,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:47:56,721 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 147 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:47:56,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 197 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-12 18:47:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-12 18:47:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 216. [2022-07-12 18:47:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 198 states have (on average 1.4848484848484849) internal successors, (294), 215 states have internal predecessors, (294), 0 states have call successors, (0), 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:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 294 transitions. [2022-07-12 18:47:56,725 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 294 transitions. Word has length 25 [2022-07-12 18:47:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:47:56,725 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 294 transitions. [2022-07-12 18:47:56,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:47:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 294 transitions. [2022-07-12 18:47:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:47:56,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:47:56,725 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:56,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 18:47:56,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:47:56,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:47:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:47:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1822218349, now seen corresponding path program 1 times [2022-07-12 18:47:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:47:56,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346388898] [2022-07-12 18:47:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:47:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:47:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:47:56,927 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:47:56,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:47:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:47:57,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:47:57,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:47:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:47:57,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:01,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:01,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346388898] [2022-07-12 18:48:01,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346388898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:01,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:01,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-12 18:48:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74006614] [2022-07-12 18:48:01,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:01,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:48:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:48:01,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=80, Unknown=2, NotChecked=0, Total=110 [2022-07-12 18:48:01,238 INFO L87 Difference]: Start difference. First operand 216 states and 294 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 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:48:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:01,441 INFO L93 Difference]: Finished difference Result 221 states and 298 transitions. [2022-07-12 18:48:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:48:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 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 26 [2022-07-12 18:48:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:01,442 INFO L225 Difference]: With dead ends: 221 [2022-07-12 18:48:01,442 INFO L226 Difference]: Without dead ends: 209 [2022-07-12 18:48:01,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=34, Invalid=96, Unknown=2, NotChecked=0, Total=132 [2022-07-12 18:48:01,443 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:01,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-07-12 18:48:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-12 18:48:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-07-12 18:48:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 191 states have (on average 1.4973821989528795) internal successors, (286), 208 states have internal predecessors, (286), 0 states have call successors, (0), 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:48:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 286 transitions. [2022-07-12 18:48:01,446 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 286 transitions. Word has length 26 [2022-07-12 18:48:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:01,446 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 286 transitions. [2022-07-12 18:48:01,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 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:48:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2022-07-12 18:48:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:48:01,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:01,447 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:48:01,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-12 18:48:01,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:01,654 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -535670236, now seen corresponding path program 1 times [2022-07-12 18:48:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357368916] [2022-07-12 18:48:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:01,656 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:01,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:48:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:01,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:48:01,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:01,817 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:48:01,824 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:48:01,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:01,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:48:01,877 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:01,877 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:48:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:01,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:06,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:06,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357368916] [2022-07-12 18:48:06,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357368916] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:06,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:06,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 18:48:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975470775] [2022-07-12 18:48:06,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:48:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:48:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2022-07-12 18:48:06,242 INFO L87 Difference]: Start difference. First operand 209 states and 286 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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:48:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:06,669 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-07-12 18:48:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:48:06,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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:48:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:06,671 INFO L225 Difference]: With dead ends: 258 [2022-07-12 18:48:06,671 INFO L226 Difference]: Without dead ends: 258 [2022-07-12 18:48:06,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2022-07-12 18:48:06,671 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 152 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:06,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 125 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 19 Unchecked, 0.4s Time] [2022-07-12 18:48:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-12 18:48:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2022-07-12 18:48:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.4495412844036697) internal successors, (316), 235 states have internal predecessors, (316), 0 states have call successors, (0), 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:48:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 316 transitions. [2022-07-12 18:48:06,675 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 316 transitions. Word has length 28 [2022-07-12 18:48:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:06,675 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 316 transitions. [2022-07-12 18:48:06,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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:48:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 316 transitions. [2022-07-12 18:48:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:48:06,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:06,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:06,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-12 18:48:06,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:06,884 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1492384592, now seen corresponding path program 1 times [2022-07-12 18:48:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:06,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177655947] [2022-07-12 18:48:06,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:06,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:06,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:06,886 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:06,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:48:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:07,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:48:07,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:07,076 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:48:07,091 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:48:07,108 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-12 18:48:07,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2022-07-12 18:48:07,154 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:48:07,155 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 26 treesize of output 21 [2022-07-12 18:48:07,184 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:48:07,184 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 29 treesize of output 13 [2022-07-12 18:48:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:07,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:07,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:07,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177655947] [2022-07-12 18:48:07,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177655947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:07,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:07,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-07-12 18:48:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454230729] [2022-07-12 18:48:07,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:07,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:48:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:48:07,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:48:07,250 INFO L87 Difference]: Start difference. First operand 236 states and 316 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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:48:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:07,615 INFO L93 Difference]: Finished difference Result 255 states and 333 transitions. [2022-07-12 18:48:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:48:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 18:48:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:07,616 INFO L225 Difference]: With dead ends: 255 [2022-07-12 18:48:07,616 INFO L226 Difference]: Without dead ends: 255 [2022-07-12 18:48:07,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:48:07,617 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:07,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 220 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 3 Unchecked, 0.3s Time] [2022-07-12 18:48:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-12 18:48:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 235. [2022-07-12 18:48:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 218 states have (on average 1.4403669724770642) internal successors, (314), 234 states have internal predecessors, (314), 0 states have call successors, (0), 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:48:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 314 transitions. [2022-07-12 18:48:07,620 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 314 transitions. Word has length 29 [2022-07-12 18:48:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:07,620 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 314 transitions. [2022-07-12 18:48:07,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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:48:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 314 transitions. [2022-07-12 18:48:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:48:07,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:07,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:07,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:07,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:07,829 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1492384593, now seen corresponding path program 1 times [2022-07-12 18:48:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:07,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875415325] [2022-07-12 18:48:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:07,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:07,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:07,832 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:07,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 18:48:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:08,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:48:08,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:08,024 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:48:08,057 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:48:08,063 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:48:08,088 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 18:48:08,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:48:08,167 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:48:08,167 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 25 treesize of output 20 [2022-07-12 18:48:08,187 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:48:08,187 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:48:08,234 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:48:08,234 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 28 treesize of output 12 [2022-07-12 18:48:08,238 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:48:08,238 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 26 treesize of output 10 [2022-07-12 18:48:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:08,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:08,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:08,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875415325] [2022-07-12 18:48:08,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875415325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:08,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:08,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-12 18:48:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801066918] [2022-07-12 18:48:08,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:08,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:48:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:48:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:48:08,739 INFO L87 Difference]: Start difference. First operand 235 states and 314 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:09,478 INFO L93 Difference]: Finished difference Result 248 states and 314 transitions. [2022-07-12 18:48:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:48:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 18:48:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:09,480 INFO L225 Difference]: With dead ends: 248 [2022-07-12 18:48:09,480 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 18:48:09,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:48:09,481 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 82 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:09,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 392 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 112 Unchecked, 0.6s Time] [2022-07-12 18:48:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 18:48:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2022-07-12 18:48:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 206 states have (on average 1.4563106796116505) internal successors, (300), 221 states have internal predecessors, (300), 0 states have call successors, (0), 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:48:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 300 transitions. [2022-07-12 18:48:09,484 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 300 transitions. Word has length 29 [2022-07-12 18:48:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:09,484 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 300 transitions. [2022-07-12 18:48:09,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 300 transitions. [2022-07-12 18:48:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:48:09,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:09,484 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] [2022-07-12 18:48:09,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:09,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:09,692 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 616980133, now seen corresponding path program 1 times [2022-07-12 18:48:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:09,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238883445] [2022-07-12 18:48:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:09,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:09,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:09,694 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:09,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 18:48:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:09,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:48:09,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:48:09,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:09,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:09,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238883445] [2022-07-12 18:48:09,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238883445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:09,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:09,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:48:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834595156] [2022-07-12 18:48:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:09,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:48:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:48:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:48:09,867 INFO L87 Difference]: Start difference. First operand 222 states and 300 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:10,087 INFO L93 Difference]: Finished difference Result 237 states and 301 transitions. [2022-07-12 18:48:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:48:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 18:48:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:10,088 INFO L225 Difference]: With dead ends: 237 [2022-07-12 18:48:10,088 INFO L226 Difference]: Without dead ends: 237 [2022-07-12 18:48:10,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:48:10,089 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:10,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 104 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:48:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-12 18:48:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 188. [2022-07-12 18:48:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 187 states have internal predecessors, (243), 0 states have call successors, (0), 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:48:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2022-07-12 18:48:10,092 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 30 [2022-07-12 18:48:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:10,092 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2022-07-12 18:48:10,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2022-07-12 18:48:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:48:10,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:10,093 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, 1] [2022-07-12 18:48:10,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:10,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:10,301 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2004836725, now seen corresponding path program 1 times [2022-07-12 18:48:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:10,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436468227] [2022-07-12 18:48:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:10,304 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:10,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 18:48:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:10,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:48:10,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:10,433 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:48:10,448 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:48:10,478 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 17 treesize of output 9 [2022-07-12 18:48:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:10,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:10,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:10,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436468227] [2022-07-12 18:48:10,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436468227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:10,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:10,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:48:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312044852] [2022-07-12 18:48:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:48:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:48:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:48:10,498 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:11,033 INFO L93 Difference]: Finished difference Result 218 states and 265 transitions. [2022-07-12 18:48:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:48:11,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 18:48:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:11,034 INFO L225 Difference]: With dead ends: 218 [2022-07-12 18:48:11,034 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 18:48:11,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:48:11,035 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 88 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:11,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 187 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:48:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 18:48:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2022-07-12 18:48:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 174 states have (on average 1.4195402298850575) internal successors, (247), 189 states have internal predecessors, (247), 0 states have call successors, (0), 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:48:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-12 18:48:11,038 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 33 [2022-07-12 18:48:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:11,038 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-12 18:48:11,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-12 18:48:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:48:11,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:11,039 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, 1] [2022-07-12 18:48:11,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:11,247 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2004836724, now seen corresponding path program 1 times [2022-07-12 18:48:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:11,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250514330] [2022-07-12 18:48:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:11,249 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 18:48:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:11,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 18:48:11,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:11,404 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:48:11,449 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:48:11,453 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:48:11,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:11,508 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 17 treesize of output 9 [2022-07-12 18:48:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:11,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:11,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:11,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250514330] [2022-07-12 18:48:11,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250514330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:11,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:11,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:48:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441061159] [2022-07-12 18:48:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:11,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:48:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:48:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:48:11,537 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:12,121 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2022-07-12 18:48:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:48:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 18:48:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:12,123 INFO L225 Difference]: With dead ends: 216 [2022-07-12 18:48:12,123 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 18:48:12,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:48:12,123 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 90 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:12,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 243 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:48:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 18:48:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2022-07-12 18:48:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 189 states have internal predecessors, (246), 0 states have call successors, (0), 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:48:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 246 transitions. [2022-07-12 18:48:12,134 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 246 transitions. Word has length 33 [2022-07-12 18:48:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:12,134 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 246 transitions. [2022-07-12 18:48:12,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 246 transitions. [2022-07-12 18:48:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:48:12,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:12,135 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] [2022-07-12 18:48:12,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-12 18:48:12,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:12,343 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -161860525, now seen corresponding path program 1 times [2022-07-12 18:48:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822350882] [2022-07-12 18:48:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:12,345 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 18:48:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:12,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:48:12,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:12,566 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 18:48:12,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-12 18:48:12,612 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:48:12,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:12,632 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 21 treesize of output 20 [2022-07-12 18:48:12,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:12,645 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 21 treesize of output 20 [2022-07-12 18:48:12,718 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-12 18:48:12,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 30 [2022-07-12 18:48:12,759 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 14 treesize of output 16 [2022-07-12 18:48:12,772 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 14 treesize of output 16 [2022-07-12 18:48:12,787 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 14 treesize of output 16 [2022-07-12 18:48:12,797 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 14 treesize of output 16 [2022-07-12 18:48:12,805 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 14 treesize of output 16 [2022-07-12 18:48:12,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:12,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:48:12,873 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 14 treesize of output 16 [2022-07-12 18:48:12,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:12,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:12,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 18:48:13,005 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-12 18:48:13,005 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 29 treesize of output 28 [2022-07-12 18:48:13,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|)) is different from false [2022-07-12 18:48:13,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|)) is different from false [2022-07-12 18:48:13,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|)))) is different from false [2022-07-12 18:48:13,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))))) is different from false [2022-07-12 18:48:13,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))))) is different from false [2022-07-12 18:48:13,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1206 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1206) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-12 18:48:13,168 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-07-12 18:48:13,168 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-07-12 18:48:13,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 60 treesize of output 52 [2022-07-12 18:48:13,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:48:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 18:48:13,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:13,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822350882] [2022-07-12 18:48:13,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822350882] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:13,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:13,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2022-07-12 18:48:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464777945] [2022-07-12 18:48:13,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:48:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:48:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=181, Unknown=7, NotChecked=224, Total=462 [2022-07-12 18:48:13,197 INFO L87 Difference]: Start difference. First operand 190 states and 246 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:13,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 1) (select |c_#valid| (_ bv0 32))))) (and (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) .cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (or .cse0 (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))))))) is different from false [2022-07-12 18:48:13,416 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (or (= (_ bv0 1) (select |c_#valid| (_ bv0 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|))))))) is different from false [2022-07-12 18:48:13,819 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) |c_ULTIMATE.start_main_~last~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|)) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1209 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1209)) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))))) (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|) (= (_ bv0 32) |c_ULTIMATE.start_main_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-12 18:48:13,848 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) |c_ULTIMATE.start_main_~last~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1215)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|) (= (_ bv0 32) |c_ULTIMATE.start_main_~last~0#1.offset|) (forall ((v_ArrVal_1215 (_ BitVec 32)) (v_ArrVal_1214 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1214))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1215))) |v_ULTIMATE.start_main_~x~0#1.base_42| v_ArrVal_1217) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_42|)))))) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-12 18:48:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:14,572 INFO L93 Difference]: Finished difference Result 251 states and 309 transitions. [2022-07-12 18:48:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:48:14,573 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-12 18:48:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:14,574 INFO L225 Difference]: With dead ends: 251 [2022-07-12 18:48:14,581 INFO L226 Difference]: Without dead ends: 251 [2022-07-12 18:48:14,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=674, Unknown=29, NotChecked=704, Total=1560 [2022-07-12 18:48:14,582 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 105 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 708 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:14,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 489 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 528 Invalid, 0 Unknown, 708 Unchecked, 0.8s Time] [2022-07-12 18:48:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-12 18:48:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 211. [2022-07-12 18:48:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 195 states have (on average 1.3897435897435897) internal successors, (271), 210 states have internal predecessors, (271), 0 states have call successors, (0), 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:48:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2022-07-12 18:48:14,585 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 35 [2022-07-12 18:48:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:14,585 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2022-07-12 18:48:14,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2022-07-12 18:48:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:48:14,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:14,586 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] [2022-07-12 18:48:14,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-12 18:48:14,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:14,794 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash -161860524, now seen corresponding path program 1 times [2022-07-12 18:48:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:14,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561269871] [2022-07-12 18:48:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:14,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:14,797 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:14,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 18:48:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:15,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 18:48:15,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:15,030 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:48:15,046 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:48:15,050 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:48:15,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:15,081 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 21 treesize of output 20 [2022-07-12 18:48:15,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:15,089 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 21 treesize of output 20 [2022-07-12 18:48:15,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:15,096 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 21 treesize of output 20 [2022-07-12 18:48:15,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:15,101 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 21 treesize of output 20 [2022-07-12 18:48:15,169 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:15,169 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 12 treesize of output 12 [2022-07-12 18:48:15,211 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 14 treesize of output 16 [2022-07-12 18:48:15,217 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 14 treesize of output 16 [2022-07-12 18:48:15,234 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 14 treesize of output 16 [2022-07-12 18:48:15,239 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 14 treesize of output 16 [2022-07-12 18:48:15,246 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 14 treesize of output 16 [2022-07-12 18:48:15,265 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 14 treesize of output 16 [2022-07-12 18:48:15,278 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 14 treesize of output 16 [2022-07-12 18:48:15,285 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 14 treesize of output 16 [2022-07-12 18:48:15,291 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 14 treesize of output 16 [2022-07-12 18:48:15,301 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 14 treesize of output 16 [2022-07-12 18:48:15,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:15,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:48:15,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:15,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:48:15,383 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 14 treesize of output 16 [2022-07-12 18:48:15,387 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 14 treesize of output 16 [2022-07-12 18:48:15,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:15,441 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 15 treesize of output 10 [2022-07-12 18:48:15,445 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:15,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:15,575 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (forall ((v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2022-07-12 18:48:15,588 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~first~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1319)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1320)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2022-07-12 18:48:15,633 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~first~0#1.base| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1315))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1316))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2022-07-12 18:48:15,707 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1316))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1321) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.offset|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1315))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1322) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|))))))) is different from false [2022-07-12 18:48:15,749 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|)))) (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1315))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1322) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1316))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1321) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|))))))) is different from false [2022-07-12 18:48:15,805 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1303)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1316))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1321) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|)))))) (forall ((v_ArrVal_1306 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|)))) (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1306)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1315))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1322) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-12 18:48:15,826 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1301 (_ BitVec 32)) (v_ArrVal_1303 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1320 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1301) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1303)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1316))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1320))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1321) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|)))))) (forall ((v_ArrVal_1306 (_ BitVec 32)) (v_ArrVal_1299 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_44| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_44|)))) (forall ((v_ArrVal_1319 (_ BitVec 32)) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1299) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1306)) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1315))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv12 32)) v_ArrVal_1319))) |v_ULTIMATE.start_main_~x~0#1.base_44| v_ArrVal_1322) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-12 18:48:15,867 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-07-12 18:48:15,867 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-07-12 18:48:15,871 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 60 treesize of output 52 [2022-07-12 18:48:15,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:48:15,888 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-07-12 18:48:15,889 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 1 [2022-07-12 18:48:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 18:48:15,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:15,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561269871] [2022-07-12 18:48:15,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561269871] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:15,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:15,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2022-07-12 18:48:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190468401] [2022-07-12 18:48:15,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:15,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:48:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:15,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:48:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=204, Unknown=7, NotChecked=238, Total=506 [2022-07-12 18:48:15,924 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:17,665 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2022-07-12 18:48:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:48:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-12 18:48:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:17,666 INFO L225 Difference]: With dead ends: 280 [2022-07-12 18:48:17,666 INFO L226 Difference]: Without dead ends: 280 [2022-07-12 18:48:17,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=754, Unknown=7, NotChecked=448, Total=1406 [2022-07-12 18:48:17,667 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1001 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:17,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 457 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 659 Invalid, 0 Unknown, 1001 Unchecked, 1.1s Time] [2022-07-12 18:48:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-12 18:48:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 210. [2022-07-12 18:48:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 194 states have (on average 1.3814432989690721) internal successors, (268), 209 states have internal predecessors, (268), 0 states have call successors, (0), 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:48:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2022-07-12 18:48:17,670 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 35 [2022-07-12 18:48:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:17,670 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2022-07-12 18:48:17,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2022-07-12 18:48:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:48:17,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:17,671 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, 1, 1, 1] [2022-07-12 18:48:17,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-12 18:48:17,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:17,875 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:17,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1792226092, now seen corresponding path program 1 times [2022-07-12 18:48:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:17,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443364104] [2022-07-12 18:48:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:17,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:17,877 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:17,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 18:48:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:18,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:48:18,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:18,039 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:48:18,052 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:48:18,082 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 17 treesize of output 9 [2022-07-12 18:48:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:18,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:18,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443364104] [2022-07-12 18:48:18,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443364104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:18,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:18,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:48:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605998646] [2022-07-12 18:48:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:48:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:48:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:48:18,110 INFO L87 Difference]: Start difference. First operand 210 states and 268 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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:48:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:18,772 INFO L93 Difference]: Finished difference Result 257 states and 312 transitions. [2022-07-12 18:48:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:48:18,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-07-12 18:48:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:18,773 INFO L225 Difference]: With dead ends: 257 [2022-07-12 18:48:18,773 INFO L226 Difference]: Without dead ends: 257 [2022-07-12 18:48:18,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:48:18,774 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:18,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 216 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:48:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-12 18:48:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2022-07-12 18:48:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 210 states have internal predecessors, (268), 0 states have call successors, (0), 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:48:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2022-07-12 18:48:18,776 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 35 [2022-07-12 18:48:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:18,776 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2022-07-12 18:48:18,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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:48:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2022-07-12 18:48:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:48:18,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:18,777 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, 1, 1, 1] [2022-07-12 18:48:18,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:18,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:18,977 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1792226093, now seen corresponding path program 1 times [2022-07-12 18:48:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:18,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290270518] [2022-07-12 18:48:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:18,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:18,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:18,979 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:18,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 18:48:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:19,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:48:19,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:19,137 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:48:19,167 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:48:19,170 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:48:19,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:19,230 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 17 treesize of output 9 [2022-07-12 18:48:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:19,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:19,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290270518] [2022-07-12 18:48:19,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290270518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:19,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:19,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:48:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680721120] [2022-07-12 18:48:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:19,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:48:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:48:19,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:48:19,277 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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:48:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:20,031 INFO L93 Difference]: Finished difference Result 253 states and 301 transitions. [2022-07-12 18:48:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:48:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-07-12 18:48:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:20,032 INFO L225 Difference]: With dead ends: 253 [2022-07-12 18:48:20,032 INFO L226 Difference]: Without dead ends: 253 [2022-07-12 18:48:20,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:48:20,033 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 134 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:20,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 249 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:48:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-12 18:48:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 213. [2022-07-12 18:48:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 198 states have (on average 1.3636363636363635) internal successors, (270), 212 states have internal predecessors, (270), 0 states have call successors, (0), 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:48:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2022-07-12 18:48:20,035 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 35 [2022-07-12 18:48:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:20,035 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2022-07-12 18:48:20,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 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:48:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2022-07-12 18:48:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:48:20,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:20,036 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, 1] [2022-07-12 18:48:20,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:20,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:20,243 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:20,244 INFO L85 PathProgramCache]: Analyzing trace with hash -629917055, now seen corresponding path program 1 times [2022-07-12 18:48:20,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:20,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472202170] [2022-07-12 18:48:20,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:20,245 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 18:48:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:20,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:48:20,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:20,488 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:48:20,491 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:48:20,555 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:48:20,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 18:48:20,571 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 18:48:20,571 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 18 treesize of output 25 [2022-07-12 18:48:20,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:20,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:48:20,640 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:20,640 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:48:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:20,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:27,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:27,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472202170] [2022-07-12 18:48:27,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472202170] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:27,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:27,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2022-07-12 18:48:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476309387] [2022-07-12 18:48:27,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:27,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:48:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:48:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:48:27,525 INFO L87 Difference]: Start difference. First operand 213 states and 270 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 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:48:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:27,920 INFO L93 Difference]: Finished difference Result 308 states and 385 transitions. [2022-07-12 18:48:27,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:48:27,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 18:48:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:27,922 INFO L225 Difference]: With dead ends: 308 [2022-07-12 18:48:27,922 INFO L226 Difference]: Without dead ends: 308 [2022-07-12 18:48:27,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:48:27,922 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 150 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:27,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 293 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 151 Invalid, 0 Unknown, 125 Unchecked, 0.3s Time] [2022-07-12 18:48:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-12 18:48:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 228. [2022-07-12 18:48:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 227 states have internal predecessors, (286), 0 states have call successors, (0), 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:48:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 286 transitions. [2022-07-12 18:48:27,925 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 286 transitions. Word has length 37 [2022-07-12 18:48:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:27,926 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 286 transitions. [2022-07-12 18:48:27,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 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:48:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 286 transitions. [2022-07-12 18:48:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:48:27,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:27,926 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, 1] [2022-07-12 18:48:27,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-12 18:48:28,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:28,140 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1127531811, now seen corresponding path program 2 times [2022-07-12 18:48:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676909683] [2022-07-12 18:48:28,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:48:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:28,142 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:28,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 18:48:28,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:48:28,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:48:28,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:48:28,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:28,392 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:48:28,396 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:48:28,442 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:48:28,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 18:48:28,469 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:28,469 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:48:28,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:28,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:48:28,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:28,564 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 12 treesize of output 12 [2022-07-12 18:48:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:48:28,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:30,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:30,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 59 [2022-07-12 18:48:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:48:33,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:33,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676909683] [2022-07-12 18:48:33,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676909683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:33,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:33,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2022-07-12 18:48:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199365996] [2022-07-12 18:48:33,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:33,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:48:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:33,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:48:33,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=79, Unknown=2, NotChecked=0, Total=110 [2022-07-12 18:48:33,375 INFO L87 Difference]: Start difference. First operand 228 states and 286 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 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:48:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:33,749 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2022-07-12 18:48:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:48:33,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 18:48:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:33,750 INFO L225 Difference]: With dead ends: 247 [2022-07-12 18:48:33,750 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 18:48:33,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=69, Invalid=139, Unknown=2, NotChecked=0, Total=210 [2022-07-12 18:48:33,751 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 254 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:33,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 192 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2022-07-12 18:48:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 18:48:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 183. [2022-07-12 18:48:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 169 states have (on average 1.3846153846153846) internal successors, (234), 182 states have internal predecessors, (234), 0 states have call successors, (0), 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:48:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-07-12 18:48:33,753 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 37 [2022-07-12 18:48:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:33,754 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-07-12 18:48:33,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 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:48:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-07-12 18:48:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:48:33,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:33,754 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:33,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-12 18:48:33,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:33,964 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:33,964 INFO L85 PathProgramCache]: Analyzing trace with hash 373585119, now seen corresponding path program 1 times [2022-07-12 18:48:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:33,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426975429] [2022-07-12 18:48:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:33,966 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:33,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 18:48:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:34,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:48:34,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:34,130 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:48:34,146 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:34,147 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:48:34,164 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:48:34,200 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 16 treesize of output 8 [2022-07-12 18:48:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:34,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:34,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:34,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426975429] [2022-07-12 18:48:34,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426975429] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:34,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:34,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-12 18:48:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340220593] [2022-07-12 18:48:34,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:34,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:48:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:34,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:48:34,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:48:34,256 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:34,936 INFO L93 Difference]: Finished difference Result 239 states and 273 transitions. [2022-07-12 18:48:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:48:34,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 18:48:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:34,938 INFO L225 Difference]: With dead ends: 239 [2022-07-12 18:48:34,938 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 18:48:34,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:48:34,938 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 169 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:34,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 295 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:48:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 18:48:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 183. [2022-07-12 18:48:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 169 states have (on average 1.378698224852071) internal successors, (233), 182 states have internal predecessors, (233), 0 states have call successors, (0), 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:48:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2022-07-12 18:48:34,943 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 38 [2022-07-12 18:48:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:34,943 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2022-07-12 18:48:34,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2022-07-12 18:48:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:48:34,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:34,944 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:34,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:35,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:35,152 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1469153886, now seen corresponding path program 1 times [2022-07-12 18:48:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569141619] [2022-07-12 18:48:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:35,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:35,154 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:35,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 18:48:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:35,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 18:48:35,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:35,475 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 13 treesize of output 9 [2022-07-12 18:48:35,502 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:48:35,515 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 18:48:35,516 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 18 treesize of output 28 [2022-07-12 18:48:35,527 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:48:35,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:35,649 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 27 treesize of output 18 [2022-07-12 18:48:35,656 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:35,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:35,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:36,102 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvslt (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv16 32)) (= |ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (or (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv16 32))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|))) is different from false [2022-07-12 18:48:36,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:36,129 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-12 18:48:36,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:36,134 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 22 treesize of output 10 [2022-07-12 18:48:36,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:36,194 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-12 18:48:36,221 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 26 [2022-07-12 18:48:36,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:48:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:38,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:38,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569141619] [2022-07-12 18:48:38,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569141619] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:38,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:38,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-12 18:48:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262137616] [2022-07-12 18:48:38,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:38,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:48:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:48:38,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=451, Unknown=1, NotChecked=42, Total=552 [2022-07-12 18:48:38,043 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 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:48:39,955 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvslt (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv16 32)) (= |ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~c2~0#1| (_ bv1 32)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv1 32)) (= |c_ULTIMATE.start_main_~c1~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~y~0#1.offset| (_ bv0 32)) (or (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv16 32))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|))) is different from false [2022-07-12 18:48:41,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvslt (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv16 32)) (= |ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) .cse0 (or (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_ArrVal_1798 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~y~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~y~0#1.offset|)) (_ bv16 32))) .cse0) (bvslt (bvmul |c_ULTIMATE.start_main_~c2~0#1| |c_ULTIMATE.start_main_~c1~0#1|) (_ bv16 32)))) is different from false [2022-07-12 18:48:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:42,992 INFO L93 Difference]: Finished difference Result 266 states and 320 transitions. [2022-07-12 18:48:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:48:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 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 38 [2022-07-12 18:48:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:42,993 INFO L225 Difference]: With dead ends: 266 [2022-07-12 18:48:42,993 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 18:48:42,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=214, Invalid=1277, Unknown=3, NotChecked=228, Total=1722 [2022-07-12 18:48:42,993 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 291 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:42,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 435 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 905 Invalid, 0 Unknown, 116 Unchecked, 2.9s Time] [2022-07-12 18:48:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 18:48:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2022-07-12 18:48:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 194 states have (on average 1.3402061855670102) internal successors, (260), 207 states have internal predecessors, (260), 0 states have call successors, (0), 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:48:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2022-07-12 18:48:42,996 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 38 [2022-07-12 18:48:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:42,997 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2022-07-12 18:48:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 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:48:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2022-07-12 18:48:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:48:42,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:42,997 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:43,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:43,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:43,207 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1469146581, now seen corresponding path program 1 times [2022-07-12 18:48:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:43,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419773475] [2022-07-12 18:48:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:43,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:43,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:43,209 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:43,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-12 18:48:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:43,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:48:43,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:43,475 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:48:43,579 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 15 treesize of output 7 [2022-07-12 18:48:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:43,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:43,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:43,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419773475] [2022-07-12 18:48:43,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419773475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:43,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:43,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:48:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952423943] [2022-07-12 18:48:43,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:43,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:48:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:48:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:48:43,696 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:44,705 INFO L93 Difference]: Finished difference Result 239 states and 284 transitions. [2022-07-12 18:48:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:48:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 18:48:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:44,706 INFO L225 Difference]: With dead ends: 239 [2022-07-12 18:48:44,706 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 18:48:44,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:48:44,707 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:44,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 200 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 166 Invalid, 0 Unknown, 191 Unchecked, 0.6s Time] [2022-07-12 18:48:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 18:48:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-07-12 18:48:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 208 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 261 transitions. [2022-07-12 18:48:44,709 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 261 transitions. Word has length 38 [2022-07-12 18:48:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:44,710 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 261 transitions. [2022-07-12 18:48:44,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2022-07-12 18:48:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:48:44,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:44,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:44,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-07-12 18:48:44,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:44,918 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 415323279, now seen corresponding path program 1 times [2022-07-12 18:48:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896351470] [2022-07-12 18:48:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:44,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:44,920 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:44,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-12 18:48:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:45,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:48:45,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:45,129 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:48:45,172 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 18:48:45,173 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 18 treesize of output 25 [2022-07-12 18:48:45,286 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:48:45,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:48:45,328 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 18:48:45,390 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 31 treesize of output 13 [2022-07-12 18:48:45,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 19 [2022-07-12 18:48:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:45,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:45,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1953 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_1953) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1952) |c_ULTIMATE.start_main_~first~0#1.base|) (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32)))) (_ bv1 1))) is different from false [2022-07-12 18:48:45,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:45,572 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 18:48:45,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:45,582 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 46 treesize of output 49 [2022-07-12 18:48:45,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:48:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:46,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:46,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896351470] [2022-07-12 18:48:46,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896351470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:46,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:46,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-12 18:48:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523527797] [2022-07-12 18:48:46,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:46,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:48:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:46,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:48:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2022-07-12 18:48:46,123 INFO L87 Difference]: Start difference. First operand 209 states and 261 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:46,482 INFO L93 Difference]: Finished difference Result 252 states and 307 transitions. [2022-07-12 18:48:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:48:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 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 39 [2022-07-12 18:48:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:46,483 INFO L225 Difference]: With dead ends: 252 [2022-07-12 18:48:46,483 INFO L226 Difference]: Without dead ends: 252 [2022-07-12 18:48:46,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=439, Unknown=1, NotChecked=44, Total=600 [2022-07-12 18:48:46,484 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:46,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 310 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 425 Unchecked, 0.2s Time] [2022-07-12 18:48:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-12 18:48:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 234. [2022-07-12 18:48:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 220 states have (on average 1.3227272727272728) internal successors, (291), 233 states have internal predecessors, (291), 0 states have call successors, (0), 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:48:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-07-12 18:48:46,486 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 39 [2022-07-12 18:48:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:46,486 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-07-12 18:48:46,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-07-12 18:48:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:48:46,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:46,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:46,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-12 18:48:46,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:46,688 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash 415323280, now seen corresponding path program 1 times [2022-07-12 18:48:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:46,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065811261] [2022-07-12 18:48:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:46,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:46,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:46,689 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:46,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-12 18:48:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:46,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:48:46,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:46,927 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:48:46,973 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:48:46,990 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:46,991 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 12 treesize of output 12 [2022-07-12 18:48:47,127 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:48:47,134 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:48:47,176 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:48:47,176 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-12 18:48:47,181 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 22 treesize of output 24 [2022-07-12 18:48:47,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:48:47,238 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 25 treesize of output 13 [2022-07-12 18:48:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:47,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:47,530 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2038 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) (_ bv16 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))))) (forall ((v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~first~0#1.base|) (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32))))) (bvule (bvadd .cse1 (_ bv12 32)) (bvadd .cse1 (_ bv16 32)))))) is different from false [2022-07-12 18:48:47,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:47,541 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-07-12 18:48:47,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:47,555 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 54 treesize of output 51 [2022-07-12 18:48:47,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 18:48:47,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:47,586 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-12 18:48:47,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:47,595 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-12 18:48:47,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:47,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:47,604 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-12 18:48:47,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:48:47,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:47,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 18:48:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:47,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065811261] [2022-07-12 18:48:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065811261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:47,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-07-12 18:48:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068002205] [2022-07-12 18:48:47,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:47,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:48:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:48:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2022-07-12 18:48:47,912 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 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:48:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:49,501 INFO L93 Difference]: Finished difference Result 304 states and 366 transitions. [2022-07-12 18:48:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:48:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 18:48:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:49,502 INFO L225 Difference]: With dead ends: 304 [2022-07-12 18:48:49,502 INFO L226 Difference]: Without dead ends: 304 [2022-07-12 18:48:49,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=334, Unknown=1, NotChecked=38, Total=462 [2022-07-12 18:48:49,502 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 139 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:49,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 633 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 623 Invalid, 0 Unknown, 145 Unchecked, 1.3s Time] [2022-07-12 18:48:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-12 18:48:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 278. [2022-07-12 18:48:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 264 states have (on average 1.3409090909090908) internal successors, (354), 277 states have internal predecessors, (354), 0 states have call successors, (0), 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:48:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 354 transitions. [2022-07-12 18:48:49,505 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 354 transitions. Word has length 39 [2022-07-12 18:48:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:49,506 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 354 transitions. [2022-07-12 18:48:49,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 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:48:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 354 transitions. [2022-07-12 18:48:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:48:49,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:49,510 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, 1, 1, 1, 1] [2022-07-12 18:48:49,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:49,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:49,719 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:49,719 INFO L85 PathProgramCache]: Analyzing trace with hash -9880553, now seen corresponding path program 1 times [2022-07-12 18:48:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:49,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549816792] [2022-07-12 18:48:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:49,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:49,721 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:49,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-12 18:48:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:49,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:48:49,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:49,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:50,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549816792] [2022-07-12 18:48:50,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549816792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:50,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:50,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:48:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117453102] [2022-07-12 18:48:50,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:50,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:48:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:48:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:48:50,026 INFO L87 Difference]: Start difference. First operand 278 states and 354 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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:48:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:50,189 INFO L93 Difference]: Finished difference Result 332 states and 400 transitions. [2022-07-12 18:48:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:48:50,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 40 [2022-07-12 18:48:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:50,190 INFO L225 Difference]: With dead ends: 332 [2022-07-12 18:48:50,190 INFO L226 Difference]: Without dead ends: 332 [2022-07-12 18:48:50,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:48:50,191 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 354 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:50,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 401 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:48:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-12 18:48:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 301. [2022-07-12 18:48:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 287 states have (on average 1.3797909407665505) internal successors, (396), 300 states have internal predecessors, (396), 0 states have call successors, (0), 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:48:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 396 transitions. [2022-07-12 18:48:50,194 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 396 transitions. Word has length 40 [2022-07-12 18:48:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:50,194 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 396 transitions. [2022-07-12 18:48:50,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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:48:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 396 transitions. [2022-07-12 18:48:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:48:50,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:50,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-07-12 18:48:50,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:50,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:50,399 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash -306285040, now seen corresponding path program 1 times [2022-07-12 18:48:50,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:50,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51382895] [2022-07-12 18:48:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:50,401 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:50,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-12 18:48:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:50,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:48:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 18:48:50,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:48:50,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:50,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51382895] [2022-07-12 18:48:50,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51382895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:48:50,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:48:50,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:48:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564690144] [2022-07-12 18:48:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:48:50,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:48:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:48:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:48:50,582 INFO L87 Difference]: Start difference. First operand 301 states and 396 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:50,699 INFO L93 Difference]: Finished difference Result 323 states and 419 transitions. [2022-07-12 18:48:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:48:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:48:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:50,700 INFO L225 Difference]: With dead ends: 323 [2022-07-12 18:48:50,700 INFO L226 Difference]: Without dead ends: 323 [2022-07-12 18:48:50,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:48:50,701 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:50,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:48:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-12 18:48:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 300. [2022-07-12 18:48:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 287 states have (on average 1.372822299651568) internal successors, (394), 299 states have internal predecessors, (394), 0 states have call successors, (0), 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:48:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 394 transitions. [2022-07-12 18:48:50,704 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 394 transitions. Word has length 41 [2022-07-12 18:48:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:50,704 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 394 transitions. [2022-07-12 18:48:50,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 394 transitions. [2022-07-12 18:48:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:48:50,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:50,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-07-12 18:48:50,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-07-12 18:48:50,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:50,905 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -306285039, now seen corresponding path program 1 times [2022-07-12 18:48:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:50,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209148904] [2022-07-12 18:48:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:50,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:50,907 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:50,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-12 18:48:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:51,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 18:48:51,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:51,146 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:48:51,183 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:48:51,183 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 12 treesize of output 12 [2022-07-12 18:48:51,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-12 18:48:51,310 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:48:51,317 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:48:51,349 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:48:51,349 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-12 18:48:51,354 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 22 treesize of output 24 [2022-07-12 18:48:51,403 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 31 treesize of output 13 [2022-07-12 18:48:51,406 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 19 treesize of output 7 [2022-07-12 18:48:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:51,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:48:51,740 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2277) |c_ULTIMATE.start_main_~first~0#1.base|) (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_2277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2277) |c_ULTIMATE.start_main_~first~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_main_~first~0#1.base|) .cse1)))))) is different from false [2022-07-12 18:48:51,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:51,759 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-12 18:48:51,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:51,768 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-12 18:48:51,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:51,785 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 62 treesize of output 65 [2022-07-12 18:48:51,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:51,802 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 96 treesize of output 93 [2022-07-12 18:48:51,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-07-12 18:48:51,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-07-12 18:48:52,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:52,716 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-07-12 18:48:52,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:48:52,736 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 50 treesize of output 47 [2022-07-12 18:48:52,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 18:48:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:48:56,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:48:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209148904] [2022-07-12 18:48:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209148904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:48:56,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:48:56,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-07-12 18:48:56,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459205470] [2022-07-12 18:48:56,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:48:56,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:48:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:48:56,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:48:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=204, Unknown=1, NotChecked=28, Total=272 [2022-07-12 18:48:56,686 INFO L87 Difference]: Start difference. First operand 300 states and 394 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:48:59,206 INFO L93 Difference]: Finished difference Result 349 states and 416 transitions. [2022-07-12 18:48:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:48:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:48:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:48:59,207 INFO L225 Difference]: With dead ends: 349 [2022-07-12 18:48:59,207 INFO L226 Difference]: Without dead ends: 349 [2022-07-12 18:48:59,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=118, Invalid=587, Unknown=1, NotChecked=50, Total=756 [2022-07-12 18:48:59,208 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 231 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:48:59,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 563 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 893 Invalid, 0 Unknown, 253 Unchecked, 2.1s Time] [2022-07-12 18:48:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-12 18:48:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 300. [2022-07-12 18:48:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 287 states have (on average 1.362369337979094) internal successors, (391), 299 states have internal predecessors, (391), 0 states have call successors, (0), 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:48:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 391 transitions. [2022-07-12 18:48:59,211 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 391 transitions. Word has length 41 [2022-07-12 18:48:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:48:59,211 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 391 transitions. [2022-07-12 18:48:59,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:48:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 391 transitions. [2022-07-12 18:48:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:48:59,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:48:59,212 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:48:59,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-12 18:48:59,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:48:59,423 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:48:59,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:48:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1629209681, now seen corresponding path program 1 times [2022-07-12 18:48:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:48:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421370851] [2022-07-12 18:48:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:48:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:48:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:48:59,426 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:48:59,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-12 18:48:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:48:59,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 18:48:59,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:48:59,704 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:48:59,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:59,716 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 21 treesize of output 20 [2022-07-12 18:48:59,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:59,722 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 21 treesize of output 20 [2022-07-12 18:48:59,777 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:48:59,777 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:48:59,849 INFO L356 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2022-07-12 18:48:59,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2022-07-12 18:48:59,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:48:59,868 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:48:59,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:59,898 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 25 treesize of output 24 [2022-07-12 18:48:59,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:48:59,909 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 25 treesize of output 24 [2022-07-12 18:48:59,919 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:48:59,933 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:48:59,933 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 26 [2022-07-12 18:49:00,060 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:49:00,167 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:49:00,168 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 17 [2022-07-12 18:49:00,226 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 15 treesize of output 17 [2022-07-12 18:49:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:00,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:49:00,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:49:00,598 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 44 treesize of output 48 [2022-07-12 18:49:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:01,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:49:01,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421370851] [2022-07-12 18:49:01,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421370851] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:49:01,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:49:01,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2022-07-12 18:49:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186578401] [2022-07-12 18:49:01,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:49:01,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 18:49:01,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:49:01,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 18:49:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:49:01,576 INFO L87 Difference]: Start difference. First operand 300 states and 391 transitions. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 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:49:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:49:04,266 INFO L93 Difference]: Finished difference Result 598 states and 787 transitions. [2022-07-12 18:49:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 18:49:04,267 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:49:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:49:04,268 INFO L225 Difference]: With dead ends: 598 [2022-07-12 18:49:04,268 INFO L226 Difference]: Without dead ends: 598 [2022-07-12 18:49:04,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=286, Invalid=2264, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 18:49:04,269 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 295 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:49:04,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 791 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1083 Invalid, 0 Unknown, 204 Unchecked, 1.7s Time] [2022-07-12 18:49:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-07-12 18:49:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 305. [2022-07-12 18:49:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 292 states have (on average 1.3630136986301369) internal successors, (398), 304 states have internal predecessors, (398), 0 states have call successors, (0), 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:49:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 398 transitions. [2022-07-12 18:49:04,273 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 398 transitions. Word has length 41 [2022-07-12 18:49:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:49:04,273 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 398 transitions. [2022-07-12 18:49:04,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 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:49:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 398 transitions. [2022-07-12 18:49:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:49:04,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:49:04,274 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:49:04,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-12 18:49:04,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:49:04,488 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:49:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:49:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1629209682, now seen corresponding path program 1 times [2022-07-12 18:49:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:49:04,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692590208] [2022-07-12 18:49:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:49:04,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:49:04,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:49:04,490 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:49:04,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-12 18:49:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:49:04,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 18:49:04,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:49:04,799 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:49:04,802 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:49:04,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:04,816 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 21 treesize of output 20 [2022-07-12 18:49:04,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:04,821 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 21 treesize of output 20 [2022-07-12 18:49:04,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:04,828 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 21 treesize of output 20 [2022-07-12 18:49:04,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:04,833 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 21 treesize of output 20 [2022-07-12 18:49:04,896 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:49:04,897 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:49:04,914 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:49:04,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:49:05,020 INFO L356 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2022-07-12 18:49:05,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2022-07-12 18:49:05,046 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-12 18:49:05,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 41 [2022-07-12 18:49:05,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:49:05,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:49:05,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:49:05,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:49:05,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:05,149 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 33 treesize of output 32 [2022-07-12 18:49:05,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:05,152 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 33 treesize of output 32 [2022-07-12 18:49:05,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:05,176 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 33 treesize of output 32 [2022-07-12 18:49:05,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:49:05,180 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 33 treesize of output 32 [2022-07-12 18:49:05,208 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:49:05,209 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 31 treesize of output 34 [2022-07-12 18:49:05,223 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 18:49:05,223 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 35 treesize of output 42 [2022-07-12 18:49:05,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:49:05,487 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-12 18:49:05,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 38 [2022-07-12 18:49:05,494 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:49:05,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 18:49:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:05,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:49:20,366 INFO L356 Elim1Store]: treesize reduction 174, result has 22.7 percent of original size [2022-07-12 18:49:20,366 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 64 [2022-07-12 18:49:20,401 INFO L356 Elim1Store]: treesize reduction 49, result has 30.0 percent of original size [2022-07-12 18:49:20,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 67 [2022-07-12 18:49:20,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-12 18:49:20,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:49:20,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:49:20,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:49:20,427 INFO L356 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2022-07-12 18:49:20,427 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 1 [2022-07-12 18:49:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:20,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:49:20,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692590208] [2022-07-12 18:49:20,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692590208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:49:20,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:49:20,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2022-07-12 18:49:20,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588688924] [2022-07-12 18:49:20,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:49:20,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 18:49:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:49:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 18:49:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=817, Unknown=102, NotChecked=0, Total=1056 [2022-07-12 18:49:20,433 INFO L87 Difference]: Start difference. First operand 305 states and 398 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 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:49:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:49:23,394 INFO L93 Difference]: Finished difference Result 589 states and 804 transitions. [2022-07-12 18:49:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:49:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-12 18:49:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:49:23,395 INFO L225 Difference]: With dead ends: 589 [2022-07-12 18:49:23,395 INFO L226 Difference]: Without dead ends: 589 [2022-07-12 18:49:23,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=342, Invalid=2094, Unknown=114, NotChecked=0, Total=2550 [2022-07-12 18:49:23,396 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 442 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:49:23,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 770 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 586 Invalid, 0 Unknown, 387 Unchecked, 1.4s Time] [2022-07-12 18:49:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-07-12 18:49:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 304. [2022-07-12 18:49:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 291 states have (on average 1.3573883161512028) internal successors, (395), 303 states have internal predecessors, (395), 0 states have call successors, (0), 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:49:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 395 transitions. [2022-07-12 18:49:23,400 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 395 transitions. Word has length 41 [2022-07-12 18:49:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:49:23,400 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 395 transitions. [2022-07-12 18:49:23,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 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:49:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 395 transitions. [2022-07-12 18:49:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:49:23,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:49:23,401 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:49:23,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-07-12 18:49:23,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:49:23,609 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:49:23,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:49:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1689090474, now seen corresponding path program 1 times [2022-07-12 18:49:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:49:23,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163376044] [2022-07-12 18:49:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:49:23,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:49:23,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:49:23,610 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:49:23,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-12 18:49:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:49:23,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:49:23,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:49:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:49:23,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:49:24,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:49:24,051 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 24 treesize of output 28 [2022-07-12 18:49:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:49:24,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:49:24,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163376044] [2022-07-12 18:49:24,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163376044] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:49:24,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:49:24,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 18:49:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673671394] [2022-07-12 18:49:24,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:49:24,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:49:24,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:49:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:49:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:49:24,399 INFO L87 Difference]: Start difference. First operand 304 states and 395 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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:49:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:49:24,815 INFO L93 Difference]: Finished difference Result 321 states and 413 transitions. [2022-07-12 18:49:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:49:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 18:49:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:49:24,816 INFO L225 Difference]: With dead ends: 321 [2022-07-12 18:49:24,816 INFO L226 Difference]: Without dead ends: 321 [2022-07-12 18:49:24,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:49:24,817 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 176 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:49:24,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 154 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:49:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-12 18:49:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 304. [2022-07-12 18:49:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 291 states have (on average 1.3539518900343643) internal successors, (394), 303 states have internal predecessors, (394), 0 states have call successors, (0), 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:49:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 394 transitions. [2022-07-12 18:49:24,819 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 394 transitions. Word has length 42 [2022-07-12 18:49:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:49:24,819 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 394 transitions. [2022-07-12 18:49:24,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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:49:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 394 transitions. [2022-07-12 18:49:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:49:24,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:49:24,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:49:24,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-07-12 18:49:25,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:49:25,028 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:49:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:49:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1992593462, now seen corresponding path program 1 times [2022-07-12 18:49:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:49:25,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305163711] [2022-07-12 18:49:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:49:25,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:49:25,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:49:25,030 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:49:25,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-12 18:49:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:49:25,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:49:25,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:49:25,326 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:49:25,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:49:25,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:49:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:25,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:49:25,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-12 18:49:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:25,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:49:25,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305163711] [2022-07-12 18:49:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305163711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:49:25,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:49:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-12 18:49:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351130671] [2022-07-12 18:49:25,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:49:25,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:49:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:49:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:49:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:49:25,701 INFO L87 Difference]: Start difference. First operand 304 states and 394 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:49:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:49:27,216 INFO L93 Difference]: Finished difference Result 472 states and 603 transitions. [2022-07-12 18:49:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:49:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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 43 [2022-07-12 18:49:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:49:27,218 INFO L225 Difference]: With dead ends: 472 [2022-07-12 18:49:27,218 INFO L226 Difference]: Without dead ends: 472 [2022-07-12 18:49:27,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1078, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 18:49:27,218 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 260 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:49:27,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 320 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 18:49:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-12 18:49:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 339. [2022-07-12 18:49:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 326 states have (on average 1.3680981595092025) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 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:49:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2022-07-12 18:49:27,223 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 43 [2022-07-12 18:49:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:49:27,223 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2022-07-12 18:49:27,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:49:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2022-07-12 18:49:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:49:27,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:49:27,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:49:27,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-12 18:49:27,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:49:27,434 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-07-12 18:49:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:49:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2027012193, now seen corresponding path program 1 times [2022-07-12 18:49:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:49:27,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510819891] [2022-07-12 18:49:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:49:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:49:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:49:27,435 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:49:27,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-12 18:49:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:49:27,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 18:49:27,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:49:27,706 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:49:27,741 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:49:27,741 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 12 treesize of output 12 [2022-07-12 18:49:27,783 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:49:27,817 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:49:27,818 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:49:27,841 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:49:27,841 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:49:27,881 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 21 treesize of output 20 [2022-07-12 18:49:27,891 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:49:27,943 INFO L356 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-07-12 18:49:27,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 54 [2022-07-12 18:49:27,949 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 38 treesize of output 40 [2022-07-12 18:49:27,987 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 35 treesize of output 23 [2022-07-12 18:49:28,227 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 18:49:28,227 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 19 [2022-07-12 18:49:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:49:28,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:49:28,313 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-12 18:49:28,313 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 16 treesize of output 15 [2022-07-12 18:49:29,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2721 (_ BitVec 32)) (v_ArrVal_2722 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2721))) (.cse2 (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2722) |c_ULTIMATE.start_main_~first~0#1.base|) .cse2)))))) is different from false [2022-07-12 18:49:29,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:49:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 129 [2022-07-12 18:49:29,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:49:29,081 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 248 treesize of output 251 [2022-07-12 18:49:29,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2022-07-12 18:49:49,220 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 51 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:49:51,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2721 (_ BitVec 32)) (v_arrayElimCell_227 (_ BitVec 32)) (v_ArrVal_2715 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2715)))) (store .cse12 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse11 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2721))))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~first~0#1.base|) (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32))))) (= .cse9 (select (select .cse10 .cse9) v_arrayElimCell_227))))))) (and (or (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) .cse0) (or (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|) .cse0) (or (not (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2721 (_ BitVec 32)) (v_ArrVal_2715 (_ BitVec 32)) (v_arrayElimCell_229 (_ BitVec 32))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2715)))) (store .cse4 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2721))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32))))) (= (select (select .cse1 .cse2) v_arrayElimCell_229) .cse2))))) (forall ((v_ArrVal_2721 (_ BitVec 32)) (v_ArrVal_2715 (_ BitVec 32))) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2715)))) (store .cse8 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~last~0#1.base|) (bvadd |c_ULTIMATE.start_main_~last~0#1.offset| (_ bv12 32)) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse7 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2721))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~first~0#1.base|) (bvadd |c_ULTIMATE.start_main_~first~0#1.offset| (_ bv12 32))))) (= .cse5 (select (select .cse6 .cse5) |c_ULTIMATE.start_main_~x~0#1.offset|))))))) is different from false [2022-07-12 18:50:29,849 WARN L233 SmtUtils]: Spent 12.45s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:50:29,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:50:30,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:50:30,337 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 166308565 treesize of output 163785674