./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:16:45,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:16:45,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:16:45,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:16:45,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:16:45,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:16:45,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:16:45,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:16:45,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:16:45,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:16:45,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:16:45,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:16:45,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:16:45,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:16:45,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:16:45,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:16:45,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:16:45,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:16:45,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:16:45,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:16:45,453 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:16:45,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:16:45,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:16:45,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:16:45,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:16:45,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:16:45,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:16:45,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:16:45,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:16:45,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:16:45,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:16:45,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:16:45,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:16:45,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:16:45,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:16:45,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:16:45,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:16:45,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:16:45,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:16:45,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:16:45,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:16:45,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:16:45,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:16:45,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:16:45,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:16:45,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:16:45,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:16:45,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:16:45,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:16:45,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:16:45,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:16:45,504 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:16:45,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:16:45,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:16:45,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:16:45,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:16:45,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:16:45,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:16:45,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:16:45,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:16:45,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:16:45,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:16:45,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:45,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:16:45,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:16:45,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:16:45,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:16:45,508 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-07-12 19:16:45,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:16:45,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:16:45,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:16:45,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:16:45,685 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:16:45,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-07-12 19:16:45,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea7650332/0e638ef3c67e4d99a8da4c67d14806ce/FLAG9cc0b6c67 [2022-07-12 19:16:46,148 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:16:46,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-07-12 19:16:46,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea7650332/0e638ef3c67e4d99a8da4c67d14806ce/FLAG9cc0b6c67 [2022-07-12 19:16:46,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea7650332/0e638ef3c67e4d99a8da4c67d14806ce [2022-07-12 19:16:46,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:16:46,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:16:46,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:46,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:16:46,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:16:46,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b9f264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46, skipping insertion in model container [2022-07-12 19:16:46,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:16:46,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:16:46,464 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/sll2c_insert_unequal.i[24872,24885] [2022-07-12 19:16:46,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:46,474 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:16:46,510 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/sll2c_insert_unequal.i[24872,24885] [2022-07-12 19:16:46,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:46,529 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:16:46,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46 WrapperNode [2022-07-12 19:16:46,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:46,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:46,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:16:46,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:16:46,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,563 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 178 [2022-07-12 19:16:46,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:46,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:16:46,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:16:46,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:16:46,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:16:46,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:16:46,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:16:46,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:16:46,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (1/1) ... [2022-07-12 19:16:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:46,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:46,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:16:46,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:16:46,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:16:46,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:16:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:16:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:16:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:16:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:16:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:16:46,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:16:46,746 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:16:46,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:16:47,044 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:16:47,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:16:47,052 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 19:16:47,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:47 BoogieIcfgContainer [2022-07-12 19:16:47,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:16:47,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:16:47,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:16:47,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:16:47,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:16:46" (1/3) ... [2022-07-12 19:16:47,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ab9e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:47, skipping insertion in model container [2022-07-12 19:16:47,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:46" (2/3) ... [2022-07-12 19:16:47,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ab9e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:47, skipping insertion in model container [2022-07-12 19:16:47,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:47" (3/3) ... [2022-07-12 19:16:47,061 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-07-12 19:16:47,070 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:16:47,071 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-07-12 19:16:47,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:16:47,117 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@5661aa6f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@758c7688 [2022-07-12 19:16:47,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-07-12 19:16:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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-12 19:16:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:47,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:47,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:47,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2022-07-12 19:16:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:47,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927798501] [2022-07-12 19:16:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927798501] [2022-07-12 19:16:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927798501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:47,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:47,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792690288] [2022-07-12 19:16:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:47,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:47,317 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 19:16:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:47,442 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-07-12 19:16:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:47,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-12 19:16:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:47,462 INFO L225 Difference]: With dead ends: 139 [2022-07-12 19:16:47,462 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:16:47,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:47,465 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:47,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:16:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-07-12 19:16:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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-12 19:16:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-07-12 19:16:47,513 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2022-07-12 19:16:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:47,513 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-07-12 19:16:47,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 19:16:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-07-12 19:16:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:47,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:47,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:47,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:16:47,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2022-07-12 19:16:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:47,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307173209] [2022-07-12 19:16:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:47,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307173209] [2022-07-12 19:16:47,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307173209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:47,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:47,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289139804] [2022-07-12 19:16:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:47,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:47,607 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 19:16:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:47,688 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-07-12 19:16:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-12 19:16:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:47,692 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:16:47,692 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:16:47,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:47,696 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:47,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:16:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-12 19:16:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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-12 19:16:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-07-12 19:16:47,708 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2022-07-12 19:16:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:47,709 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-12 19:16:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 19:16:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-07-12 19:16:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:16:47,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:47,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:47,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:16:47,711 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2022-07-12 19:16:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:47,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223617657] [2022-07-12 19:16:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:47,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223617657] [2022-07-12 19:16:47,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223617657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:47,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:47,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415308718] [2022-07-12 19:16:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:47,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:47,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:47,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:47,795 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-12 19:16:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:47,883 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-07-12 19:16:47,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:47,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-12 19:16:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:47,884 INFO L225 Difference]: With dead ends: 141 [2022-07-12 19:16:47,885 INFO L226 Difference]: Without dead ends: 141 [2022-07-12 19:16:47,885 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-12 19:16:47,886 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:47,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-12 19:16:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-07-12 19:16:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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-12 19:16:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-07-12 19:16:47,892 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2022-07-12 19:16:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:47,892 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-07-12 19:16:47,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-12 19:16:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-07-12 19:16:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:47,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:47,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:47,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:16:47,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2022-07-12 19:16:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:47,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561214617] [2022-07-12 19:16:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:47,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561214617] [2022-07-12 19:16:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561214617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:47,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:47,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855282432] [2022-07-12 19:16:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:47,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:47,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:47,977 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:48,169 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2022-07-12 19:16:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:16:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:48,172 INFO L225 Difference]: With dead ends: 135 [2022-07-12 19:16:48,172 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 19:16:48,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-12 19:16:48,173 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:48,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 488 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 19:16:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2022-07-12 19:16:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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-12 19:16:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-07-12 19:16:48,177 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2022-07-12 19:16:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:48,178 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-12 19:16:48,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-07-12 19:16:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:48,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:48,179 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:48,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:16:48,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:48,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2022-07-12 19:16:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:48,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688336506] [2022-07-12 19:16:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:48,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688336506] [2022-07-12 19:16:48,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688336506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:48,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:48,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392644780] [2022-07-12 19:16:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:48,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:48,271 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:48,471 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-07-12 19:16:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:48,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:16:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:48,474 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:16:48,474 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:16:48,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12 19:16:48,475 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:48,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 512 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:16:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-12 19:16:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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-12 19:16:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-12 19:16:48,500 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2022-07-12 19:16:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:48,500 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-12 19:16:48,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-12 19:16:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:48,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:48,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:48,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:16:48,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2022-07-12 19:16:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:48,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986213381] [2022-07-12 19:16:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:16:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986213381] [2022-07-12 19:16:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986213381] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480168364] [2022-07-12 19:16:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:48,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:48,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:16:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:48,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:16:48,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:48,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:48,873 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:48,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:16:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:48,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:49,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480168364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:49,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:16:49,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-12 19:16:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336930968] [2022-07-12 19:16:49,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:49,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:16:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:16:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:16:49,163 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:49,405 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-07-12 19:16:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-12 19:16:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:49,406 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:16:49,407 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:16:49,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:16:49,407 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 26 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:49,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 998 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 509 Invalid, 0 Unknown, 254 Unchecked, 0.2s Time] [2022-07-12 19:16:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:16:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-12 19:16:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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-12 19:16:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-12 19:16:49,411 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 25 [2022-07-12 19:16:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:49,411 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-12 19:16:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-12 19:16:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:49,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:49,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:49,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:49,627 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-12 19:16:49,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2022-07-12 19:16:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:49,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901645316] [2022-07-12 19:16:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:49,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:49,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901645316] [2022-07-12 19:16:49,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901645316] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:49,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595786185] [2022-07-12 19:16:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:49,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:49,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:16:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:49,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 19:16:49,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:49,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:50,117 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:50,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:50,122 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 11 [2022-07-12 19:16:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:50,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:50,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595786185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:50,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:50,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-07-12 19:16:50,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779888058] [2022-07-12 19:16:50,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:50,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:16:50,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:16:50,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:16:50,273 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:16:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:50,883 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2022-07-12 19:16:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-12 19:16:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:50,884 INFO L225 Difference]: With dead ends: 133 [2022-07-12 19:16:50,884 INFO L226 Difference]: Without dead ends: 133 [2022-07-12 19:16:50,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:16:50,885 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 144 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:50,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 979 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:16:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-12 19:16:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-07-12 19:16:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 126 states have internal predecessors, (137), 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-12 19:16:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-07-12 19:16:50,890 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 25 [2022-07-12 19:16:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:50,891 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-07-12 19:16:50,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:16:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-07-12 19:16:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:50,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:50,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:50,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:51,104 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-12 19:16:51,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2022-07-12 19:16:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:51,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546299001] [2022-07-12 19:16:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:51,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:51,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546299001] [2022-07-12 19:16:51,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546299001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:51,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353865544] [2022-07-12 19:16:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:51,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:51,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:51,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:51,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:16:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:51,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:16:51,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:51,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:51,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:16:51,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:16:51,585 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:51,585 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-12 19:16:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:51,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353865544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:51,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:51,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-07-12 19:16:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239617218] [2022-07-12 19:16:51,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:51,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:16:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:16:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:16:51,715 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:52,034 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2022-07-12 19:16:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:52,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-12 19:16:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:52,035 INFO L225 Difference]: With dead ends: 155 [2022-07-12 19:16:52,035 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 19:16:52,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:16:52,036 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 174 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:52,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 609 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 526 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2022-07-12 19:16:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 19:16:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2022-07-12 19:16:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 128 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2022-07-12 19:16:52,041 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 37 [2022-07-12 19:16:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:52,041 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2022-07-12 19:16:52,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2022-07-12 19:16:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:52,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:52,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:52,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:52,255 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-12 19:16:52,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -148939744, now seen corresponding path program 1 times [2022-07-12 19:16:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:52,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496361726] [2022-07-12 19:16:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:52,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:52,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496361726] [2022-07-12 19:16:52,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496361726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:52,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:16:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235211077] [2022-07-12 19:16:52,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:52,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:16:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:16:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:16:52,427 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:52,622 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2022-07-12 19:16:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:16:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:52,623 INFO L225 Difference]: With dead ends: 144 [2022-07-12 19:16:52,623 INFO L226 Difference]: Without dead ends: 144 [2022-07-12 19:16:52,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:52,624 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 240 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:52,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 155 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-12 19:16:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2022-07-12 19:16:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 119 states have internal predecessors, (131), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2022-07-12 19:16:52,628 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 37 [2022-07-12 19:16:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:52,628 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2022-07-12 19:16:52,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2022-07-12 19:16:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:16:52,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:52,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:52,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:16:52,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash -362722266, now seen corresponding path program 1 times [2022-07-12 19:16:52,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:52,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361322936] [2022-07-12 19:16:52,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 19:16:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:52,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361322936] [2022-07-12 19:16:52,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361322936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:52,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580956717] [2022-07-12 19:16:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:52,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:16:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:53,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 19:16:53,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:53,188 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-12 19:16:53,263 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_782 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_782)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-07-12 19:16:53,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:53,290 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-12 19:16:53,300 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-07-12 19:16:53,301 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 23 treesize of output 24 [2022-07-12 19:16:53,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:16:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:16:53,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:53,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580956717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:53,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:53,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2022-07-12 19:16:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350820895] [2022-07-12 19:16:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:53,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:16:53,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:53,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:16:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2022-07-12 19:16:53,329 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:53,748 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2022-07-12 19:16:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:16:53,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-07-12 19:16:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:53,750 INFO L225 Difference]: With dead ends: 232 [2022-07-12 19:16:53,750 INFO L226 Difference]: Without dead ends: 232 [2022-07-12 19:16:53,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=716, Unknown=1, NotChecked=56, Total=930 [2022-07-12 19:16:53,750 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 751 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:53,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 446 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 560 Invalid, 0 Unknown, 145 Unchecked, 0.3s Time] [2022-07-12 19:16:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-12 19:16:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 128. [2022-07-12 19:16:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 121 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2022-07-12 19:16:53,753 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 40 [2022-07-12 19:16:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:53,754 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2022-07-12 19:16:53,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2022-07-12 19:16:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:16:53,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:53,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:53,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:53,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:53,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash -362722265, now seen corresponding path program 1 times [2022-07-12 19:16:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:53,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679352673] [2022-07-12 19:16:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:54,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679352673] [2022-07-12 19:16:54,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679352673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:54,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789594523] [2022-07-12 19:16:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:54,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:54,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:54,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:54,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:16:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:54,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 19:16:54,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:54,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:54,611 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:54,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:16:54,748 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:54,748 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 22 [2022-07-12 19:16:55,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:55,189 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 22 treesize of output 24 [2022-07-12 19:16:55,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:55,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 19:16:55,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:55,204 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 29 treesize of output 29 [2022-07-12 19:16:55,214 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-12 19:16:55,214 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 20 treesize of output 22 [2022-07-12 19:16:55,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 23 treesize of output 15 [2022-07-12 19:16:55,251 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-12 19:16:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:55,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:55,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789594523] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:55,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:55,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 40 [2022-07-12 19:16:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404204800] [2022-07-12 19:16:55,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:55,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 19:16:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 19:16:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1834, Unknown=2, NotChecked=0, Total=1980 [2022-07-12 19:16:55,881 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:16:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:57,437 INFO L93 Difference]: Finished difference Result 247 states and 273 transitions. [2022-07-12 19:16:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:16:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-07-12 19:16:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:57,440 INFO L225 Difference]: With dead ends: 247 [2022-07-12 19:16:57,440 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 19:16:57,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=368, Invalid=3052, Unknown=2, NotChecked=0, Total=3422 [2022-07-12 19:16:57,442 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2058 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:57,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 704 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1088 Invalid, 0 Unknown, 425 Unchecked, 0.8s Time] [2022-07-12 19:16:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 19:16:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 115. [2022-07-12 19:16:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 110 states have internal predecessors, (122), 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-12 19:16:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-07-12 19:16:57,447 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 40 [2022-07-12 19:16:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:57,447 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-07-12 19:16:57,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:16:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-07-12 19:16:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:16:57,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:57,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:57,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:57,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 19:16:57,661 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1640510023, now seen corresponding path program 1 times [2022-07-12 19:16:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:57,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007087637] [2022-07-12 19:16:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:57,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:57,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007087637] [2022-07-12 19:16:57,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007087637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:57,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:57,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089263880] [2022-07-12 19:16:57,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:57,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:57,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:57,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:57,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:57,706 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:57,762 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2022-07-12 19:16:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-07-12 19:16:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:57,763 INFO L225 Difference]: With dead ends: 177 [2022-07-12 19:16:57,763 INFO L226 Difference]: Without dead ends: 177 [2022-07-12 19:16:57,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:57,764 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:57,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 273 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-12 19:16:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2022-07-12 19:16:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.618421052631579) internal successors, (123), 111 states have internal predecessors, (123), 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-12 19:16:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2022-07-12 19:16:57,767 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 41 [2022-07-12 19:16:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:57,767 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2022-07-12 19:16:57,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2022-07-12 19:16:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:16:57,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:57,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:57,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:16:57,768 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash 277382184, now seen corresponding path program 1 times [2022-07-12 19:16:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:57,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320746234] [2022-07-12 19:16:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:16:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320746234] [2022-07-12 19:16:57,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320746234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:57,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:57,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233326249] [2022-07-12 19:16:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:57,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:57,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:57,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:57,832 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:57,979 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-07-12 19:16:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-12 19:16:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:57,980 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:16:57,980 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:16:57,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-12 19:16:57,982 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 90 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:57,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 337 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:16:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2022-07-12 19:16:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 108 states have internal predecessors, (120), 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-12 19:16:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2022-07-12 19:16:57,986 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2022-07-12 19:16:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:57,986 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2022-07-12 19:16:57,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2022-07-12 19:16:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:16:57,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:57,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:16:57,988 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash 277382185, now seen corresponding path program 1 times [2022-07-12 19:16:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:57,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212195097] [2022-07-12 19:16:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:16:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212195097] [2022-07-12 19:16:58,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212195097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:58,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965824841] [2022-07-12 19:16:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:58,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:58,079 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:58,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:16:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:16:58,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:58,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:58,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965824841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:58,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:58,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 19:16:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255726748] [2022-07-12 19:16:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:58,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:58,284 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:58,295 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-07-12 19:16:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-07-12 19:16:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:58,297 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:16:58,297 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:16:58,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:58,297 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 103 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:58,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 234 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:16:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 19:16:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 107 states have internal predecessors, (118), 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-12 19:16:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2022-07-12 19:16:58,300 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 43 [2022-07-12 19:16:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:58,300 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2022-07-12 19:16:58,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2022-07-12 19:16:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:16:58,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:58,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:58,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:58,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:58,512 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 278707084, now seen corresponding path program 1 times [2022-07-12 19:16:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:58,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994011533] [2022-07-12 19:16:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:16:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994011533] [2022-07-12 19:16:58,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994011533] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181103939] [2022-07-12 19:16:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:58,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:58,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:58,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:16:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:58,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:16:58,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:58,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:58,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181103939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:58,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:58,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 19:16:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225316361] [2022-07-12 19:16:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:58,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:16:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:16:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:58,789 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:58,806 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-07-12 19:16:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:16:58,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-07-12 19:16:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:58,807 INFO L225 Difference]: With dead ends: 109 [2022-07-12 19:16:58,807 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 19:16:58,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:16:58,808 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 276 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:58,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 148 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 19:16:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-12 19:16:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 104 states have internal predecessors, (114), 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-12 19:16:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2022-07-12 19:16:58,810 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 43 [2022-07-12 19:16:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:58,811 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2022-07-12 19:16:58,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2022-07-12 19:16:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:16:58,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:58,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:58,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:59,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:59,027 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 49983393, now seen corresponding path program 1 times [2022-07-12 19:16:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:59,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847762602] [2022-07-12 19:16:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:59,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847762602] [2022-07-12 19:16:59,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847762602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:59,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:59,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143141550] [2022-07-12 19:16:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:59,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:16:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:16:59,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:16:59,075 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:59,167 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-07-12 19:16:59,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:16:59,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-12 19:16:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:59,168 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:16:59,168 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:16:59,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-12 19:16:59,169 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:59,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 225 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:16:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2022-07-12 19:16:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.527027027027027) internal successors, (113), 103 states have internal predecessors, (113), 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-12 19:16:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-07-12 19:16:59,171 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 44 [2022-07-12 19:16:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:59,172 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-07-12 19:16:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-07-12 19:16:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:16:59,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:59,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:59,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:16:59,173 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 49983394, now seen corresponding path program 1 times [2022-07-12 19:16:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:59,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642478271] [2022-07-12 19:16:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:59,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642478271] [2022-07-12 19:16:59,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642478271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:59,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:59,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425785915] [2022-07-12 19:16:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:59,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:16:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:16:59,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:16:59,235 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:59,332 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-07-12 19:16:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:16:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-12 19:16:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:59,333 INFO L225 Difference]: With dead ends: 107 [2022-07-12 19:16:59,333 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 19:16:59,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-12 19:16:59,334 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 87 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:59,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 218 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 19:16:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-12 19:16:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 102 states have internal predecessors, (112), 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-12 19:16:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2022-07-12 19:16:59,337 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 44 [2022-07-12 19:16:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:59,337 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2022-07-12 19:16:59,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-07-12 19:16:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:16:59,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:59,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:59,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:16:59,338 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1549485211, now seen corresponding path program 1 times [2022-07-12 19:16:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119156341] [2022-07-12 19:16:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:16:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:59,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119156341] [2022-07-12 19:16:59,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119156341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:59,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:59,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508160696] [2022-07-12 19:16:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:59,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:59,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:59,434 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:59,558 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-07-12 19:16:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 19:16:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:59,559 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:16:59,559 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:16:59,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-12 19:16:59,560 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 84 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:59,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 340 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:16:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 19:16:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.472972972972973) internal successors, (109), 99 states have internal predecessors, (109), 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-12 19:16:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-12 19:16:59,562 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2022-07-12 19:16:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:59,562 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-12 19:16:59,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-12 19:16:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:16:59,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:59,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:59,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:16:59,563 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:16:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722015, now seen corresponding path program 1 times [2022-07-12 19:16:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235957999] [2022-07-12 19:16:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:59,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:59,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235957999] [2022-07-12 19:16:59,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235957999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:59,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295202012] [2022-07-12 19:16:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:59,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:59,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:17:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:00,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 19:17:00,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:00,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:17:00,403 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:00,404 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 20 treesize of output 27 [2022-07-12 19:17:00,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:17:00,532 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:00,532 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 13 treesize of output 13 [2022-07-12 19:17:00,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:00,654 INFO L356 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-07-12 19:17:00,654 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 32 treesize of output 35 [2022-07-12 19:17:00,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 19:17:01,013 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:17:01,013 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 55 treesize of output 54 [2022-07-12 19:17:01,016 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 29 treesize of output 27 [2022-07-12 19:17:01,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:01,073 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 24 treesize of output 24 [2022-07-12 19:17:01,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:17:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:01,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:01,252 INFO L356 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2022-07-12 19:17:01,252 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 22 treesize of output 21 [2022-07-12 19:17:01,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-12 19:17:01,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) is different from false [2022-07-12 19:17:01,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-12 19:17:01,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-12 19:17:01,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1943) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-12 19:17:01,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| Int) (v_ArrVal_1948 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| v_ArrVal_1948))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store .cse1 .cse0 v_ArrVal_1943) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| v_ArrVal_1944) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_13| |c_#StackHeapBarrier|)))) is different from false [2022-07-12 19:17:01,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295202012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:01,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:01,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 45 [2022-07-12 19:17:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085917538] [2022-07-12 19:17:01,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 19:17:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 19:17:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2057, Unknown=51, NotChecked=582, Total=2862 [2022-07-12 19:17:01,296 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 46 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 39 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:17:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:03,879 INFO L93 Difference]: Finished difference Result 317 states and 351 transitions. [2022-07-12 19:17:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 19:17:03,879 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 39 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-07-12 19:17:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:03,880 INFO L225 Difference]: With dead ends: 317 [2022-07-12 19:17:03,881 INFO L226 Difference]: Without dead ends: 317 [2022-07-12 19:17:03,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=792, Invalid=6477, Unknown=65, NotChecked=1038, Total=8372 [2022-07-12 19:17:03,882 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2226 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:03,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 1246 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 19:17:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-12 19:17:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 105. [2022-07-12 19:17:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 100 states have internal predecessors, (111), 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-12 19:17:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-12 19:17:03,886 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 49 [2022-07-12 19:17:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:03,886 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-12 19:17:03,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 39 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:17:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-12 19:17:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:17:03,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:03,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:03,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:04,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:04,091 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722016, now seen corresponding path program 1 times [2022-07-12 19:17:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:04,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316484848] [2022-07-12 19:17:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:04,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:04,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316484848] [2022-07-12 19:17:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316484848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040178164] [2022-07-12 19:17:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:04,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:04,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:04,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:04,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:17:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:04,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 19:17:04,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:05,301 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-12 19:17:05,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 19:17:05,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:05,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:05,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:05,500 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 42 treesize of output 33 [2022-07-12 19:17:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:05,504 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 24 treesize of output 19 [2022-07-12 19:17:05,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:05,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-07-12 19:17:05,515 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:05,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 19:17:05,853 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:05,854 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 53 treesize of output 50 [2022-07-12 19:17:05,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:05,860 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 33 treesize of output 33 [2022-07-12 19:17:05,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:05,921 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 39 treesize of output 37 [2022-07-12 19:17:05,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:05,924 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 29 treesize of output 29 [2022-07-12 19:17:05,983 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-12 19:17:05,986 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-12 19:17:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:06,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:06,198 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2135 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-12 19:17:06,204 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2133) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-12 19:17:06,237 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2133) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:06,245 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2133) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:06,254 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2133) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:06,262 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2135) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2133) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-12 19:17:06,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040178164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:06,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:06,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2022-07-12 19:17:06,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464534474] [2022-07-12 19:17:06,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:06,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 19:17:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:06,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 19:17:06,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2278, Unknown=6, NotChecked=606, Total=3080 [2022-07-12 19:17:06,463 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 46 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 40 states have internal predecessors, (77), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:08,913 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2022-07-12 19:17:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:17:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 40 states have internal predecessors, (77), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2022-07-12 19:17:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:08,914 INFO L225 Difference]: With dead ends: 184 [2022-07-12 19:17:08,914 INFO L226 Difference]: Without dead ends: 184 [2022-07-12 19:17:08,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=455, Invalid=4255, Unknown=6, NotChecked=834, Total=5550 [2022-07-12 19:17:08,915 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 876 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:08,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1375 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 19:17:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-12 19:17:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 107. [2022-07-12 19:17:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.4125) internal successors, (113), 102 states have internal predecessors, (113), 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-12 19:17:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-07-12 19:17:08,918 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 49 [2022-07-12 19:17:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:08,918 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-07-12 19:17:08,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 40 states have internal predecessors, (77), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-07-12 19:17:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:17:08,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:08,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:08,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:09,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:09,126 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 776998409, now seen corresponding path program 1 times [2022-07-12 19:17:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:09,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576522864] [2022-07-12 19:17:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576522864] [2022-07-12 19:17:09,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576522864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837422242] [2022-07-12 19:17:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:09,227 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:09,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:17:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:17:09,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:09,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:09,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:09,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:09,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837422242] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:09,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:17:09,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-07-12 19:17:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858878401] [2022-07-12 19:17:09,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:17:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:17:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:09,526 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:09,623 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-07-12 19:17:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-12 19:17:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:09,624 INFO L225 Difference]: With dead ends: 99 [2022-07-12 19:17:09,624 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 19:17:09,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:17:09,624 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:09,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 452 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 19:17:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-12 19:17:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 94 states have internal predecessors, (104), 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-12 19:17:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-07-12 19:17:09,627 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 50 [2022-07-12 19:17:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:09,627 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-07-12 19:17:09,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-07-12 19:17:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:17:09,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:09,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:09,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:09,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 19:17:09,843 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -742704791, now seen corresponding path program 1 times [2022-07-12 19:17:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:09,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559291701] [2022-07-12 19:17:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:10,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:10,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559291701] [2022-07-12 19:17:10,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559291701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:10,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72373424] [2022-07-12 19:17:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:10,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:10,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 19:17:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-12 19:17:11,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:11,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:11,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:17:11,353 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:11,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:17:11,455 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 19 treesize of output 18 [2022-07-12 19:17:11,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:11,759 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-12 19:17:11,763 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-12 19:17:11,767 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-12 19:17:11,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:11,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:11,999 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 11 [2022-07-12 19:17:12,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-07-12 19:17:12,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,012 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 20 treesize of output 15 [2022-07-12 19:17:12,018 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:12,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 19:17:12,452 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:12,452 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 72 treesize of output 65 [2022-07-12 19:17:12,457 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 35 treesize of output 30 [2022-07-12 19:17:12,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,461 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 18 treesize of output 20 [2022-07-12 19:17:12,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,542 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 35 treesize of output 33 [2022-07-12 19:17:12,547 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 18 treesize of output 20 [2022-07-12 19:17:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,551 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-12 19:17:12,620 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-12 19:17:12,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:12,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:12,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2508) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:13,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| Int) (v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2504 (Array Int Int)) (v_ArrVal_2521 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2503 Int) (v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2519 (Array Int Int)) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_2519))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse0)) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_2520))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_2521))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_2503))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_2508) (select (select (store (store .cse3 .cse2 v_ArrVal_2504) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_2507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse2 v_ArrVal_2506) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_2509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) |c_ULTIMATE.start_main_~data~0#1|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20|) 0)))))) is different from false [2022-07-12 19:17:13,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72373424] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:13,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:13,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 58 [2022-07-12 19:17:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167319143] [2022-07-12 19:17:13,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:13,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 19:17:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:13,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 19:17:13,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4072, Unknown=2, NotChecked=258, Total=4556 [2022-07-12 19:17:13,426 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 58 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 49 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:16,778 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2022-07-12 19:17:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 19:17:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 49 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-07-12 19:17:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:16,781 INFO L225 Difference]: With dead ends: 202 [2022-07-12 19:17:16,781 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 19:17:16,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=598, Invalid=7598, Unknown=2, NotChecked=358, Total=8556 [2022-07-12 19:17:16,783 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 695 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:16,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1814 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 19:17:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 19:17:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 123. [2022-07-12 19:17:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 116 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:17:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2022-07-12 19:17:16,786 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 51 [2022-07-12 19:17:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:16,787 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2022-07-12 19:17:16,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 49 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2022-07-12 19:17:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:17:16,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:16,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:16,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:16,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 19:17:16,988 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 106624317, now seen corresponding path program 1 times [2022-07-12 19:17:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:16,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048303696] [2022-07-12 19:17:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 19:17:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:17,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048303696] [2022-07-12 19:17:17,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048303696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:17,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:17,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:17:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468326801] [2022-07-12 19:17:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:17,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:17:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:17:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:17,097 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:17,355 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-07-12 19:17:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:17:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-12 19:17:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:17,356 INFO L225 Difference]: With dead ends: 200 [2022-07-12 19:17:17,356 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 19:17:17,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:17:17,356 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 247 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:17,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 659 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 19:17:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 124. [2022-07-12 19:17:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 117 states have internal predecessors, (130), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:17:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2022-07-12 19:17:17,360 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 51 [2022-07-12 19:17:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:17,360 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2022-07-12 19:17:17,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-07-12 19:17:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:17:17,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:17,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:17:17,361 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash 106624318, now seen corresponding path program 1 times [2022-07-12 19:17:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:17,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027012059] [2022-07-12 19:17:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:17:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:17,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027012059] [2022-07-12 19:17:17,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027012059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:17,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:17,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:17:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199691528] [2022-07-12 19:17:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:17,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:17:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:17:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:17,484 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:17,763 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2022-07-12 19:17:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:17:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-12 19:17:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:17,764 INFO L225 Difference]: With dead ends: 182 [2022-07-12 19:17:17,764 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 19:17:17,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:17:17,765 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 151 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:17,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 748 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 19:17:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2022-07-12 19:17:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 113 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:17:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2022-07-12 19:17:17,767 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 51 [2022-07-12 19:17:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:17,767 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2022-07-12 19:17:17,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-07-12 19:17:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:17:17,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:17,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:17,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 19:17:17,768 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash -613243961, now seen corresponding path program 1 times [2022-07-12 19:17:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:17,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785893418] [2022-07-12 19:17:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:17,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785893418] [2022-07-12 19:17:17,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785893418] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:17,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583608383] [2022-07-12 19:17:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:17,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:17,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:17,861 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:17,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 19:17:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:17:18,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:18,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:18,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:18,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:18,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:18,233 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-12 19:17:18,246 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:18,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:17:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:18,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:18,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583608383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:18,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:17:18,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2022-07-12 19:17:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470580548] [2022-07-12 19:17:18,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:18,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:17:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:18,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:17:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:17:18,472 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 19:17:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:18,574 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-07-12 19:17:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2022-07-12 19:17:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:18,576 INFO L225 Difference]: With dead ends: 116 [2022-07-12 19:17:18,576 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:17:18,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:17:18,577 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 439 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:18,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 341 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 156 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-07-12 19:17:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:17:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-12 19:17:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 109 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:17:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2022-07-12 19:17:18,580 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 53 [2022-07-12 19:17:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:18,580 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2022-07-12 19:17:18,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 19:17:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2022-07-12 19:17:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 19:17:18,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:18,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:18,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:18,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 19:17:18,795 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-12 19:17:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1524453912, now seen corresponding path program 1 times [2022-07-12 19:17:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:18,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999355542] [2022-07-12 19:17:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:19,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999355542] [2022-07-12 19:17:19,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999355542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354401012] [2022-07-12 19:17:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:19,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:19,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:19,274 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:19,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 19:17:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:19,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 19:17:19,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:19,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 19:17:19,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:19,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:19,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 19:17:19,962 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:19,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 19:17:20,226 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 19:17:20,226 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 51 treesize of output 37 [2022-07-12 19:17:20,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:20,231 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 26 treesize of output 28 [2022-07-12 19:17:20,289 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 19:17:20,289 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 100 treesize of output 83 [2022-07-12 19:17:20,296 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:20,297 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 73 treesize of output 72 [2022-07-12 19:17:20,351 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 62 treesize of output 46 [2022-07-12 19:17:20,465 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:17:20,466 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 63 treesize of output 26 [2022-07-12 19:17:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:20,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:20,487 INFO L356 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2022-07-12 19:17:20,487 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 33 treesize of output 32 [2022-07-12 19:17:20,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2022-07-12 19:17:20,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2022-07-12 19:17:20,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2022-07-12 19:17:20,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2022-07-12 19:17:20,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2022-07-12 19:17:20,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3118 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3117))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3114) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) is different from false [2022-07-12 19:17:20,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:20,569 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 5900 treesize of output 5623 [2022-07-12 19:17:20,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5612 treesize of output 5548 [2022-07-12 19:17:20,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:20,602 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 5548 treesize of output 5412 [2022-07-12 19:17:20,612 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 5404 treesize of output 5372 [2022-07-12 19:19:15,294 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 4136 DAG size of output: 4134 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)