./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 a31fd051 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-?-a31fd05 [2023-02-15 13:27:45,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:27:45,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:27:45,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:27:45,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:27:45,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:27:45,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:27:45,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:27:45,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:27:45,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:27:45,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:27:45,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:27:45,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:27:45,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:27:45,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:27:45,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:27:45,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:27:45,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:27:45,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:27:45,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:27:45,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:27:45,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:27:45,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:27:45,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:27:45,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:27:45,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:27:45,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:27:45,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:27:45,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:27:45,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:27:45,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:27:45,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:27:45,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:27:45,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:27:45,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:27:45,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:27:45,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:27:45,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:27:45,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:27:45,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:27:45,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:27:45,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:27:45,481 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:27:45,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:27:45,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:27:45,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:27:45,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:27:45,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:27:45,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:27:45,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:27:45,483 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:27:45,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:27:45,484 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:27:45,484 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:27:45,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:27:45,485 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:27:45,486 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:27:45,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:27:45,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:27:45,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:27:45,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:27:45,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:27:45,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:27:45,487 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-15 13:27:45,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:27:45,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:27:45,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:27:45,704 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:27:45,704 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:27:45,705 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 [2023-02-15 13:27:46,625 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:27:46,820 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:27:46,821 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-15 13:27:46,833 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0beb2e0c9/ef8400c95d374a4e8e157e1603a1a55f/FLAGaf0e1e4b5 [2023-02-15 13:27:46,842 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0beb2e0c9/ef8400c95d374a4e8e157e1603a1a55f [2023-02-15 13:27:46,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:27:46,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:27:46,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:27:46,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:27:46,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:27:46,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:27:46" (1/1) ... [2023-02-15 13:27:46,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8afd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:46, skipping insertion in model container [2023-02-15 13:27:46,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:27:46" (1/1) ... [2023-02-15 13:27:46,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:27:46,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:27:47,053 WARN L237 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] [2023-02-15 13:27:47,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:27:47,061 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:27:47,090 WARN L237 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] [2023-02-15 13:27:47,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:27:47,108 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:27:47,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47 WrapperNode [2023-02-15 13:27:47,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:27:47,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:27:47,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:27:47,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:27:47,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,141 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 178 [2023-02-15 13:27:47,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:27:47,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:27:47,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:27:47,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:27:47,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,160 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:27:47,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:27:47,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:27:47,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:27:47,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (1/1) ... [2023-02-15 13:27:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:27:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:47,193 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) [2023-02-15 13:27:47,200 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 [2023-02-15 13:27:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:27:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:27:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 13:27:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 13:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:27:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:27:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:27:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:27:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:27:47,333 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:27:47,334 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:27:47,666 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:27:47,672 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:27:47,675 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:27:47,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:27:47 BoogieIcfgContainer [2023-02-15 13:27:47,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:27:47,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:27:47,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:27:47,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:27:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:27:46" (1/3) ... [2023-02-15 13:27:47,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6197a35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:27:47, skipping insertion in model container [2023-02-15 13:27:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:47" (2/3) ... [2023-02-15 13:27:47,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6197a35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:27:47, skipping insertion in model container [2023-02-15 13:27:47,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:27:47" (3/3) ... [2023-02-15 13:27:47,681 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-02-15 13:27:47,697 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:27:47,697 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-02-15 13:27:47,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:27:47,732 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27e37b1c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:27:47,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-02-15 13:27:47,735 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) [2023-02-15 13:27:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:27:47,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:47,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:27:47,740 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)] === [2023-02-15 13:27:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2023-02-15 13:27:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036805622] [2023-02-15 13:27:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:47,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036805622] [2023-02-15 13:27:47,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036805622] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:47,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:47,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:27:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800547765] [2023-02-15 13:27:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:27:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:27:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:27:48,029 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) [2023-02-15 13:27:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:48,116 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2023-02-15 13:27:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:27:48,118 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 [2023-02-15 13:27:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:48,123 INFO L225 Difference]: With dead ends: 139 [2023-02-15 13:27:48,123 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 13:27:48,125 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 [2023-02-15 13:27:48,127 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 [2023-02-15 13:27:48,128 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] [2023-02-15 13:27:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 13:27:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-15 13:27:48,152 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) [2023-02-15 13:27:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-15 13:27:48,155 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2023-02-15 13:27:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:48,155 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-15 13:27:48,155 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) [2023-02-15 13:27:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-15 13:27:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:27:48,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:48,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:27:48,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:27:48,156 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)] === [2023-02-15 13:27:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2023-02-15 13:27:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:48,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010622976] [2023-02-15 13:27:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010622976] [2023-02-15 13:27:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010622976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:48,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:27:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172915400] [2023-02-15 13:27:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:48,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:27:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:27:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:27:48,214 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) [2023-02-15 13:27:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:48,295 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2023-02-15 13:27:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:27:48,296 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 [2023-02-15 13:27:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:48,297 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:27:48,297 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:27:48,297 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 [2023-02-15 13:27:48,298 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 [2023-02-15 13:27:48,299 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] [2023-02-15 13:27:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:27:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-15 13:27:48,304 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) [2023-02-15 13:27:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 13:27:48,305 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2023-02-15 13:27:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:48,306 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 13:27:48,306 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) [2023-02-15 13:27:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 13:27:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:27:48,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:48,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:48,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:27:48,307 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)] === [2023-02-15 13:27:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2023-02-15 13:27:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178771435] [2023-02-15 13:27:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:48,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:48,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178771435] [2023-02-15 13:27:48,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178771435] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:48,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:48,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:27:48,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415535979] [2023-02-15 13:27:48,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:48,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:27:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:27:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:27:48,413 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) [2023-02-15 13:27:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:48,508 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-15 13:27:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:27:48,508 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 [2023-02-15 13:27:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:48,509 INFO L225 Difference]: With dead ends: 141 [2023-02-15 13:27:48,509 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 13:27:48,509 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 [2023-02-15 13:27:48,510 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 [2023-02-15 13:27:48,511 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] [2023-02-15 13:27:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 13:27:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2023-02-15 13:27:48,516 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) [2023-02-15 13:27:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-15 13:27:48,520 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2023-02-15 13:27:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:48,521 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-15 13:27:48,521 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) [2023-02-15 13:27:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-15 13:27:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:27:48,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:48,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:48,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:27:48,523 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)] === [2023-02-15 13:27:48,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2023-02-15 13:27:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:48,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587270778] [2023-02-15 13:27:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:48,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:48,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587270778] [2023-02-15 13:27:48,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587270778] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:48,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:48,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:48,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183134498] [2023-02-15 13:27:48,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:48,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:48,689 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) [2023-02-15 13:27:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:48,946 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2023-02-15 13:27:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:48,946 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 [2023-02-15 13:27:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:48,950 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:27:48,950 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 13:27:48,950 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 [2023-02-15 13:27:48,956 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2023-02-15 13:27:48,957 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] [2023-02-15 13:27:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 13:27:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-02-15 13:27:48,966 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) [2023-02-15 13:27:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 13:27:48,970 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2023-02-15 13:27:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:48,971 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 13:27:48,971 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) [2023-02-15 13:27:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 13:27:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:27:48,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:48,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:48,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:27:48,972 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)] === [2023-02-15 13:27:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2023-02-15 13:27:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:48,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686040632] [2023-02-15 13:27:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:27:49,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:49,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686040632] [2023-02-15 13:27:49,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686040632] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:49,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:49,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696065451] [2023-02-15 13:27:49,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:49,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:49,178 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) [2023-02-15 13:27:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:49,368 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-15 13:27:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:49,368 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 [2023-02-15 13:27:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:49,369 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:27:49,375 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:27:49,375 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 [2023-02-15 13:27:49,377 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 [2023-02-15 13:27:49,377 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] [2023-02-15 13:27:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:27:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-02-15 13:27:49,388 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) [2023-02-15 13:27:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 13:27:49,389 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2023-02-15 13:27:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:49,389 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 13:27:49,389 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) [2023-02-15 13:27:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 13:27:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:27:49,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:49,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:49,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:27:49,390 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)] === [2023-02-15 13:27:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2023-02-15 13:27:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:49,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987647791] [2023-02-15 13:27:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:27:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987647791] [2023-02-15 13:27:49,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987647791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880668281] [2023-02-15 13:27:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:49,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:49,621 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) [2023-02-15 13:27:49,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:27:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:49,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:27:49,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:49,808 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:49,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-15 13:27:49,851 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-15 13:27:49,869 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:27:49,869 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 13:27:49,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:27:50,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880668281] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:27:50,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:27:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-15 13:27:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419104248] [2023-02-15 13:27:50,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:50,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:27:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:27:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-15 13:27:50,110 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) [2023-02-15 13:27:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:50,424 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-15 13:27:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:27:50,425 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 [2023-02-15 13:27:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:50,425 INFO L225 Difference]: With dead ends: 150 [2023-02-15 13:27:50,426 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 13:27:50,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-15 13:27:50,426 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:50,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 581 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 527 Invalid, 0 Unknown, 280 Unchecked, 0.3s Time] [2023-02-15 13:27:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 13:27:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2023-02-15 13:27:50,429 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) [2023-02-15 13:27:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2023-02-15 13:27:50,430 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 25 [2023-02-15 13:27:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:50,430 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2023-02-15 13:27:50,430 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) [2023-02-15 13:27:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2023-02-15 13:27:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:27:50,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:50,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:27:50,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:50,633 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 [2023-02-15 13:27:50,633 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)] === [2023-02-15 13:27:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:50,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2023-02-15 13:27:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:50,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655957168] [2023-02-15 13:27:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:50,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:27:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:50,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655957168] [2023-02-15 13:27:50,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655957168] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:50,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788448927] [2023-02-15 13:27:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:50,957 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) [2023-02-15 13:27:50,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:27:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:51,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:27:51,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:51,088 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:51,264 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:51,265 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:51,271 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:51,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:51,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788448927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:51,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:51,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-15 13:27:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289590456] [2023-02-15 13:27:51,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:51,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:27:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:27:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:27:51,450 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) [2023-02-15 13:27:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:52,023 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2023-02-15 13:27:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:27:52,024 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 [2023-02-15 13:27:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:52,024 INFO L225 Difference]: With dead ends: 133 [2023-02-15 13:27:52,024 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 13:27:52,025 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 [2023-02-15 13:27:52,025 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 131 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:52,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 751 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:27:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 13:27:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-02-15 13:27:52,027 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) [2023-02-15 13:27:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2023-02-15 13:27:52,028 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 25 [2023-02-15 13:27:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:52,028 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2023-02-15 13:27:52,028 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) [2023-02-15 13:27:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2023-02-15 13:27:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:27:52,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:52,029 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] [2023-02-15 13:27:52,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:52,229 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 [2023-02-15 13:27:52,229 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)] === [2023-02-15 13:27:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2023-02-15 13:27:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:52,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310466459] [2023-02-15 13:27:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:27:52,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310466459] [2023-02-15 13:27:52,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310466459] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832974681] [2023-02-15 13:27:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:52,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:52,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:52,627 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) [2023-02-15 13:27:52,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:27:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:52,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:27:52,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:52,748 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:52,757 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:52,773 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:27:52,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:52,802 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:52,813 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:52,821 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-15 13:27:52,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:52,868 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:52,889 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 13:27:52,906 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:52,906 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-15 13:27:52,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:53,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832974681] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:53,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:53,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-15 13:27:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879756687] [2023-02-15 13:27:53,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:53,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:27:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:27:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-15 13:27:53,024 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 13:27:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:53,278 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-15 13:27:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:27:53,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2023-02-15 13:27:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:53,279 INFO L225 Difference]: With dead ends: 140 [2023-02-15 13:27:53,279 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 13:27:53,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-15 13:27:53,280 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 222 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:53,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 409 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 457 Invalid, 0 Unknown, 438 Unchecked, 0.2s Time] [2023-02-15 13:27:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 13:27:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2023-02-15 13:27:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 117 states have internal predecessors, (128), 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) [2023-02-15 13:27:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-02-15 13:27:53,283 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2023-02-15 13:27:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:53,283 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-02-15 13:27:53,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 13:27:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-02-15 13:27:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:27:53,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:53,284 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] [2023-02-15 13:27:53,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:53,484 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 [2023-02-15 13:27:53,484 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)] === [2023-02-15 13:27:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -148939744, now seen corresponding path program 1 times [2023-02-15 13:27:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:53,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391101337] [2023-02-15 13:27:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:27:53,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:53,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391101337] [2023-02-15 13:27:53,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391101337] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:53,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:53,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:27:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071596954] [2023-02-15 13:27:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:53,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:27:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:53,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:27:53,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:27:53,818 INFO L87 Difference]: Start difference. First operand 122 states and 134 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) [2023-02-15 13:27:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:54,014 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-02-15 13:27:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:27:54,014 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 [2023-02-15 13:27:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:54,015 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:27:54,015 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:27:54,015 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 [2023-02-15 13:27:54,016 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 420 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:54,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 193 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:27:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:27:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 13:27:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.63013698630137) internal successors, (119), 108 states have internal predecessors, (119), 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) [2023-02-15 13:27:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-15 13:27:54,018 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 37 [2023-02-15 13:27:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:54,018 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-15 13:27:54,018 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) [2023-02-15 13:27:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-15 13:27:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:27:54,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:54,019 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] [2023-02-15 13:27:54,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:27:54,019 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)] === [2023-02-15 13:27:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash -362722266, now seen corresponding path program 1 times [2023-02-15 13:27:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:54,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408040246] [2023-02-15 13:27:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:27:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:54,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408040246] [2023-02-15 13:27:54,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408040246] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:54,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122553346] [2023-02-15 13:27:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:54,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:54,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:54,436 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) [2023-02-15 13:27:54,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:27:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:54,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 13:27:54,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:54,686 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:54,757 WARN L859 $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 [2023-02-15 13:27:54,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:54,778 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:54,794 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 13:27:54,794 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:54,818 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:27:54,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:27:54,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122553346] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:54,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:27:54,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2023-02-15 13:27:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303771429] [2023-02-15 13:27:54,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:54,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:27:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:27:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2023-02-15 13:27:54,824 INFO L87 Difference]: Start difference. First operand 113 states and 125 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) [2023-02-15 13:27:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:55,198 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2023-02-15 13:27:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:27:55,199 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 [2023-02-15 13:27:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:55,200 INFO L225 Difference]: With dead ends: 222 [2023-02-15 13:27:55,200 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 13:27:55,200 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 [2023-02-15 13:27:55,200 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 774 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:55,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 388 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 468 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2023-02-15 13:27:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 13:27:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 115. [2023-02-15 13:27:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.64) internal successors, (123), 110 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) [2023-02-15 13:27:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-02-15 13:27:55,203 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 40 [2023-02-15 13:27:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:55,203 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-02-15 13:27:55,203 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) [2023-02-15 13:27:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-02-15 13:27:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:27:55,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:55,204 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] [2023-02-15 13:27:55,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:55,404 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 [2023-02-15 13:27:55,405 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)] === [2023-02-15 13:27:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash -362722265, now seen corresponding path program 1 times [2023-02-15 13:27:55,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:55,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141558453] [2023-02-15 13:27:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:56,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141558453] [2023-02-15 13:27:56,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141558453] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:56,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75119735] [2023-02-15 13:27:56,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:56,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:56,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:56,115 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) [2023-02-15 13:27:56,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:27:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:56,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 13:27:56,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:56,241 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,275 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_938 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_938))) is different from true [2023-02-15 13:27:56,283 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_938 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_938))) is different from true [2023-02-15 13:27:56,294 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:27:56,295 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,422 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:27:56,422 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_943 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_943))) (exists ((v_ArrVal_940 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_940) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_944 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_944))))) is different from true [2023-02-15 13:27:56,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:56,852 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:56,864 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:56,867 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,889 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-15 13:27:56,890 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,928 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,930 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:27:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-15 13:27:56,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:57,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75119735] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:57,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:57,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 40 [2023-02-15 13:27:57,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419399885] [2023-02-15 13:27:57,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:57,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 13:27:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 13:27:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1598, Unknown=4, NotChecked=246, Total=1980 [2023-02-15 13:27:57,611 INFO L87 Difference]: Start difference. First operand 115 states and 129 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) [2023-02-15 13:27:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:59,449 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2023-02-15 13:27:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:27:59,452 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 [2023-02-15 13:27:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:59,454 INFO L225 Difference]: With dead ends: 240 [2023-02-15 13:27:59,454 INFO L226 Difference]: Without dead ends: 240 [2023-02-15 13:27:59,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=349, Invalid=2739, Unknown=4, NotChecked=330, Total=3422 [2023-02-15 13:27:59,455 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1479 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:59,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 828 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1652 Invalid, 0 Unknown, 726 Unchecked, 1.0s Time] [2023-02-15 13:27:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-02-15 13:27:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 115. [2023-02-15 13:27:59,463 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) [2023-02-15 13:27:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-02-15 13:27:59,464 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 40 [2023-02-15 13:27:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:59,464 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-02-15 13:27:59,464 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) [2023-02-15 13:27:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-02-15 13:27:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:27:59,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:59,465 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] [2023-02-15 13:27:59,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:59,675 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 [2023-02-15 13:27:59,676 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)] === [2023-02-15 13:27:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1640510023, now seen corresponding path program 1 times [2023-02-15 13:27:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:59,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895964241] [2023-02-15 13:27:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:27:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895964241] [2023-02-15 13:27:59,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895964241] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:59,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:59,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:27:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086975455] [2023-02-15 13:27:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:59,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:27:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:27:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:27:59,730 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) [2023-02-15 13:27:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:59,789 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2023-02-15 13:27:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:27:59,789 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 [2023-02-15 13:27:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:59,790 INFO L225 Difference]: With dead ends: 177 [2023-02-15 13:27:59,790 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 13:27:59,790 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 [2023-02-15 13:27:59,791 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 [2023-02-15 13:27:59,791 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] [2023-02-15 13:27:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 13:27:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2023-02-15 13:27:59,793 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) [2023-02-15 13:27:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2023-02-15 13:27:59,794 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 41 [2023-02-15 13:27:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:59,795 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2023-02-15 13:27:59,795 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) [2023-02-15 13:27:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2023-02-15 13:27:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:27:59,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:59,799 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] [2023-02-15 13:27:59,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:27:59,799 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)] === [2023-02-15 13:27:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 277382184, now seen corresponding path program 1 times [2023-02-15 13:27:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:59,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948539738] [2023-02-15 13:27:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 13:27:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:59,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948539738] [2023-02-15 13:27:59,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948539738] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:27:59,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:27:59,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:27:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045478885] [2023-02-15 13:27:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:27:59,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:27:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:59,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:27:59,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:27:59,893 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) [2023-02-15 13:28:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:00,021 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-02-15 13:28:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:00,022 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 [2023-02-15 13:28:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:00,022 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:28:00,022 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:28:00,022 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 [2023-02-15 13:28:00,023 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 [2023-02-15 13:28:00,023 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] [2023-02-15 13:28:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:28:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 13:28:00,025 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) [2023-02-15 13:28:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-02-15 13:28:00,025 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2023-02-15 13:28:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:00,025 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-02-15 13:28:00,025 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) [2023-02-15 13:28:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-02-15 13:28:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:28:00,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:00,026 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] [2023-02-15 13:28:00,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:28:00,026 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)] === [2023-02-15 13:28:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash 277382185, now seen corresponding path program 1 times [2023-02-15 13:28:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:00,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446017549] [2023-02-15 13:28:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:28:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446017549] [2023-02-15 13:28:00,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446017549] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572855042] [2023-02-15 13:28:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:00,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:00,161 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) [2023-02-15 13:28:00,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:28:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:28:00,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:00,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:28:00,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572855042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:00,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:28:00,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 13:28:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515105892] [2023-02-15 13:28:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:28:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:28:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:28:00,357 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) [2023-02-15 13:28:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:00,373 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-15 13:28:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:28:00,374 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 [2023-02-15 13:28:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:00,374 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:28:00,375 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:28:00,375 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 [2023-02-15 13:28:00,375 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:00,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 234 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:28:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:28:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-02-15 13:28:00,377 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) [2023-02-15 13:28:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-02-15 13:28:00,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 43 [2023-02-15 13:28:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:00,378 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-02-15 13:28:00,378 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) [2023-02-15 13:28:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-02-15 13:28:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:28:00,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:00,379 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] [2023-02-15 13:28:00,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:00,584 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 [2023-02-15 13:28:00,586 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)] === [2023-02-15 13:28:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 278707084, now seen corresponding path program 1 times [2023-02-15 13:28:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:00,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175760324] [2023-02-15 13:28:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:28:00,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:00,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175760324] [2023-02-15 13:28:00,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175760324] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:00,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234673442] [2023-02-15 13:28:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:00,759 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) [2023-02-15 13:28:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:28:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:00,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:28:00,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:00,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:28:00,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234673442] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:00,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:28:00,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-15 13:28:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526276069] [2023-02-15 13:28:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:00,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:28:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:28:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:28:00,943 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) [2023-02-15 13:28:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:00,960 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-15 13:28:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:28:00,960 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 [2023-02-15 13:28:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:00,961 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:28:00,961 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:28:00,962 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 [2023-02-15 13:28:00,964 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 187 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:00,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:28:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:28:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-15 13:28:00,967 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) [2023-02-15 13:28:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2023-02-15 13:28:00,968 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 43 [2023-02-15 13:28:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:00,968 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2023-02-15 13:28:00,968 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) [2023-02-15 13:28:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2023-02-15 13:28:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:28:00,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:00,970 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] [2023-02-15 13:28:00,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:01,178 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 [2023-02-15 13:28:01,178 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)] === [2023-02-15 13:28:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash 49983393, now seen corresponding path program 1 times [2023-02-15 13:28:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:01,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048811710] [2023-02-15 13:28:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:01,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048811710] [2023-02-15 13:28:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048811710] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:28:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299947943] [2023-02-15 13:28:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:01,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:28:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:28:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:28:01,246 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) [2023-02-15 13:28:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:01,339 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2023-02-15 13:28:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:28:01,339 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 [2023-02-15 13:28:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:01,340 INFO L225 Difference]: With dead ends: 126 [2023-02-15 13:28:01,340 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 13:28:01,340 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 [2023-02-15 13:28:01,340 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 [2023-02-15 13:28:01,341 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] [2023-02-15 13:28:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 13:28:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-15 13:28:01,344 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) [2023-02-15 13:28:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2023-02-15 13:28:01,345 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 44 [2023-02-15 13:28:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:01,345 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2023-02-15 13:28:01,345 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) [2023-02-15 13:28:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2023-02-15 13:28:01,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:28:01,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:01,346 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] [2023-02-15 13:28:01,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:28:01,346 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)] === [2023-02-15 13:28:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash 49983394, now seen corresponding path program 1 times [2023-02-15 13:28:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:01,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290983510] [2023-02-15 13:28:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:01,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:01,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290983510] [2023-02-15 13:28:01,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290983510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:01,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:01,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:28:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853752626] [2023-02-15 13:28:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:01,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:28:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:28:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:28:01,448 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) [2023-02-15 13:28:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:01,540 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2023-02-15 13:28:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:28:01,540 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 [2023-02-15 13:28:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:01,541 INFO L225 Difference]: With dead ends: 107 [2023-02-15 13:28:01,541 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 13:28:01,541 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 [2023-02-15 13:28:01,541 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 [2023-02-15 13:28:01,541 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] [2023-02-15 13:28:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 13:28:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 13:28:01,543 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) [2023-02-15 13:28:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-02-15 13:28:01,543 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 44 [2023-02-15 13:28:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:01,543 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-02-15 13:28:01,543 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) [2023-02-15 13:28:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-02-15 13:28:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:28:01,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:01,544 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] [2023-02-15 13:28:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:28:01,544 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)] === [2023-02-15 13:28:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1549485211, now seen corresponding path program 1 times [2023-02-15 13:28:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307320562] [2023-02-15 13:28:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:28:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:01,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307320562] [2023-02-15 13:28:01,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307320562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:01,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:01,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:28:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002394808] [2023-02-15 13:28:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:01,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:28:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:28:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:28:01,687 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) [2023-02-15 13:28:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:01,817 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-15 13:28:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:28:01,817 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 [2023-02-15 13:28:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:01,818 INFO L225 Difference]: With dead ends: 104 [2023-02-15 13:28:01,818 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 13:28:01,818 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 [2023-02-15 13:28:01,818 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 [2023-02-15 13:28:01,819 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] [2023-02-15 13:28:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 13:28:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-02-15 13:28:01,820 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) [2023-02-15 13:28:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2023-02-15 13:28:01,821 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2023-02-15 13:28:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:01,821 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2023-02-15 13:28:01,821 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) [2023-02-15 13:28:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2023-02-15 13:28:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:28:01,822 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:01,822 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] [2023-02-15 13:28:01,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:28:01,822 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)] === [2023-02-15 13:28:01,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722015, now seen corresponding path program 1 times [2023-02-15 13:28:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189969195] [2023-02-15 13:28:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189969195] [2023-02-15 13:28:02,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189969195] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754643298] [2023-02-15 13:28:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:02,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:02,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:02,419 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) [2023-02-15 13:28:02,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:28:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 13:28:02,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:02,876 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:02,968 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:28:02,969 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:02,972 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:03,100 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:03,100 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2023-02-15 13:28:03,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:03,237 INFO L321 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-02-15 13:28:03,237 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:03,247 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:28:03,609 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:03,609 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:03,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 13:28:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:03,692 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:03,732 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:03,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:03,742 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |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|)) 1)) is different from false [2023-02-15 13:28:14,179 INFO L321 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2023-02-15 13:28:14,180 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:20,523 WARN L837 $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 [2023-02-15 13:28:20,611 WARN L837 $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 [2023-02-15 13:28:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754643298] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:20,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:20,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 45 [2023-02-15 13:28:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748897432] [2023-02-15 13:28:20,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:28:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:20,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:28:20,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2335, Unknown=50, NotChecked=300, Total=2862 [2023-02-15 13:28:20,614 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) [2023-02-15 13:28:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:23,739 INFO L93 Difference]: Finished difference Result 317 states and 351 transitions. [2023-02-15 13:28:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 13:28:23,740 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 [2023-02-15 13:28:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:23,741 INFO L225 Difference]: With dead ends: 317 [2023-02-15 13:28:23,741 INFO L226 Difference]: Without dead ends: 317 [2023-02-15 13:28:23,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=802, Invalid=6992, Unknown=50, NotChecked=528, Total=8372 [2023-02-15 13:28:23,744 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2397 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:23,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 1302 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:28:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-02-15 13:28:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 105. [2023-02-15 13:28:23,747 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) [2023-02-15 13:28:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-02-15 13:28:23,747 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 49 [2023-02-15 13:28:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:23,748 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-02-15 13:28:23,748 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) [2023-02-15 13:28:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-02-15 13:28:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:28:23,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:23,749 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] [2023-02-15 13:28:23,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:23,957 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 [2023-02-15 13:28:23,957 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)] === [2023-02-15 13:28:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722016, now seen corresponding path program 1 times [2023-02-15 13:28:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:23,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852819159] [2023-02-15 13:28:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852819159] [2023-02-15 13:28:25,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852819159] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634614721] [2023-02-15 13:28:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:25,535 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) [2023-02-15 13:28:25,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:28:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:25,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 13:28:25,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:26,176 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,179 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,183 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,185 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:26,434 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,449 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 13:28:26,449 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 13:28:26,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:26,457 INFO L350 Elim1Store]: Elim1 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 18 [2023-02-15 13:28:26,474 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:26,475 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,873 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:26,874 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:26,882 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:26,954 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:26,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:26,960 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:27,019 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:27,022 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:27,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:30,101 WARN L837 $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 [2023-02-15 13:28:30,109 WARN L837 $PredicateComparison]: unable to prove that (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|))) (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))) (<= (+ 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| .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|)))))) is different from false [2023-02-15 13:28:30,120 WARN L837 $PredicateComparison]: unable to prove that (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|))) (and (forall ((v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (<= 0 (+ (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|) 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| .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 [2023-02-15 13:28:30,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634614721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:30,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:30,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 50 [2023-02-15 13:28:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169105930] [2023-02-15 13:28:30,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:30,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 13:28:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 13:28:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3010, Unknown=101, NotChecked=342, Total=3660 [2023-02-15 13:28:30,350 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 51 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 44 states have internal predecessors, (80), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:34,679 INFO L93 Difference]: Finished difference Result 257 states and 288 transitions. [2023-02-15 13:28:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 13:28:34,679 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 44 states have internal predecessors, (80), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2023-02-15 13:28:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:34,680 INFO L225 Difference]: With dead ends: 257 [2023-02-15 13:28:34,680 INFO L226 Difference]: Without dead ends: 257 [2023-02-15 13:28:34,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=626, Invalid=7108, Unknown=110, NotChecked=528, Total=8372 [2023-02-15 13:28:34,682 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 664 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 2958 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:34,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1956 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2958 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 13:28:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-15 13:28:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 107. [2023-02-15 13:28:34,685 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) [2023-02-15 13:28:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-02-15 13:28:34,685 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 49 [2023-02-15 13:28:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:34,685 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-02-15 13:28:34,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 44 states have internal predecessors, (80), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-02-15 13:28:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 13:28:34,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:34,686 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] [2023-02-15 13:28:34,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:34,892 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 [2023-02-15 13:28:34,892 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)] === [2023-02-15 13:28:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 776998409, now seen corresponding path program 1 times [2023-02-15 13:28:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:34,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049041797] [2023-02-15 13:28:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049041797] [2023-02-15 13:28:35,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049041797] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223188498] [2023-02-15 13:28:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:35,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:35,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:35,051 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) [2023-02-15 13:28:35,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:28:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:35,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 13:28:35,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:35,275 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:35,277 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:35,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:35,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223188498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:28:35,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:28:35,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2023-02-15 13:28:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090207503] [2023-02-15 13:28:35,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:35,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:28:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:35,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:28:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:28:35,378 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) [2023-02-15 13:28:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:35,551 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-02-15 13:28:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:28:35,551 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 [2023-02-15 13:28:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:35,552 INFO L225 Difference]: With dead ends: 99 [2023-02-15 13:28:35,552 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 13:28:35,552 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 [2023-02-15 13:28:35,552 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:35,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 748 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:28:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 13:28:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-15 13:28:35,554 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) [2023-02-15 13:28:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-02-15 13:28:35,554 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 50 [2023-02-15 13:28:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:35,555 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-02-15 13:28:35,555 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) [2023-02-15 13:28:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-02-15 13:28:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:28:35,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:35,555 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] [2023-02-15 13:28:35,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:35,755 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 [2023-02-15 13:28:35,756 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)] === [2023-02-15 13:28:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash -742704791, now seen corresponding path program 1 times [2023-02-15 13:28:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:35,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769809620] [2023-02-15 13:28:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769809620] [2023-02-15 13:28:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769809620] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844408346] [2023-02-15 13:28:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:37,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:37,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:37,676 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) [2023-02-15 13:28:37,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:28:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:37,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 13:28:37,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:37,906 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,161 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,274 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:38,274 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,419 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,581 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-15 13:28:38,803 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,807 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:38,810 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:39,099 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:39,108 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,117 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:39,118 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,124 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,608 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:39,609 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,619 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:39,624 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2023-02-15 13:28:39,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:39,705 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,714 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:39,722 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,794 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,809 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,903 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:39,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:40,072 WARN L837 $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 [2023-02-15 13:28:41,760 WARN L837 $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 [2023-02-15 13:28:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844408346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:41,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:41,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 59 [2023-02-15 13:28:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929240419] [2023-02-15 13:28:41,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:41,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 13:28:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:41,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 13:28:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4182, Unknown=2, NotChecked=262, Total=4692 [2023-02-15 13:28:41,764 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:44,716 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2023-02-15 13:28:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 13:28:44,719 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-15 13:28:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:44,719 INFO L225 Difference]: With dead ends: 202 [2023-02-15 13:28:44,720 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 13:28:44,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=622, Invalid=7574, Unknown=2, NotChecked=358, Total=8556 [2023-02-15 13:28:44,721 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 571 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:44,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1668 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 13:28:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 13:28:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 123. [2023-02-15 13:28:44,724 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) [2023-02-15 13:28:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2023-02-15 13:28:44,724 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 51 [2023-02-15 13:28:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:44,725 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2023-02-15 13:28:44,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2023-02-15 13:28:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:28:44,725 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:44,725 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] [2023-02-15 13:28:44,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:44,931 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 [2023-02-15 13:28:44,934 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)] === [2023-02-15 13:28:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 106624317, now seen corresponding path program 1 times [2023-02-15 13:28:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:44,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235053706] [2023-02-15 13:28:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:28:45,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:45,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235053706] [2023-02-15 13:28:45,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235053706] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:45,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:45,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:28:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252954962] [2023-02-15 13:28:45,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:45,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:28:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:28:45,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:28:45,156 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) [2023-02-15 13:28:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:45,470 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2023-02-15 13:28:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:28:45,470 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 [2023-02-15 13:28:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:45,471 INFO L225 Difference]: With dead ends: 200 [2023-02-15 13:28:45,471 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 13:28:45,471 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 [2023-02-15 13:28:45,472 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 240 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:45,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 659 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:28:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 13:28:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 124. [2023-02-15 13:28:45,474 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) [2023-02-15 13:28:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2023-02-15 13:28:45,475 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 51 [2023-02-15 13:28:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:45,475 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2023-02-15 13:28:45,475 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) [2023-02-15 13:28:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2023-02-15 13:28:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:28:45,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:45,476 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] [2023-02-15 13:28:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 13:28:45,476 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)] === [2023-02-15 13:28:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 106624318, now seen corresponding path program 1 times [2023-02-15 13:28:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:45,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039064476] [2023-02-15 13:28:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:28:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:45,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039064476] [2023-02-15 13:28:45,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039064476] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:45,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:28:45,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:28:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037519321] [2023-02-15 13:28:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:45,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:28:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:28:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:28:45,781 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) [2023-02-15 13:28:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:46,125 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2023-02-15 13:28:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:28:46,125 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 [2023-02-15 13:28:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:46,126 INFO L225 Difference]: With dead ends: 182 [2023-02-15 13:28:46,126 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 13:28:46,126 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 [2023-02-15 13:28:46,126 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 210 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:46,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 737 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:28:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 13:28:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2023-02-15 13:28:46,129 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) [2023-02-15 13:28:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2023-02-15 13:28:46,129 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 51 [2023-02-15 13:28:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:46,129 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2023-02-15 13:28:46,129 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) [2023-02-15 13:28:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2023-02-15 13:28:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:28:46,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:46,130 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] [2023-02-15 13:28:46,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 13:28:46,130 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)] === [2023-02-15 13:28:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -613243961, now seen corresponding path program 1 times [2023-02-15 13:28:46,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:46,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088427597] [2023-02-15 13:28:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:46,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:46,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088427597] [2023-02-15 13:28:46,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088427597] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:46,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467330570] [2023-02-15 13:28:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:46,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:46,321 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) [2023-02-15 13:28:46,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:28:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:28:46,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:46,547 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:46,563 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2921 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2921))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-15 13:28:46,585 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:46,596 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2922 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2922))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-15 13:28:46,615 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:46,630 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2923 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2923))))) is different from true [2023-02-15 13:28:46,649 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:46,655 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:46,673 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:46,673 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 13:28:46,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:28:46,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467330570] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:28:46,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:28:46,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2023-02-15 13:28:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010586264] [2023-02-15 13:28:46,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:46,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:28:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:28:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-02-15 13:28:46,946 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 13:28:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:47,100 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2023-02-15 13:28:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:28:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2023-02-15 13:28:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:47,110 INFO L225 Difference]: With dead ends: 116 [2023-02-15 13:28:47,110 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 13:28:47,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2023-02-15 13:28:47,110 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 280 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:47,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 223 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 273 Unchecked, 0.1s Time] [2023-02-15 13:28:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 13:28:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-15 13:28:47,112 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) [2023-02-15 13:28:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2023-02-15 13:28:47,113 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 53 [2023-02-15 13:28:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:47,113 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2023-02-15 13:28:47,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 13:28:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2023-02-15 13:28:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 13:28:47,113 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:47,114 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] [2023-02-15 13:28:47,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 13:28:47,319 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 [2023-02-15 13:28:47,320 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)] === [2023-02-15 13:28:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1524453912, now seen corresponding path program 1 times [2023-02-15 13:28:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278449788] [2023-02-15 13:28:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278449788] [2023-02-15 13:28:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278449788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571823879] [2023-02-15 13:28:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:48,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:48,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:48,150 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) [2023-02-15 13:28:48,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:28:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:48,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-15 13:28:48,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:48,666 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:48,669 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:48,761 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:48,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:48,857 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:48,867 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:48,868 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,192 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 13:28:49,192 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:49,209 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,301 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:28:49,301 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,312 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:49,312 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,377 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,520 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:28:49,520 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:49,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:49,552 INFO L321 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2023-02-15 13:28:49,553 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,648 WARN L837 $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 [2023-02-15 13:28:49,692 WARN L837 $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 [2023-02-15 13:28:49,699 WARN L837 $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 [2023-02-15 13:28:49,706 WARN L837 $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 [2023-02-15 13:28:49,720 WARN L837 $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 [2023-02-15 13:28:49,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:49,777 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:28:49,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:28:49,794 INFO L350 Elim1Store]: Elim1 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 5612 treesize of output 5476 [2023-02-15 13:28:49,803 INFO L350 Elim1Store]: Elim1 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 5468 treesize of output 5404 [2023-02-15 13:28:49,811 INFO L350 Elim1Store]: Elim1 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