./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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-simple/sll2n_append_unequal.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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:25:00,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:25:00,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:25:00,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:25:00,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:25:00,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:25:00,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:25:00,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:25:00,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:25:00,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:25:00,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:25:00,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:25:00,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:25:00,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:25:00,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:25:00,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:25:00,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:25:00,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:25:00,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:25:00,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:25:00,275 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:25:00,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:25:00,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:25:00,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:25:00,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:25:00,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:25:00,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:25:00,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:25:00,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:25:00,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:25:00,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:25:00,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:25:00,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:25:00,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:25:00,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:25:00,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:25:00,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:25:00,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:25:00,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:25:00,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:25:00,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:25:00,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:25:00,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:25:00,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:25:00,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:25:00,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:25:00,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:25:00,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:25:00,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:25:00,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:25:00,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:25:00,321 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:25:00,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:25:00,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:25:00,322 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:25:00,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:25:00,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:25:00,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:25:00,323 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:25:00,323 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:25:00,323 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:25:00,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:25:00,324 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:25:00,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:25:00,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:25:00,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:25:00,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:25:00,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:25:00,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:25:00,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:25:00,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:25:00,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:25:00,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:25:00,326 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2022-07-20 06:25:00,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:25:00,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:25:00,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:25:00,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:25:00,597 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:25:00,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-07-20 06:25:00,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb67c3e13/b7e9455684364b29ad62ccbb0ff52362/FLAGb4d0a77b8 [2022-07-20 06:25:01,065 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:25:01,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-07-20 06:25:01,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb67c3e13/b7e9455684364b29ad62ccbb0ff52362/FLAGb4d0a77b8 [2022-07-20 06:25:01,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb67c3e13/b7e9455684364b29ad62ccbb0ff52362 [2022-07-20 06:25:01,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:25:01,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:25:01,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:25:01,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:25:01,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:25:01,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb8a257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01, skipping insertion in model container [2022-07-20 06:25:01,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:25:01,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:25:01,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-07-20 06:25:01,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:25:01,394 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:25:01,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-07-20 06:25:01,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:25:01,463 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:25:01,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01 WrapperNode [2022-07-20 06:25:01,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:25:01,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:25:01,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:25:01,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:25:01,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,532 INFO L137 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-07-20 06:25:01,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:25:01,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:25:01,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:25:01,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:25:01,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:25:01,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:25:01,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:25:01,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:25:01,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (1/1) ... [2022-07-20 06:25:01,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:25:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:01,599 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-20 06:25:01,601 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-20 06:25:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:25:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:25:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:25:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:25:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:25:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:25:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:25:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:25:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:25:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:25:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:25:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:25:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:25:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:25:01,721 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:25:01,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:25:02,043 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:25:02,049 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:25:02,049 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 06:25:02,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:25:02 BoogieIcfgContainer [2022-07-20 06:25:02,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:25:02,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:25:02,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:25:02,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:25:02,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:25:01" (1/3) ... [2022-07-20 06:25:02,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762e650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:25:02, skipping insertion in model container [2022-07-20 06:25:02,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:01" (2/3) ... [2022-07-20 06:25:02,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762e650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:25:02, skipping insertion in model container [2022-07-20 06:25:02,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:25:02" (3/3) ... [2022-07-20 06:25:02,058 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-07-20 06:25:02,070 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:25:02,071 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-07-20 06:25:02,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:25:02,115 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@667046aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ad7a75b [2022-07-20 06:25:02,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-07-20 06:25:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:25:02,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:02,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:02,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:02,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2022-07-20 06:25:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:02,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410422976] [2022-07-20 06:25:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:02,294 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-20 06:25:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410422976] [2022-07-20 06:25:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410422976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:02,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893228450] [2022-07-20 06:25:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:02,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:02,333 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:02,448 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-20 06:25:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:02,450 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:25:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:02,455 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:25:02,455 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:25:02,457 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-20 06:25:02,459 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:02,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:25:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-20 06:25:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-20 06:25:02,489 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2022-07-20 06:25:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:02,490 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-20 06:25:02,490 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-20 06:25:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:25:02,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:02,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:02,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:25:02,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2022-07-20 06:25:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891166794] [2022-07-20 06:25:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:02,542 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-20 06:25:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:02,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891166794] [2022-07-20 06:25:02,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891166794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:02,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:02,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600614595] [2022-07-20 06:25:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:02,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:02,546 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:02,598 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-07-20 06:25:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:02,598 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:25:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:02,600 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:25:02,600 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:25:02,600 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-20 06:25:02,601 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:02,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:25:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:25:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-20 06:25:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-07-20 06:25:02,622 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2022-07-20 06:25:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:02,624 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-07-20 06:25:02,624 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-07-20 06:25:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:25:02,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:02,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:02,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:25:02,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2022-07-20 06:25:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:02,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430128384] [2022-07-20 06:25:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:25:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:02,795 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-20 06:25:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430128384] [2022-07-20 06:25:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430128384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:02,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:02,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:25:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408336021] [2022-07-20 06:25:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:25:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:25:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:25:02,800 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:03,000 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-07-20 06:25:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:25:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-20 06:25:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:03,003 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:25:03,003 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:25:03,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:25:03,005 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:03,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:25:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:25:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-07-20 06:25:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-20 06:25:03,013 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2022-07-20 06:25:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:03,014 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-20 06:25:03,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-20 06:25:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:25:03,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:03,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:03,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:25:03,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2022-07-20 06:25:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39622034] [2022-07-20 06:25:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:25:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,141 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-20 06:25:03,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:03,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39622034] [2022-07-20 06:25:03,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39622034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:03,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:03,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:25:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76139630] [2022-07-20 06:25:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:03,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:25:03,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:25:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:25:03,143 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:03,339 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-07-20 06:25:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:25:03,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-20 06:25:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:03,340 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:25:03,340 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 06:25:03,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:25:03,342 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:03,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 361 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:25:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 06:25:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-07-20 06:25:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-20 06:25:03,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2022-07-20 06:25:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:03,348 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-20 06:25:03,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-20 06:25:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:25:03,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:03,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:03,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:25:03,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2022-07-20 06:25:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:03,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861833835] [2022-07-20 06:25:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 06:25:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,392 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-20 06:25:03,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:03,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861833835] [2022-07-20 06:25:03,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861833835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:03,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:03,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:25:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579466306] [2022-07-20 06:25:03,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:03,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:25:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:25:03,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:25:03,395 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:03,468 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-07-20 06:25:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:25:03,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-20 06:25:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:03,471 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:25:03,471 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:25:03,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:25:03,472 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:03,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:25:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-07-20 06:25:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-20 06:25:03,478 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2022-07-20 06:25:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:03,478 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-20 06:25:03,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-20 06:25:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:25:03,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:03,479 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] [2022-07-20 06:25:03,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:25:03,480 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1411001534, now seen corresponding path program 1 times [2022-07-20 06:25:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191486838] [2022-07-20 06:25:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:25:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:25:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:25:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191486838] [2022-07-20 06:25:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191486838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009774718] [2022-07-20 06:25:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:03,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:03,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:03,584 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-20 06:25:03,610 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-20 06:25:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:03,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:25:03,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:25:03,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:25:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009774718] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:03,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:03,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-20 06:25:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969379441] [2022-07-20 06:25:03,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:03,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:25:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:25:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:25:03,818 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:25:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:03,917 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-20 06:25:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:25:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-20 06:25:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:03,919 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:25:03,919 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:25:03,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:25:03,920 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:03,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 310 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:25:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-20 06:25:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-07-20 06:25:03,926 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2022-07-20 06:25:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:03,926 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-20 06:25:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:25:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-07-20 06:25:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:25:03,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:03,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:03,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:04,153 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,SelfDestructingSolverStorable5 [2022-07-20 06:25:04,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:04,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 2 times [2022-07-20 06:25:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240301452] [2022-07-20 06:25:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:25:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 06:25:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 06:25:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:25:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:04,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240301452] [2022-07-20 06:25:04,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240301452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72692342] [2022-07-20 06:25:04,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:25:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:04,439 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-20 06:25:04,441 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-20 06:25:04,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:25:04,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:25:04,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 06:25:04,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:04,593 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-20 06:25:04,614 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-20 06:25:04,666 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:04,667 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 14 [2022-07-20 06:25:04,710 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-20 06:25:04,899 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:25:04,900 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 14 [2022-07-20 06:25:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:25:04,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:05,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72692342] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:05,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:05,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-07-20 06:25:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912868420] [2022-07-20 06:25:05,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:05,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:25:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:25:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:25:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:25:05,065 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 06:25:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:05,308 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-07-20 06:25:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:25:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-07-20 06:25:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:05,309 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:25:05,309 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:25:05,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:25:05,310 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 113 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:05,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 347 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 262 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-07-20 06:25:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:25:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-07-20 06:25:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.631578947368421) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-20 06:25:05,315 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 41 [2022-07-20 06:25:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:05,316 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-20 06:25:05,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 06:25:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-20 06:25:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:25:05,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:05,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:05,350 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-20 06:25:05,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-20 06:25:05,528 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2022-07-20 06:25:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:25:05,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715019860] [2022-07-20 06:25:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:25:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:25:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 06:25:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 06:25:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-20 06:25:05,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:25:05,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715019860] [2022-07-20 06:25:05,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715019860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:05,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33404180] [2022-07-20 06:25:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:05,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:05,744 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-20 06:25:05,765 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-20 06:25:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:05,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:25:05,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:05,882 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-20 06:25:05,913 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-20 06:25:06,018 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:25:06,039 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-20 06:25:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:06,219 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 34163 column 46: unknown constant v_#length_BEFORE_CALL_2 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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-20 06:25:06,223 INFO L158 Benchmark]: Toolchain (without parser) took 5125.05ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 60.3MB in the beginning and 75.4MB in the end (delta: -15.1MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-07-20 06:25:06,223 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:25:06,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.29ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 60.1MB in the beginning and 86.6MB in the end (delta: -26.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 06:25:06,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.92ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 84.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:25:06,224 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 119.5MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:25:06,224 INFO L158 Benchmark]: RCFGBuilder took 483.78ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 92.5MB in the end (delta: -10.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-07-20 06:25:06,224 INFO L158 Benchmark]: TraceAbstraction took 4169.14ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 92.0MB in the beginning and 75.4MB in the end (delta: 16.6MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2022-07-20 06:25:06,226 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.17ms. Allocated memory is still 94.4MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.29ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 60.1MB in the beginning and 86.6MB in the end (delta: -26.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.92ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 84.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 119.5MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 483.78ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 92.5MB in the end (delta: -10.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4169.14ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 92.0MB in the beginning and 75.4MB in the end (delta: 16.6MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 34163 column 46: unknown constant v_#length_BEFORE_CALL_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 34163 column 46: unknown constant v_#length_BEFORE_CALL_2: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:25:06,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 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-simple/sll2n_append_unequal.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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:25:08,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:25:08,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:25:08,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:25:08,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:25:08,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:25:08,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:25:08,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:25:08,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:25:08,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:25:08,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:25:08,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:25:08,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:25:08,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:25:08,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:25:08,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:25:08,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:25:08,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:25:08,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:25:08,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:25:08,252 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:25:08,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:25:08,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:25:08,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:25:08,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:25:08,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:25:08,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:25:08,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:25:08,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:25:08,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:25:08,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:25:08,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:25:08,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:25:08,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:25:08,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:25:08,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:25:08,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:25:08,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:25:08,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:25:08,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:25:08,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:25:08,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:25:08,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:25:08,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:25:08,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:25:08,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:25:08,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:25:08,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:25:08,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:25:08,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:25:08,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:25:08,313 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:25:08,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:25:08,314 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:25:08,314 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:25:08,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:25:08,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:25:08,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:25:08,315 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:25:08,315 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:25:08,315 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:25:08,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:25:08,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:25:08,316 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:25:08,316 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:25:08,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:25:08,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:25:08,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:25:08,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:25:08,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:25:08,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:25:08,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:25:08,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:25:08,318 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:25:08,318 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:08,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:25:08,319 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2022-07-20 06:25:08,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:25:08,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:25:08,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:25:08,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:25:08,683 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:25:08,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-07-20 06:25:08,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276ab6516/723aafb5da82414bb8d53eade8f031b5/FLAG502f1b854 [2022-07-20 06:25:09,191 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:25:09,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-07-20 06:25:09,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276ab6516/723aafb5da82414bb8d53eade8f031b5/FLAG502f1b854 [2022-07-20 06:25:09,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276ab6516/723aafb5da82414bb8d53eade8f031b5 [2022-07-20 06:25:09,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:25:09,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:25:09,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:25:09,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:25:09,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:25:09,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:25:09" (1/1) ... [2022-07-20 06:25:09,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6910721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:09, skipping insertion in model container [2022-07-20 06:25:09,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:25:09" (1/1) ... [2022-07-20 06:25:09,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:25:09,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:25:09,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-07-20 06:25:09,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:25:09,937 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:25:09,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-07-20 06:25:09,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:25:10,027 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:25:10,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10 WrapperNode [2022-07-20 06:25:10,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:25:10,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:25:10,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:25:10,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:25:10,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,100 INFO L137 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-07-20 06:25:10,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:25:10,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:25:10,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:25:10,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:25:10,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:25:10,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:25:10,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:25:10,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:25:10,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (1/1) ... [2022-07-20 06:25:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:25:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:10,201 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-20 06:25:10,217 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-20 06:25:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:25:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:25:10,243 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:25:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:25:10,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:25:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:25:10,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:25:10,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:25:10,383 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:25:10,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:25:10,713 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:25:10,719 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:25:10,719 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 06:25:10,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:25:10 BoogieIcfgContainer [2022-07-20 06:25:10,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:25:10,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:25:10,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:25:10,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:25:10,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:25:09" (1/3) ... [2022-07-20 06:25:10,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91baff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:25:10, skipping insertion in model container [2022-07-20 06:25:10,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:25:10" (2/3) ... [2022-07-20 06:25:10,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91baff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:25:10, skipping insertion in model container [2022-07-20 06:25:10,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:25:10" (3/3) ... [2022-07-20 06:25:10,728 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-07-20 06:25:10,739 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:25:10,740 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-07-20 06:25:10,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:25:10,803 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@60fa92fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6125de1b [2022-07-20 06:25:10,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-07-20 06:25:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:25:10,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:10,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:10,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2022-07-20 06:25:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:10,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719505530] [2022-07-20 06:25:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:10,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:10,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:10,837 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-20 06:25:10,839 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-20 06:25:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:10,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:25:10,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:11,011 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-20 06:25:11,029 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-20 06:25:11,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:11,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719505530] [2022-07-20 06:25:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719505530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:11,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:11,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990453713] [2022-07-20 06:25:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:11,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:11,068 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:11,213 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-20 06:25:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:11,215 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:25:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:11,221 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:25:11,235 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:25:11,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-20 06:25:11,245 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:11,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:25:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-20 06:25:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-20 06:25:11,315 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2022-07-20 06:25:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:11,316 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-20 06:25:11,316 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-20 06:25:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:25:11,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:11,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:11,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 06:25:11,517 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-20 06:25:11,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2022-07-20 06:25:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:11,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524323010] [2022-07-20 06:25:11,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:11,523 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-20 06:25:11,524 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-20 06:25:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:11,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:25:11,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:11,598 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-20 06:25:11,612 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-20 06:25:11,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:11,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524323010] [2022-07-20 06:25:11,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524323010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:11,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:11,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48128216] [2022-07-20 06:25:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:11,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:11,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:11,619 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:11,780 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-07-20 06:25:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:11,784 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:25:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:11,785 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:25:11,785 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:25:11,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-20 06:25:11,786 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:11,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:25:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:25:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-20 06:25:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-07-20 06:25:11,806 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2022-07-20 06:25:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:11,807 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-07-20 06:25:11,807 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:25:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-07-20 06:25:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:25:11,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:11,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:11,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:12,017 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-20 06:25:12,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2022-07-20 06:25:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975083552] [2022-07-20 06:25:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:12,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:12,021 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-20 06:25:12,023 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-20 06:25:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:12,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:25:12,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:12,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-20 06:25:12,135 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-20 06:25:12,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:12,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975083552] [2022-07-20 06:25:12,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975083552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:12,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:12,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:25:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525116898] [2022-07-20 06:25:12,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:12,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:25:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:25:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:25:12,140 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:12,420 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-07-20 06:25:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:25:12,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-20 06:25:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:12,422 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:25:12,423 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:25:12,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-20 06:25:12,424 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:12,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:25:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:25:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-07-20 06:25:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-20 06:25:12,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2022-07-20 06:25:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:12,438 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-20 06:25:12,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-20 06:25:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:25:12,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:12,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:12,453 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-20 06:25:12,650 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-20 06:25:12,651 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2022-07-20 06:25:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:12,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448751791] [2022-07-20 06:25:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:12,672 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-20 06:25:12,674 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-20 06:25:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:12,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:25:12,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:12,772 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-20 06:25:12,852 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-20 06:25:12,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:12,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:12,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448751791] [2022-07-20 06:25:12,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448751791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:12,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:12,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:25:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496237598] [2022-07-20 06:25:12,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:12,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:25:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:25:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:25:12,855 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:13,137 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-07-20 06:25:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:25:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-20 06:25:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:13,140 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:25:13,140 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 06:25:13,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-20 06:25:13,142 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:13,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 325 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:25:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 06:25:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-07-20 06:25:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-20 06:25:13,150 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2022-07-20 06:25:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:13,151 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-20 06:25:13,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-20 06:25:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:25:13,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:13,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:13,163 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-20 06:25:13,361 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-20 06:25:13,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2022-07-20 06:25:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:13,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641477802] [2022-07-20 06:25:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:13,364 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-20 06:25:13,366 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-20 06:25:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:13,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:25:13,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:13,446 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-20 06:25:13,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:13,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:13,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641477802] [2022-07-20 06:25:13,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641477802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:13,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:13,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:25:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509263798] [2022-07-20 06:25:13,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:13,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:13,452 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:13,465 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-07-20 06:25:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:13,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-20 06:25:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:13,467 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:25:13,468 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:25:13,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-20 06:25:13,469 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:13,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 185 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:25:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:25:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-07-20 06:25:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-20 06:25:13,488 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2022-07-20 06:25:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:13,489 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-20 06:25:13,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:25:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-20 06:25:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:25:13,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:13,490 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] [2022-07-20 06:25:13,498 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-20 06:25:13,696 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-20 06:25:13,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:13,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1411001534, now seen corresponding path program 1 times [2022-07-20 06:25:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:13,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139691638] [2022-07-20 06:25:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:13,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:13,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:13,698 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-20 06:25:13,699 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-20 06:25:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:13,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:25:13,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:25:13,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:25:13,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139691638] [2022-07-20 06:25:13,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139691638] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:13,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:13,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 06:25:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387912210] [2022-07-20 06:25:13,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:13,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:25:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:25:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:25:13,889 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:25:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:13,916 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-07-20 06:25:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:25:13,917 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-20 06:25:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:13,918 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:25:13,921 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 06:25:13,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:25:13,922 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:13,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 372 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:25:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 06:25:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-07-20 06:25:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-07-20 06:25:13,931 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2022-07-20 06:25:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:13,931 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-20 06:25:13,931 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:25:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-07-20 06:25:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:25:13,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:13,933 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:13,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-20 06:25:14,145 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-20 06:25:14,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 2 times [2022-07-20 06:25:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:14,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843572697] [2022-07-20 06:25:14,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:25:14,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:14,148 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-20 06:25:14,148 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-20 06:25:14,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:25:14,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:25:14,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:25:14,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:14,334 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-20 06:25:14,374 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-20 06:25:14,517 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:25:14,518 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 24 [2022-07-20 06:25:14,562 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-20 06:25:14,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:14,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:25:14,941 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:25:14,942 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 17 [2022-07-20 06:25:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:14,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:15,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:15,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843572697] [2022-07-20 06:25:15,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843572697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:15,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1542165923] [2022-07-20 06:25:15,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:25:15,243 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:25:15,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:25:15,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-20 06:25:15,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 06:25:15,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241731348] [2022-07-20 06:25:15,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:25:15,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:25:15,465 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-20 06:25:15,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2022-07-20 06:25:15,466 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-20 06:25:15,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:25:15,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:25:15,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:25:15,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:15,649 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-20 06:25:17,742 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:25:17,742 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 24 [2022-07-20 06:25:19,844 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:25:19,844 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 24 [2022-07-20 06:25:19,954 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:25:19,954 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 17 [2022-07-20 06:25:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 8 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 06:25:19,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-20 06:25:20,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241731348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:25:20,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:25:20,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 15 [2022-07-20 06:25:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815753294] [2022-07-20 06:25:20,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:20,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:25:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:25:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2022-07-20 06:25:20,457 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-20 06:25:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:27,005 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-07-20 06:25:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:25:27,005 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2022-07-20 06:25:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:27,006 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:25:27,006 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 06:25:27,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 107 SyntacticMatches, 18 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2022-07-20 06:25:27,007 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:27,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 462 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 191 Unchecked, 0.2s Time] [2022-07-20 06:25:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 06:25:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-07-20 06:25:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-20 06:25:27,012 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 41 [2022-07-20 06:25:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:27,013 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-20 06:25:27,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-20 06:25:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-20 06:25:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:25:27,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:27,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:27,027 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-20 06:25:27,232 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-20 06:25:27,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:25:27,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:27,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2022-07-20 06:25:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:27,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944510811] [2022-07-20 06:25:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:27,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:27,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:27,417 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-20 06:25:27,418 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-20 06:25:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:27,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:25:27,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:27,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-20 06:25:27,623 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-20 06:25:27,653 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-20 06:25:27,664 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-20 06:25:29,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:29,787 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-20 06:25:29,797 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:29,798 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-20 06:25:29,873 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-20 06:25:31,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:31,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, 2 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-20 06:25:32,254 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:25:32,255 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-20 06:25:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:25:32,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:32,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:32,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944510811] [2022-07-20 06:25:32,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944510811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:32,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20319380] [2022-07-20 06:25:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:32,611 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:25:32,616 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:25:32,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-20 06:25:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:32,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:25:32,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:32,903 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-20 06:25:32,915 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-20 06:25:33,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:33,018 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-20 06:25:33,119 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-20 06:25:35,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:35,407 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-20 06:25:35,620 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-20 06:25:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:35,745 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-20 06:25:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:25:35,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:35,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [20319380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:35,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:35,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-20 06:25:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141379319] [2022-07-20 06:25:35,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:36,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 06:25:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 06:25:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=479, Unknown=3, NotChecked=0, Total=552 [2022-07-20 06:25:36,001 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:25:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:41,581 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-20 06:25:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:25:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-07-20 06:25:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:41,583 INFO L225 Difference]: With dead ends: 105 [2022-07-20 06:25:41,583 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 06:25:41,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=115, Invalid=810, Unknown=5, NotChecked=0, Total=930 [2022-07-20 06:25:41,584 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:41,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 819 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 364 Unchecked, 0.3s Time] [2022-07-20 06:25:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 06:25:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-20 06:25:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2022-07-20 06:25:41,589 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 41 [2022-07-20 06:25:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:41,590 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2022-07-20 06:25:41,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:25:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2022-07-20 06:25:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:25:41,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:41,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:41,606 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-20 06:25:41,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:41,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 483750337, now seen corresponding path program 1 times [2022-07-20 06:25:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:41,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114753056] [2022-07-20 06:25:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:41,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:41,994 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-20 06:25:41,996 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-20 06:25:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:42,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:25:42,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:25:42,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:42,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:42,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114753056] [2022-07-20 06:25:42,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114753056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:42,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:42,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309378370] [2022-07-20 06:25:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:42,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:42,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:42,147 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:42,268 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-07-20 06:25:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-20 06:25:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:42,269 INFO L225 Difference]: With dead ends: 115 [2022-07-20 06:25:42,269 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 06:25:42,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-20 06:25:42,270 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:42,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 84 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 06:25:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2022-07-20 06:25:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-07-20 06:25:42,274 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 43 [2022-07-20 06:25:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:42,275 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-07-20 06:25:42,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-07-20 06:25:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:25:42,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:42,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:42,290 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-20 06:25:42,486 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-20 06:25:42,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 483750338, now seen corresponding path program 1 times [2022-07-20 06:25:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775324265] [2022-07-20 06:25:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:42,490 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-20 06:25:42,492 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-20 06:25:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:42,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:25:42,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:25:42,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:42,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:42,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775324265] [2022-07-20 06:25:42,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775324265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:42,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:42,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:25:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782688232] [2022-07-20 06:25:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:42,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:25:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:25:42,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:25:42,689 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:42,823 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-07-20 06:25:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:25:42,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-20 06:25:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:42,825 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:25:42,825 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:25:42,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:25:42,826 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 199 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:42,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:25:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-20 06:25:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-07-20 06:25:42,832 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 43 [2022-07-20 06:25:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:42,833 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-07-20 06:25:42,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-07-20 06:25:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:25:42,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:42,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:42,855 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-20 06:25:43,049 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-20 06:25:43,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607010, now seen corresponding path program 1 times [2022-07-20 06:25:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:43,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921596393] [2022-07-20 06:25:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:43,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:43,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:43,052 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-20 06:25:43,053 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-20 06:25:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:43,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:25:43,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:25:43,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:43,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:43,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921596393] [2022-07-20 06:25:43,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921596393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:43,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:43,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:25:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404650668] [2022-07-20 06:25:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:43,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:25:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:43,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:25:43,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:25:43,222 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:43,362 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-20 06:25:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:25:43,362 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-20 06:25:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:43,363 INFO L225 Difference]: With dead ends: 112 [2022-07-20 06:25:43,363 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 06:25:43,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-20 06:25:43,364 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 135 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:43,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 98 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 06:25:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-07-20 06:25:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-20 06:25:43,367 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 45 [2022-07-20 06:25:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:43,367 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-20 06:25:43,367 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-20 06:25:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:25:43,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:43,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:43,381 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-20 06:25:43,574 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-20 06:25:43,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1027607011, now seen corresponding path program 1 times [2022-07-20 06:25:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:43,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449355137] [2022-07-20 06:25:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:43,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:43,577 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-20 06:25:43,578 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-20 06:25:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:43,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:25:43,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:25:43,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:43,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:43,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449355137] [2022-07-20 06:25:43,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449355137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:43,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:43,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:25:43,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346075696] [2022-07-20 06:25:43,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:43,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:25:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:25:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:25:43,790 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:43,891 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-07-20 06:25:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:25:43,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-20 06:25:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:43,893 INFO L225 Difference]: With dead ends: 98 [2022-07-20 06:25:43,893 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 06:25:43,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 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-20 06:25:43,894 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 185 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:43,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 06:25:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-20 06:25:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-07-20 06:25:43,897 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 45 [2022-07-20 06:25:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:43,897 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-07-20 06:25:43,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-07-20 06:25:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:25:43,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:43,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:43,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:44,099 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-20 06:25:44,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760007, now seen corresponding path program 1 times [2022-07-20 06:25:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:44,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373818345] [2022-07-20 06:25:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:44,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:44,101 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-20 06:25:44,103 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-20 06:25:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:44,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 06:25:44,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:44,440 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-20 06:25:44,580 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 6 treesize of output 5 [2022-07-20 06:25:44,729 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 9 treesize of output 5 [2022-07-20 06:25:44,735 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 7 treesize of output 3 [2022-07-20 06:25:44,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:44,950 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-20 06:25:44,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:44,961 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 16 treesize of output 18 [2022-07-20 06:25:44,988 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 06:25:44,988 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-20 06:25:45,118 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-20 06:25:45,127 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-20 06:25:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:45,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:45,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:45,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373818345] [2022-07-20 06:25:45,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373818345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:45,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [329750348] [2022-07-20 06:25:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:45,966 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:25:45,968 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:25:45,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-20 06:25:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:25:46,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:46,387 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-20 06:25:46,397 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-20 06:25:46,932 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 22 treesize of output 14 [2022-07-20 06:25:46,937 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 7 treesize of output 3 [2022-07-20 06:25:47,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:47,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-20 06:25:47,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:47,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:25:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:47,413 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-20 06:25:47,431 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 06:25:47,432 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 18 treesize of output 18 [2022-07-20 06:25:47,626 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-20 06:25:47,631 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-20 06:25:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:47,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:48,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [329750348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:48,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:48,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-07-20 06:25:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843801763] [2022-07-20 06:25:48,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:48,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 06:25:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 06:25:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1251, Unknown=22, NotChecked=0, Total=1406 [2022-07-20 06:25:48,222 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 33 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:25:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:49,772 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-07-20 06:25:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:25:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-07-20 06:25:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:49,774 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:25:49,774 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 06:25:49,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=208, Invalid=1834, Unknown=28, NotChecked=0, Total=2070 [2022-07-20 06:25:49,775 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 25 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:49,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 955 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 510 Invalid, 0 Unknown, 204 Unchecked, 0.8s Time] [2022-07-20 06:25:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 06:25:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-20 06:25:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-20 06:25:49,781 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 45 [2022-07-20 06:25:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:49,781 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-20 06:25:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:25:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-20 06:25:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:25:49,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:49,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:49,797 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-20 06:25:50,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:50,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:50,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760006, now seen corresponding path program 1 times [2022-07-20 06:25:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:50,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173975658] [2022-07-20 06:25:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:50,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:50,199 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-20 06:25:50,200 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-20 06:25:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:50,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:25:50,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:50,443 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-20 06:25:50,629 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 12 treesize of output 8 [2022-07-20 06:25:50,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:50,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-20 06:25:50,826 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-20 06:25:50,827 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 19 treesize of output 24 [2022-07-20 06:25:50,926 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 21 treesize of output 13 [2022-07-20 06:25:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:51,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:51,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173975658] [2022-07-20 06:25:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173975658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [887988197] [2022-07-20 06:25:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:51,359 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:25:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:25:51,361 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:25:51,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-20 06:25:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:51,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:25:51,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:51,756 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-20 06:25:52,035 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 12 treesize of output 8 [2022-07-20 06:25:52,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:52,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-20 06:25:52,308 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:25:52,308 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 24 treesize of output 35 [2022-07-20 06:25:52,453 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 28 treesize of output 16 [2022-07-20 06:25:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:25:52,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:52,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [887988197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:52,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:52,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-07-20 06:25:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291598157] [2022-07-20 06:25:52,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:52,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:25:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:52,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:25:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=925, Unknown=15, NotChecked=0, Total=1056 [2022-07-20 06:25:52,693 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:25:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:53,543 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2022-07-20 06:25:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:25:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-07-20 06:25:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:53,544 INFO L225 Difference]: With dead ends: 139 [2022-07-20 06:25:53,544 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 06:25:53,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=1367, Unknown=21, NotChecked=0, Total=1560 [2022-07-20 06:25:53,545 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:53,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 776 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 399 Invalid, 0 Unknown, 208 Unchecked, 0.5s Time] [2022-07-20 06:25:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 06:25:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2022-07-20 06:25:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-07-20 06:25:53,549 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 45 [2022-07-20 06:25:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:53,550 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-07-20 06:25:53,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:25:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-07-20 06:25:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:25:53,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:53,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:53,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:53,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-20 06:25:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:25:53,956 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash -312140221, now seen corresponding path program 1 times [2022-07-20 06:25:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:53,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362604670] [2022-07-20 06:25:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:53,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:53,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:53,958 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-20 06:25:53,958 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-20 06:25:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:54,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:25:54,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:54,116 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-20 06:25:54,178 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-20 06:25:54,192 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-20 06:25:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 06:25:54,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:54,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:54,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362604670] [2022-07-20 06:25:54,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362604670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:54,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:54,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:25:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501354478] [2022-07-20 06:25:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:54,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:25:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:25:54,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:25:54,215 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:54,700 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2022-07-20 06:25:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:25:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-07-20 06:25:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:54,701 INFO L225 Difference]: With dead ends: 148 [2022-07-20 06:25:54,701 INFO L226 Difference]: Without dead ends: 148 [2022-07-20 06:25:54,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:25:54,702 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 219 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:54,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 301 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:25:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-20 06:25:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 101. [2022-07-20 06:25:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-20 06:25:54,706 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 47 [2022-07-20 06:25:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:54,706 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-20 06:25:54,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-20 06:25:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:25:54,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:54,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:54,718 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-20 06:25:54,915 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-20 06:25:54,916 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash -312140220, now seen corresponding path program 1 times [2022-07-20 06:25:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:54,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518402796] [2022-07-20 06:25:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:54,918 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-20 06:25:54,920 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-20 06:25:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:55,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:25:55,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:55,104 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-20 06:25:55,199 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-20 06:25:55,203 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-20 06:25:55,224 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-20 06:25:55,227 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-20 06:25:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 06:25:55,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:55,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:55,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518402796] [2022-07-20 06:25:55,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518402796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:55,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:55,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:25:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372090416] [2022-07-20 06:25:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:55,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:25:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:55,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:25:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:25:55,262 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:55,796 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2022-07-20 06:25:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:25:55,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-07-20 06:25:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:55,797 INFO L225 Difference]: With dead ends: 159 [2022-07-20 06:25:55,797 INFO L226 Difference]: Without dead ends: 159 [2022-07-20 06:25:55,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:25:55,798 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 191 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:55,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 366 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:25:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-20 06:25:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2022-07-20 06:25:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 101 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2022-07-20 06:25:55,803 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 47 [2022-07-20 06:25:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:55,803 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2022-07-20 06:25:55,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:25:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2022-07-20 06:25:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:25:55,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:55,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:55,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:56,014 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-20 06:25:56,015 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:56,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash -165111632, now seen corresponding path program 1 times [2022-07-20 06:25:56,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:56,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162375149] [2022-07-20 06:25:56,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:56,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:56,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:56,017 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-20 06:25:56,019 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-20 06:25:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:56,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:25:56,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:25:56,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:56,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162375149] [2022-07-20 06:25:56,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162375149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:56,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:56,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950400002] [2022-07-20 06:25:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:56,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:56,176 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:56,269 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-07-20 06:25:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-20 06:25:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:56,270 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:25:56,270 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:25:56,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-20 06:25:56,271 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:56,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 141 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:25:56,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:25:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 106. [2022-07-20 06:25:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 99 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-07-20 06:25:56,275 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 47 [2022-07-20 06:25:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:56,275 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-07-20 06:25:56,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-07-20 06:25:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:25:56,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:56,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:25:56,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:25:56,486 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-20 06:25:56,487 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash -165111631, now seen corresponding path program 1 times [2022-07-20 06:25:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:56,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430394543] [2022-07-20 06:25:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:56,489 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-20 06:25:56,490 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-20 06:25:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:56,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:25:56,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:25:56,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:25:56,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:25:56,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430394543] [2022-07-20 06:25:56,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430394543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:25:56,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:25:56,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:25:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474058528] [2022-07-20 06:25:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:25:56,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:25:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:25:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:25:56,661 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:56,844 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-07-20 06:25:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:25:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-20 06:25:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:56,845 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:25:56,845 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:25:56,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-20 06:25:56,846 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:56,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:25:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:25:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2022-07-20 06:25:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 97 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:25:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-07-20 06:25:56,849 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 47 [2022-07-20 06:25:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:56,849 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-07-20 06:25:56,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:25:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-07-20 06:25:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:25:56,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:56,850 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-20 06:25:56,862 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-20 06:25:57,060 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-20 06:25:57,060 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:25:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 241565309, now seen corresponding path program 1 times [2022-07-20 06:25:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:57,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172959256] [2022-07-20 06:25:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:57,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:57,064 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-20 06:25:57,064 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-20 06:25:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:57,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-20 06:25:57,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:57,329 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-20 06:25:57,334 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-20 06:25:57,674 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:25:57,674 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-20 06:25:57,698 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:25:57,698 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 20 treesize of output 27 [2022-07-20 06:25:57,883 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-20 06:25:57,897 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-20 06:25:58,367 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:25:58,367 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 69 treesize of output 45 [2022-07-20 06:25:58,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-20 06:25:58,386 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:25:58,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:25:58,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-20 06:25:58,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:58,726 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:25:58,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 65 [2022-07-20 06:25:58,763 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:25:58,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:25:58,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:25:58,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:25:58,801 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:25:58,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 06:25:59,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:25:59,368 INFO L356 Elim1Store]: treesize reduction 15, result has 55.9 percent of original size [2022-07-20 06:25:59,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 62 [2022-07-20 06:25:59,399 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-20 06:25:59,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 29 [2022-07-20 06:25:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:25:59,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:00,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172959256] [2022-07-20 06:26:00,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172959256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753705549] [2022-07-20 06:26:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:00,585 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:00,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:00,586 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:00,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-20 06:26:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:00,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-20 06:26:00,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:01,006 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-20 06:26:01,011 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-20 06:26:01,517 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:26:01,517 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 20 treesize of output 27 [2022-07-20 06:26:01,535 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-20 06:26:01,843 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-20 06:26:01,852 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-20 06:26:02,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:02,534 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2022-07-20 06:26:02,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 06:26:02,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-20 06:26:02,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:02,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:26:03,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:03,045 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:26:03,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 62 [2022-07-20 06:26:03,084 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:26:03,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2022-07-20 06:26:03,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:26:03,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:03,109 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:26:03,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 06:26:03,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:03,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:03,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:03,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 47 [2022-07-20 06:26:03,812 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-20 06:26:03,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 06:26:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:03,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:04,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1753705549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:04,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:04,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 44 [2022-07-20 06:26:04,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909791851] [2022-07-20 06:26:04,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:04,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:26:04,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:26:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2425, Unknown=28, NotChecked=0, Total=2652 [2022-07-20 06:26:04,504 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 45 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:26:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:05,939 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-07-20 06:26:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:26:05,940 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-07-20 06:26:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:05,941 INFO L225 Difference]: With dead ends: 110 [2022-07-20 06:26:05,941 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 06:26:05,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=298, Invalid=3697, Unknown=37, NotChecked=0, Total=4032 [2022-07-20 06:26:05,943 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 19 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:05,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 955 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 504 Unchecked, 0.2s Time] [2022-07-20 06:26:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 06:26:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-07-20 06:26:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 101 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:26:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-07-20 06:26:05,946 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 49 [2022-07-20 06:26:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:05,946 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-07-20 06:26:05,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:26:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-07-20 06:26:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:26:05,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:05,948 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-20 06:26:05,958 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-20 06:26:06,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:06,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:06,359 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 241565308, now seen corresponding path program 1 times [2022-07-20 06:26:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:06,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259176808] [2022-07-20 06:26:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:06,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:06,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:06,361 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-20 06:26:06,362 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-20 06:26:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:06,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 06:26:06,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:06,633 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-20 06:26:06,831 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:26:06,831 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 20 treesize of output 27 [2022-07-20 06:26:06,922 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-20 06:26:07,181 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:26:07,182 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 42 treesize of output 30 [2022-07-20 06:26:07,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 06:26:07,197 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 7 treesize of output 3 [2022-07-20 06:26:07,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:07,468 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:26:07,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 46 [2022-07-20 06:26:07,510 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-20 06:26:07,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2022-07-20 06:26:07,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:07,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 06:26:07,701 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-20 06:26:07,966 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:26:07,967 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 77 treesize of output 45 [2022-07-20 06:26:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:08,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:08,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:08,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259176808] [2022-07-20 06:26:08,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259176808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:08,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912308146] [2022-07-20 06:26:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:08,565 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:08,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:08,566 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:08,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-20 06:26:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:08,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 06:26:08,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:09,023 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-20 06:26:09,311 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:26:09,312 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 20 treesize of output 27 [2022-07-20 06:26:09,538 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-20 06:26:10,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:10,085 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2022-07-20 06:26:10,092 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 7 treesize of output 3 [2022-07-20 06:26:10,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:10,268 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:26:10,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 46 [2022-07-20 06:26:10,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:10,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-20 06:26:10,318 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-20 06:26:10,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2022-07-20 06:26:10,932 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-20 06:26:11,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:11,367 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2022-07-20 06:26:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:11,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:11,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1912308146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:11,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:11,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2022-07-20 06:26:11,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678422596] [2022-07-20 06:26:11,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:11,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:26:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:11,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:26:11,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1868, Unknown=7, NotChecked=0, Total=2070 [2022-07-20 06:26:11,855 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 40 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 33 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:26:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:12,431 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2022-07-20 06:26:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:26:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 33 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-07-20 06:26:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:12,433 INFO L225 Difference]: With dead ends: 110 [2022-07-20 06:26:12,433 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 06:26:12,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=250, Invalid=2392, Unknown=10, NotChecked=0, Total=2652 [2022-07-20 06:26:12,434 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 19 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:12,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 742 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 354 Unchecked, 0.2s Time] [2022-07-20 06:26:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 06:26:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-07-20 06:26:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.313953488372093) internal successors, (113), 101 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:26:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-07-20 06:26:12,438 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 49 [2022-07-20 06:26:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:12,438 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-07-20 06:26:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 33 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:26:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-07-20 06:26:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:26:12,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:12,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-20 06:26:12,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2022-07-20 06:26:12,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-20 06:26:12,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:26:12,844 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash -365046387, now seen corresponding path program 1 times [2022-07-20 06:26:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:12,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014055693] [2022-07-20 06:26:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:12,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:12,848 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-20 06:26:12,848 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-20 06:26:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:13,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:26:13,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:13,175 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 6 treesize of output 5 [2022-07-20 06:26:13,249 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 8 treesize of output 4 [2022-07-20 06:26:13,306 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1538) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-20 06:26:13,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:13,357 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 15 treesize of output 17 [2022-07-20 06:26:13,397 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-20 06:26:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-20 06:26:13,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:13,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:13,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014055693] [2022-07-20 06:26:13,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014055693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:13,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1256988474] [2022-07-20 06:26:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:13,514 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:13,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:13,516 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:13,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-20 06:26:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:13,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:26:13,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:14,172 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 8 treesize of output 4 [2022-07-20 06:26:14,201 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1606) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 06:26:14,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:14,264 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 15 treesize of output 17 [2022-07-20 06:26:14,332 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-20 06:26:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-20 06:26:14,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:14,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1256988474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:14,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:14,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2022-07-20 06:26:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109694552] [2022-07-20 06:26:14,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:14,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 06:26:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 06:26:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=503, Unknown=11, NotChecked=94, Total=702 [2022-07-20 06:26:14,439 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 25 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:26:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:14,838 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-07-20 06:26:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:26:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-07-20 06:26:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:14,839 INFO L225 Difference]: With dead ends: 96 [2022-07-20 06:26:14,839 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 06:26:14,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=829, Unknown=17, NotChecked=122, Total=1122 [2022-07-20 06:26:14,840 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:14,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 573 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 202 Unchecked, 0.2s Time] [2022-07-20 06:26:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 06:26:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-20 06:26:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:26:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-07-20 06:26:14,843 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-07-20 06:26:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:14,843 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-07-20 06:26:14,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:26:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-07-20 06:26:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:26:14,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:14,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-20 06:26:14,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:15,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:15,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:26:15,253 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash 165492146, now seen corresponding path program 1 times [2022-07-20 06:26:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:15,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675529902] [2022-07-20 06:26:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:15,256 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-20 06:26:15,258 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-20 06:26:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:15,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:26:15,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:15,790 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-20 06:26:15,797 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 6 treesize of output 5 [2022-07-20 06:26:15,960 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 7 treesize of output 3 [2022-07-20 06:26:15,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:15,970 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 12 treesize of output 20 [2022-07-20 06:26:16,062 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1677) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_1678) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 06:26:16,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:16,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-20 06:26:16,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:16,190 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-20 06:26:16,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-07-20 06:26:16,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:26:16,755 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:26:16,755 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 2 case distinctions, treesize of input 38 treesize of output 33 [2022-07-20 06:26:16,855 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 24 treesize of output 12 [2022-07-20 06:26:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-20 06:26:16,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:17,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:26:17,153 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-20 06:26:17,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 06:26:17,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:17,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675529902] [2022-07-20 06:26:17,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675529902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:17,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [925034751] [2022-07-20 06:26:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:17,601 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:17,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-20 06:26:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:17,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:26:17,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:18,800 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 7 treesize of output 3 [2022-07-20 06:26:18,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1752))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-20 06:26:19,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:19,094 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-20 06:26:19,552 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:26:19,552 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 27 treesize of output 28 [2022-07-20 06:26:19,667 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 24 treesize of output 12 [2022-07-20 06:26:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-20 06:26:19,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:19,692 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-20 06:26:19,692 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 19 treesize of output 18 [2022-07-20 06:26:19,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-20 06:26:19,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_#t~mem9#1.base|)) is different from false [2022-07-20 06:26:19,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0))) is different from false [2022-07-20 06:26:19,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [925034751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:19,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:19,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 44 [2022-07-20 06:26:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069339027] [2022-07-20 06:26:19,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:26:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:26:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2433, Unknown=49, NotChecked=630, Total=3306 [2022-07-20 06:26:19,899 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 45 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 40 states have internal predecessors, (86), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:26:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:21,716 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-07-20 06:26:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:26:21,717 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 40 states have internal predecessors, (86), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-07-20 06:26:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:21,718 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:26:21,718 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:26:21,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=388, Invalid=4531, Unknown=75, NotChecked=858, Total=5852 [2022-07-20 06:26:21,720 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 38 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:21,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1218 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 320 Invalid, 0 Unknown, 446 Unchecked, 0.4s Time] [2022-07-20 06:26:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:26:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-07-20 06:26:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:26:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-20 06:26:21,723 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 51 [2022-07-20 06:26:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:21,723 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-20 06:26:21,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 40 states have internal predecessors, (86), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:26:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-20 06:26:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:26:21,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:21,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-20 06:26:21,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-20 06:26:21,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:22,132 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash 165492147, now seen corresponding path program 1 times [2022-07-20 06:26:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:22,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756012288] [2022-07-20 06:26:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:22,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:22,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:22,134 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-20 06:26:22,134 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-20 06:26:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:22,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-20 06:26:22,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:22,578 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-20 06:26:22,815 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 7 treesize of output 3 [2022-07-20 06:26:22,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:22,828 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 12 treesize of output 20 [2022-07-20 06:26:22,955 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_1823))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1824)))) is different from true [2022-07-20 06:26:23,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:23,026 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-20 06:26:23,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:23,055 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-20 06:26:23,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-07-20 06:26:23,609 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:26:23,609 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 2 case distinctions, treesize of input 60 treesize of output 53 [2022-07-20 06:26:23,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:23,634 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 44 treesize of output 42 [2022-07-20 06:26:23,639 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 3 [2022-07-20 06:26:23,732 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 30 treesize of output 18 [2022-07-20 06:26:23,736 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 26 treesize of output 14 [2022-07-20 06:26:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-20 06:26:23,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:24,204 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-20 06:26:24,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:24,402 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 52 treesize of output 56 [2022-07-20 06:26:25,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:25,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756012288] [2022-07-20 06:26:25,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756012288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:25,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [892143191] [2022-07-20 06:26:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:25,865 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:25,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:25,867 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-20 06:26:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:26,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:26:26,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:27,153 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 7 treesize of output 3 [2022-07-20 06:26:27,379 WARN L855 $PredicateComparison]: unable to prove that (and (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1899)))) is different from true [2022-07-20 06:26:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:27,543 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-20 06:26:28,035 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:26:28,036 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 43 treesize of output 42 [2022-07-20 06:26:28,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:28,046 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-20 06:26:28,363 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 30 treesize of output 18 [2022-07-20 06:26:28,368 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 34 treesize of output 18 [2022-07-20 06:26:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-20 06:26:28,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:28,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:28,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 52 treesize of output 56 [2022-07-20 06:26:30,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:30,360 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 126 treesize of output 109 [2022-07-20 06:26:30,369 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-20 06:26:30,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [892143191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:30,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:30,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 46 [2022-07-20 06:26:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974870382] [2022-07-20 06:26:30,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:30,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 06:26:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 06:26:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2927, Unknown=79, NotChecked=336, Total=3540 [2022-07-20 06:26:30,798 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 47 states, 44 states have (on average 2.0) internal successors, (88), 42 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:26:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:33,676 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-07-20 06:26:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:26:33,676 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.0) internal successors, (88), 42 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-07-20 06:26:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:33,677 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:26:33,677 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:26:33,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=409, Invalid=5349, Unknown=106, NotChecked=456, Total=6320 [2022-07-20 06:26:33,678 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 476 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:33,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 833 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 293 Invalid, 0 Unknown, 476 Unchecked, 0.4s Time] [2022-07-20 06:26:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:26:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-07-20 06:26:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 94 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:26:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2022-07-20 06:26:33,682 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 51 [2022-07-20 06:26:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:33,682 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2022-07-20 06:26:33,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.0) internal successors, (88), 42 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:26:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-07-20 06:26:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 06:26:33,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:33,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-20 06:26:33,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:33,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-20 06:26:34,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:26:34,088 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 124163800, now seen corresponding path program 1 times [2022-07-20 06:26:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:34,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859539759] [2022-07-20 06:26:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:34,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:34,089 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-20 06:26:34,090 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-20 06:26:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:34,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:26:34,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:26:34,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:26:34,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:34,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859539759] [2022-07-20 06:26:34,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859539759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:34,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:34,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:26:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348437481] [2022-07-20 06:26:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:34,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:26:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:34,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:26:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:26:34,312 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:26:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:34,431 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-20 06:26:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:26:34,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2022-07-20 06:26:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:34,432 INFO L225 Difference]: With dead ends: 100 [2022-07-20 06:26:34,432 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 06:26:34,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-20 06:26:34,433 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:34,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:26:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 06:26:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-20 06:26:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:26:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-20 06:26:34,436 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 53 [2022-07-20 06:26:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:34,436 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-20 06:26:34,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:26:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-20 06:26:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 06:26:34,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:34,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:34,448 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-20 06:26:34,648 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-20 06:26:34,648 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1444229747, now seen corresponding path program 2 times [2022-07-20 06:26:34,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:34,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451806620] [2022-07-20 06:26:34,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:26:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:34,651 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-20 06:26:34,651 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-20 06:26:34,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:26:34,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:26:34,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-20 06:26:34,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:34,960 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-20 06:26:35,086 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-20 06:26:35,095 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-20 06:26:35,425 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:26:35,426 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 16 treesize of output 22 [2022-07-20 06:26:35,431 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 7 treesize of output 3 [2022-07-20 06:26:35,453 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:26:35,453 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 20 treesize of output 27 [2022-07-20 06:26:35,473 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 16 treesize of output 18 [2022-07-20 06:26:35,643 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-20 06:26:35,648 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 27 treesize of output 26 [2022-07-20 06:26:36,086 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-20 06:26:36,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 67 [2022-07-20 06:26:36,101 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-20 06:26:36,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:26:36,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-20 06:26:36,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:36,538 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:26:36,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 84 [2022-07-20 06:26:36,564 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:26:36,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-07-20 06:26:36,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:36,582 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 06:26:36,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-20 06:26:37,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:37,303 INFO L356 Elim1Store]: treesize reduction 88, result has 24.1 percent of original size [2022-07-20 06:26:37,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 103 [2022-07-20 06:26:37,342 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-20 06:26:37,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 43 [2022-07-20 06:26:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:37,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:38,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:38,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451806620] [2022-07-20 06:26:38,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451806620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:38,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1010439853] [2022-07-20 06:26:38,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:26:38,003 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:38,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:38,007 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:38,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-20 06:26:38,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:26:38,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:26:38,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-20 06:26:38,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:38,531 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-20 06:26:38,773 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-20 06:26:38,781 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-20 06:26:39,200 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:26:39,201 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 20 treesize of output 27 [2022-07-20 06:26:39,224 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 16 treesize of output 18 [2022-07-20 06:26:39,233 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 16 treesize of output 18 [2022-07-20 06:26:39,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-20 06:26:39,568 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 27 treesize of output 26 [2022-07-20 06:26:40,346 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:26:40,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 41 [2022-07-20 06:26:40,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 06:26:40,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:40,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:26:40,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:40,589 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:26:40,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 79 [2022-07-20 06:26:40,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:40,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:40,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:40,608 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 06:26:40,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-20 06:26:40,632 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:26:40,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2022-07-20 06:26:41,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:42,023 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-20 06:26:42,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 82 [2022-07-20 06:26:42,053 INFO L356 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-07-20 06:26:42,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-07-20 06:26:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:42,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:42,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1010439853] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:42,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:42,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2022-07-20 06:26:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642197604] [2022-07-20 06:26:42,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:26:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:26:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2366, Unknown=8, NotChecked=0, Total=2550 [2022-07-20 06:26:42,360 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 45 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 39 states have internal predecessors, (71), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:26:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:43,018 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-07-20 06:26:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:26:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 39 states have internal predecessors, (71), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-07-20 06:26:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:43,022 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:26:43,022 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:26:43,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=218, Invalid=2961, Unknown=13, NotChecked=0, Total=3192 [2022-07-20 06:26:43,023 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 17 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:43,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 818 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 289 Unchecked, 0.2s Time] [2022-07-20 06:26:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:26:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2022-07-20 06:26:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 123 states have internal predecessors, (133), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:26:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2022-07-20 06:26:43,027 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 53 [2022-07-20 06:26:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:43,028 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2022-07-20 06:26:43,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 39 states have internal predecessors, (71), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:26:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-07-20 06:26:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:26:43,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:43,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-20 06:26:43,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:43,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-20 06:26:43,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:26:43,435 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:26:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash -445852738, now seen corresponding path program 1 times [2022-07-20 06:26:43,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:43,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364810890] [2022-07-20 06:26:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:43,437 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-20 06:26:43,438 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-20 06:26:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:43,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 06:26:43,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:43,933 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-20 06:26:43,938 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 6 treesize of output 5 [2022-07-20 06:26:44,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:44,183 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 12 treesize of output 20 [2022-07-20 06:26:44,190 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 7 treesize of output 3 [2022-07-20 06:26:44,429 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2199) |c_#memory_$Pointer$.offset|)) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (not (= |c_node_create_#res#1.base| (_ bv0 32))) (exists ((v_ArrVal_2198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2198) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-20 06:26:44,496 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-20 06:26:44,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2022-07-20 06:26:44,544 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 23 treesize of output 17 [2022-07-20 06:26:44,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:44,565 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 16 [2022-07-20 06:26:44,596 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:26:44,596 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 14 treesize of output 20 [2022-07-20 06:26:44,603 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-20 06:26:45,235 INFO L356 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-07-20 06:26:45,236 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 2 case distinctions, treesize of input 72 treesize of output 40 [2022-07-20 06:26:45,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:45,245 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 39 treesize of output 39 [2022-07-20 06:26:45,332 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 36 treesize of output 24 [2022-07-20 06:26:45,479 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:26:45,479 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 42 treesize of output 17 [2022-07-20 06:26:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-20 06:26:45,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:45,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2202 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) (_ bv0 32)))) is different from false [2022-07-20 06:26:46,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364810890] [2022-07-20 06:26:46,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364810890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483705089] [2022-07-20 06:26:46,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:46,990 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:46,991 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:46,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-20 06:26:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:47,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:26:47,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:48,296 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 7 treesize of output 3 [2022-07-20 06:26:48,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2275) |c_#memory_$Pointer$.base|)) (not (= |c_node_create_#res#1.base| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-20 06:26:48,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:48,746 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 14 treesize of output 16 [2022-07-20 06:26:49,473 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-20 06:26:49,473 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2022-07-20 06:26:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:49,480 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 46 treesize of output 46 [2022-07-20 06:26:49,662 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 43 treesize of output 31 [2022-07-20 06:26:49,991 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-20 06:26:49,992 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 48 treesize of output 17 [2022-07-20 06:26:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-07-20 06:26:50,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:50,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2277) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-07-20 06:26:50,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_2277) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-07-20 06:26:50,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:50,071 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 140 treesize of output 132 [2022-07-20 06:26:50,075 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 120 treesize of output 118 [2022-07-20 06:26:52,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (let ((.cse2 (not .cse4))) (let ((.cse3 (and (or .cse4 (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (not (= (select (let ((.cse8 (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) (bvadd v_arrayElimCell_272 (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_271 (_ bv4 32))) (_ bv0 32))))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (not (= (select (let ((.cse10 (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (bvadd v_arrayElimCell_272 (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_273 (_ bv4 32))) (_ bv0 32)))) .cse2)))) (and (or (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (not (= (select (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (bvadd v_arrayElimCell_271 (_ bv4 32)) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_273 (_ bv4 32))) (_ bv0 32)))) .cse2) (or .cse3 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_append_~head#1.offset|)) (or .cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (or .cse4 (forall ((v_arrayElimCell_271 (_ BitVec 32))) (not (= (let ((.cse7 (bvadd v_arrayElimCell_271 (_ bv4 32)))) (select (let ((.cse5 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse7)) (_ bv0 32))))))))) is different from false [2022-07-20 06:27:23,951 WARN L233 SmtUtils]: Spent 17.35s on a formula simplification. DAG size of input: 55 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:27:24,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1483705089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:24,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:27:24,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 50 [2022-07-20 06:27:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533815633] [2022-07-20 06:27:24,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:24,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 06:27:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:27:24,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 06:27:24,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3294, Unknown=47, NotChecked=726, Total=4290 [2022-07-20 06:27:24,905 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 50 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:27:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:27,368 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-07-20 06:27:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:27:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2022-07-20 06:27:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:27,369 INFO L225 Difference]: With dead ends: 135 [2022-07-20 06:27:27,369 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 06:27:27,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=425, Invalid=6190, Unknown=51, NotChecked=990, Total=7656 [2022-07-20 06:27:27,372 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:27,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1008 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 506 Unchecked, 0.4s Time] [2022-07-20 06:27:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 06:27:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-20 06:27:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 124 states have internal predecessors, (134), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:27:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2022-07-20 06:27:27,375 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 54 [2022-07-20 06:27:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:27,375 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2022-07-20 06:27:27,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:27:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2022-07-20 06:27:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:27:27,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:27,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-07-20 06:27:27,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:27,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:27,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:27:27,777 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:27:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash -937671670, now seen corresponding path program 1 times [2022-07-20 06:27:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:27:27,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261379910] [2022-07-20 06:27:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:27:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:27:27,779 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-20 06:27:27,779 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-20 06:27:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:27,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:27:27,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:28,028 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-20 06:27:28,030 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-20 06:27:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:27:28,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:27:28,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:27:28,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261379910] [2022-07-20 06:27:28,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261379910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:28,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:28,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:27:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32316740] [2022-07-20 06:27:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:27:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:27:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:27:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:27:28,043 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:27:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:28,187 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-07-20 06:27:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:27:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-07-20 06:27:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:28,188 INFO L225 Difference]: With dead ends: 143 [2022-07-20 06:27:28,188 INFO L226 Difference]: Without dead ends: 143 [2022-07-20 06:27:28,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:27:28,189 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:28,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 230 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:27:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-20 06:27:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-07-20 06:27:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 125 states have internal predecessors, (135), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:27:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-07-20 06:27:28,193 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 55 [2022-07-20 06:27:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:28,193 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-07-20 06:27:28,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:27:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-07-20 06:27:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:27:28,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:28,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-20 06:27:28,207 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-20 06:27:28,403 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-20 06:27:28,403 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:27:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:28,404 INFO L85 PathProgramCache]: Analyzing trace with hash 579814440, now seen corresponding path program 1 times [2022-07-20 06:27:28,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:27:28,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35675716] [2022-07-20 06:27:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:28,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:27:28,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:27:28,405 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-20 06:27:28,406 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-20 06:27:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:28,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 06:27:28,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:28,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:28,713 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-20 06:27:28,723 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-20 06:27:28,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:28,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:27:28,771 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-20 06:27:28,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:28,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:28,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-20 06:27:29,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:29,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:27:29,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:29,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:27:29,200 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-20 06:27:29,417 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:27:29,417 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:27:29,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:29,468 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:27:29,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 25 [2022-07-20 06:27:29,743 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-20 06:27:30,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:30,225 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-07-20 06:27:30,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:30,240 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-20 06:27:30,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2022-07-20 06:27:30,245 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 7 treesize of output 3 [2022-07-20 06:27:30,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-20 06:27:30,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:30,778 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:27:30,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 53 [2022-07-20 06:27:30,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:30,793 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 14 treesize of output 16 [2022-07-20 06:27:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:30,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-07-20 06:27:30,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:30,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:30,849 INFO L356 Elim1Store]: treesize reduction 51, result has 29.2 percent of original size [2022-07-20 06:27:30,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 54 [2022-07-20 06:27:31,271 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-20 06:27:32,624 INFO L356 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-07-20 06:27:32,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 93 [2022-07-20 06:27:32,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:32,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:32,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:32,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 06:27:32,672 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 7 treesize of output 3 [2022-07-20 06:27:32,728 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-07-20 06:27:32,728 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 38 treesize of output 30 [2022-07-20 06:27:33,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:33,467 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-07-20 06:27:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:33,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:36,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:27:36,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35675716] [2022-07-20 06:27:36,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35675716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:36,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2144783241] [2022-07-20 06:27:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:36,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:27:36,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:27:36,144 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:27:36,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-07-20 06:27:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:36,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 06:27:36,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:36,581 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-20 06:27:36,674 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-20 06:27:36,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:36,937 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-20 06:27:37,077 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-20 06:27:37,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:37,493 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-20 06:27:37,785 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-20 06:27:37,793 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-20 06:27:38,210 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:27:38,211 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-20 06:27:39,432 INFO L356 Elim1Store]: treesize reduction 64, result has 31.2 percent of original size [2022-07-20 06:27:39,432 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 56 [2022-07-20 06:27:39,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:39,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:27:43,219 INFO L356 Elim1Store]: treesize reduction 117, result has 56.5 percent of original size [2022-07-20 06:27:43,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 232 treesize of output 272 [2022-07-20 06:27:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:27:47,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:07,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:07,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 87 [2022-07-20 06:28:11,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:11,493 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 70 treesize of output 86 [2022-07-20 06:28:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2144783241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:12,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:28:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21] total 52 [2022-07-20 06:28:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681704237] [2022-07-20 06:28:12,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 06:28:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:28:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 06:28:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=4954, Unknown=23, NotChecked=0, Total=5256 [2022-07-20 06:28:12,164 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 53 states, 50 states have (on average 1.9) internal successors, (95), 44 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:28:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:20,395 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-07-20 06:28:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 06:28:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.9) internal successors, (95), 44 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-07-20 06:28:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:20,396 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:28:20,396 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:28:20,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2905 ImplicationChecksByTransitivity, 40.7s TimeCoverageRelationStatistics Valid=622, Invalid=8858, Unknown=26, NotChecked=0, Total=9506 [2022-07-20 06:28:20,397 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 43 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 821 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:20,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1153 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 821 Unchecked, 0.5s Time] [2022-07-20 06:28:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:28:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-20 06:28:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.2222222222222223) internal successors, (143), 131 states have internal predecessors, (143), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:28:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2022-07-20 06:28:20,400 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 55 [2022-07-20 06:28:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:20,401 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2022-07-20 06:28:20,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.9) internal successors, (95), 44 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:28:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2022-07-20 06:28:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:28:20,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:20,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-20 06:28:20,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-07-20 06:28:20,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:20,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:28:20,814 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:28:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash 579814441, now seen corresponding path program 1 times [2022-07-20 06:28:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:28:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721503242] [2022-07-20 06:28:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:20,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:28:20,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:28:20,816 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-20 06:28:20,818 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-20 06:28:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:21,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-20 06:28:21,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:21,147 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-20 06:28:21,152 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-20 06:28:21,178 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-20 06:28:21,181 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-20 06:28:21,304 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:28:21,305 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 24 [2022-07-20 06:28:21,327 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-20 06:28:21,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-20 06:28:21,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:28:21,621 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:28:21,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:28:21,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 06:28:21,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 06:28:22,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:22,280 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-20 06:28:22,285 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-20 06:28:22,288 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 7 treesize of output 3 [2022-07-20 06:28:22,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:22,650 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-20 06:28:22,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:22,662 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-20 06:28:22,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:22,701 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-20 06:28:22,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2022-07-20 06:28:22,733 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 13 [2022-07-20 06:28:24,574 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-07-20 06:28:24,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 128 [2022-07-20 06:28:24,612 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:24,612 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 109 treesize of output 102 [2022-07-20 06:28:24,636 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 7 treesize of output 3 [2022-07-20 06:28:24,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:24,665 INFO L356 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2022-07-20 06:28:24,665 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 55 [2022-07-20 06:28:25,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:25,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:25,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 65 [2022-07-20 06:28:25,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2022-07-20 06:28:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:28:26,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:27,287 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (and (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse1)))) is different from false [2022-07-20 06:28:27,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (and (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (= |c_ULTIMATE.start_sll_append_#t~mem11#1.base| (_ bv0 32))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse1)))) is different from false [2022-07-20 06:28:27,358 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv8 32)))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) (_ bv0 32))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (bvule .cse0 .cse1))))) (and (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32))))) (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-20 06:28:27,396 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv8 32)))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) .cse0) (_ bv0 32))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|))) (not (bvule .cse0 .cse1))))) (and (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32))))))) is different from false [2022-07-20 06:28:27,437 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ bv8 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (.cse0 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ bv4 32)))) (or (not (bvule .cse0 .cse1)) (not (bvule .cse1 (select |c_#length| .cse2))) (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse0) (_ bv0 32)))))) (and (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse4 (_ bv4 32)) (bvadd .cse4 (_ bv8 32))))))) is different from false [2022-07-20 06:28:27,507 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ bv8 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (.cse0 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ bv4 32)))) (or (not (bvule .cse0 .cse1)) (not (bvule .cse1 (select |c_#length| .cse2))) (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse0) (_ bv0 32)))))) (and (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse4 (_ bv4 32)) (bvadd .cse4 (_ bv8 32)))))) (not (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from false [2022-07-20 06:28:27,560 WARN L833 $PredicateComparison]: unable to prove that (or (not (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|) (select |c_#length| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|))) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ bv4 32))) (.cse1 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_45| (_ bv8 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)))) (or (not (bvule .cse0 .cse1)) (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse0) (_ bv0 32))) (not (bvule .cse1 (select |c_#length| .cse2)))))) (and (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)) v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))) (forall ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2582) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-20 06:28:30,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:28:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721503242] [2022-07-20 06:28:30,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721503242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [732859901] [2022-07-20 06:28:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:30,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:28:30,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:28:30,154 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:28:30,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-07-20 06:28:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:30,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-20 06:28:30,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:30,613 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-20 06:28:30,742 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-20 06:28:31,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:31,039 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-20 06:28:31,203 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-20 06:28:31,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:31,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:32,676 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-20 06:28:32,680 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-20 06:28:33,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:33,622 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 22 [2022-07-20 06:28:33,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:33,638 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-20 06:28:36,575 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-07-20 06:28:36,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 108 [2022-07-20 06:28:36,601 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:36,602 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 117 treesize of output 108 [2022-07-20 06:28:36,630 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 7 treesize of output 3 [2022-07-20 06:28:36,664 INFO L356 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2022-07-20 06:28:36,665 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 50 treesize of output 30 [2022-07-20 06:28:38,605 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-20 06:28:38,605 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 121 treesize of output 58 [2022-07-20 06:28:38,612 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 67 treesize of output 47 [2022-07-20 06:28:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:40,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:40,459 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (not (bvule .cse0 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (and (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse0)))) is different from false [2022-07-20 06:28:40,494 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (not (bvule .cse0 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (and (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |c_ULTIMATE.start_sll_append_#t~mem11#1.base| (_ bv0 32))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse0)))) is different from false [2022-07-20 06:28:40,558 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv8 32)))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) (_ bv0 32))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (bvule .cse0 .cse1))))) (and (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-20 06:28:40,609 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv8 32)))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) .cse0) (_ bv0 32))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|))) (not (bvule .cse0 .cse1))))) (and (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))) (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-20 06:28:40,666 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (and (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) (not (bvule .cse2 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse2)) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ BitVec 32))) (let ((.cse4 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv4 32))) (.cse5 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv8 32))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) (_ bv0 32))) (not (bvule .cse4 .cse5)) (not (bvule .cse5 (select |c_#length| .cse3)))))))) is different from false [2022-07-20 06:28:40,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|))) (or (and (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)) v_ArrVal_2663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (not (bvule .cse2 (select |c_#length| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|))) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ BitVec 32))) (let ((.cse3 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv8 32))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|))) (.cse5 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv4 32)))) (or (not (bvule .cse3 (select |c_#length| .cse4))) (not (bvule .cse5 .cse3)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)))))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|) .cse2)))) is different from false [2022-07-20 06:28:40,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:40,834 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 244 treesize of output 199 [2022-07-20 06:28:40,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 11 treesize of output 7 [2022-07-20 06:28:48,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [732859901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:48,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:28:48,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 57 [2022-07-20 06:28:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520473500] [2022-07-20 06:28:48,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:48,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-20 06:28:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:28:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-20 06:28:48,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=3879, Unknown=98, NotChecked=1794, Total=6006 [2022-07-20 06:28:48,119 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 58 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 50 states have internal predecessors, (97), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:28:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:55,621 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2022-07-20 06:28:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 06:28:55,622 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 50 states have internal predecessors, (97), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-07-20 06:28:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:55,623 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:28:55,623 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:28:55,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=480, Invalid=7829, Unknown=115, NotChecked=2496, Total=10920 [2022-07-20 06:28:55,624 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 821 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:55,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1620 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 348 Invalid, 0 Unknown, 821 Unchecked, 0.5s Time] [2022-07-20 06:28:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:28:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-20 06:28:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 131 states have internal predecessors, (142), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:28:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2022-07-20 06:28:55,627 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 55 [2022-07-20 06:28:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:55,628 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2022-07-20 06:28:55,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 50 states have internal predecessors, (97), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:28:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2022-07-20 06:28:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 06:28:55,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:55,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-07-20 06:28:55,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:55,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-07-20 06:28:56,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:28:56,029 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:28:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 840703450, now seen corresponding path program 1 times [2022-07-20 06:28:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:28:56,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346338430] [2022-07-20 06:28:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:28:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:28:56,031 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-20 06:28:56,032 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-20 06:28:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:56,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:28:56,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:56,551 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-20 06:28:56,727 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 7 treesize of output 3 [2022-07-20 06:28:56,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:56,737 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 12 treesize of output 20 [2022-07-20 06:28:56,827 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_2737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2737) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2736))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-20 06:28:56,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:56,922 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-20 06:28:56,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-07-20 06:28:56,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:56,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, 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-20 06:28:57,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:57,297 INFO L356 Elim1Store]: treesize reduction 23, result has 41.0 percent of original size [2022-07-20 06:28:57,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 38 [2022-07-20 06:28:57,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:57,503 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-20 06:28:57,566 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-20 06:28:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-20 06:28:57,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:57,808 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 22 treesize of output 18 [2022-07-20 06:28:58,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 06:28:59,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:28:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346338430] [2022-07-20 06:28:59,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346338430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1053804690] [2022-07-20 06:28:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:59,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:28:59,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:28:59,559 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:28:59,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2022-07-20 06:28:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:59,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 06:28:59,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:29:01,007 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 7 treesize of output 3 [2022-07-20 06:29:01,025 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 7 treesize of output 3 [2022-07-20 06:29:01,189 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2811))) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2812 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2812) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 06:29:01,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:01,275 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-20 06:29:01,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:01,287 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-20 06:29:01,487 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-20 06:29:01,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:01,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-20 06:29:01,908 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-20 06:29:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-20 06:29:01,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:29:01,944 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 22 treesize of output 18 [2022-07-20 06:29:02,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) is different from false [2022-07-20 06:29:02,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_2815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) is different from false [2022-07-20 06:29:02,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_2815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) is different from false [2022-07-20 06:29:02,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1053804690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:29:02,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:29:02,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 43 [2022-07-20 06:29:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979544157] [2022-07-20 06:29:02,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:29:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 06:29:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:29:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 06:29:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2702, Unknown=49, NotChecked=666, Total=3660 [2022-07-20 06:29:02,977 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 44 states, 41 states have (on average 2.292682926829268) internal successors, (94), 39 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:29:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:29:05,125 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2022-07-20 06:29:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:29:05,126 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.292682926829268) internal successors, (94), 39 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-07-20 06:29:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:29:05,127 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:29:05,127 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:29:05,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=419, Invalid=4373, Unknown=62, NotChecked=846, Total=5700 [2022-07-20 06:29:05,128 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:29:05,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 768 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 402 Invalid, 0 Unknown, 279 Unchecked, 0.5s Time] [2022-07-20 06:29:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:29:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-20 06:29:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 136 states have internal predecessors, (147), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:29:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2022-07-20 06:29:05,132 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 57 [2022-07-20 06:29:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:29:05,132 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2022-07-20 06:29:05,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.292682926829268) internal successors, (94), 39 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:29:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2022-07-20 06:29:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 06:29:05,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:29:05,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-07-20 06:29:05,148 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-20 06:29:05,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2022-07-20 06:29:05,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:29:05,534 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-07-20 06:29:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:29:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1106400888, now seen corresponding path program 1 times [2022-07-20 06:29:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:29:05,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316366211] [2022-07-20 06:29:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:29:05,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:29:05,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:29:05,537 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-20 06:29:05,539 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-20 06:29:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:29:05,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 06:29:05,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:29:05,902 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-20 06:29:05,924 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-20 06:29:06,021 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:29:06,021 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 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:29:06,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:29:06,263 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-20 06:29:06,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-20 06:29:06,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 06:29:06,813 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:29:06,813 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 73 treesize of output 32 [2022-07-20 06:29:06,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:29:06,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-20 06:29:07,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:07,094 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:29:07,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 63 [2022-07-20 06:29:07,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:07,133 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:29:07,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 06:29:07,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:07,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 06:29:08,105 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 06:29:08,106 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2022-07-20 06:29:08,134 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:29:08,135 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 28 treesize of output 31 [2022-07-20 06:29:08,344 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-20 06:29:08,648 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:29:08,648 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 80 treesize of output 31 [2022-07-20 06:29:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:29:08,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:29:08,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2895))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2896) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-07-20 06:29:08,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2895))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2896) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-07-20 06:29:08,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2895))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2896) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-20 06:29:08,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2895))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2896) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-20 06:29:09,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2895))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2896) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-20 06:29:09,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:29:09,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316366211] [2022-07-20 06:29:09,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316366211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:29:09,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1205465115] [2022-07-20 06:29:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:29:09,283 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:29:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:29:09,284 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:29:09,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-07-20 06:29:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:29:09,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-20 06:29:09,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:29:09,796 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-20 06:29:09,878 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-20 06:29:10,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:10,201 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-20 06:29:10,537 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-20 06:29:10,626 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-20 06:29:10,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:10,935 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-20 06:29:11,222 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-20 06:29:11,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-20 06:29:11,856 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-20 06:29:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:11,863 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 15 treesize of output 7 [2022-07-20 06:29:11,867 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 9 treesize of output 7 [2022-07-20 06:29:12,606 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:29:12,606 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:29:12,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:12,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:12,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:12,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 06:29:12,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:12,638 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 38 treesize of output 36 [2022-07-20 06:29:12,652 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 06:29:12,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19