./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/dll2n_append_equal.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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:34:54,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:34:54,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:34:54,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:34:54,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:34:54,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:34:54,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:34:54,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:34:54,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:34:54,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:34:54,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:34:54,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:34:54,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:34:54,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:34:54,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:34:54,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:34:54,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:34:54,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:34:54,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:34:54,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:34:54,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:34:54,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:34:54,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:34:54,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:34:54,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:34:54,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:34:54,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:34:54,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:34:54,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:34:54,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:34:54,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:34:54,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:34:54,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:34:54,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:34:54,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:34:54,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:34:54,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:34:54,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:34:54,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:34:54,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:34:54,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:34:54,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:34:54,514 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:34:54,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:34:54,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:34:54,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:34:54,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:34:54,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:34:54,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:34:54,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:34:54,516 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:34:54,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:34:54,517 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:34:54,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:34:54,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:34:54,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:34:54,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:34:54,518 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:34:54,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:34:54,519 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:34:54,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:34:54,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:34:54,519 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:34:54,519 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:34:54,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:34:54,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:34:54,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:34:54,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:34:54,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:34:54,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:34:54,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:34:54,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:34:54,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:34:54,522 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:34:54,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:34:54,522 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:34:54,522 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2023-02-15 01:34:54,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:34:54,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:34:54,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:34:54,799 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:34:54,799 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:34:54,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-02-15 01:34:55,864 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:34:56,056 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:34:56,056 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-02-15 01:34:56,066 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5bd5aa44/7af6304ee28b4c0c9649e1fd87299a32/FLAGead43db3a [2023-02-15 01:34:56,078 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5bd5aa44/7af6304ee28b4c0c9649e1fd87299a32 [2023-02-15 01:34:56,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:34:56,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:34:56,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:34:56,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:34:56,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:34:56,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7263e758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56, skipping insertion in model container [2023-02-15 01:34:56,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:34:56,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:34:56,390 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/dll2n_append_equal.i[24333,24346] [2023-02-15 01:34:56,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:34:56,408 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:34:56,456 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/dll2n_append_equal.i[24333,24346] [2023-02-15 01:34:56,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:34:56,477 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:34:56,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56 WrapperNode [2023-02-15 01:34:56,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:34:56,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:34:56,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:34:56,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:34:56,485 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:34:56" (1/1) ... [2023-02-15 01:34:56,515 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:34:56" (1/1) ... [2023-02-15 01:34:56,537 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2023-02-15 01:34:56,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:34:56,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:34:56,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:34:56,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:34:56,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,586 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:34:56,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:34:56,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:34:56,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:34:56,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (1/1) ... [2023-02-15 01:34:56,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:34:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:56,634 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 01:34:56,637 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 01:34:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:34:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:34:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 01:34:56,664 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 01:34:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:34:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:34:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:34:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:34:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:34:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:34:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:34:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:34:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:34:56,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:34:56,865 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:34:56,867 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:34:57,232 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:34:57,240 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:34:57,247 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 01:34:57,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:57 BoogieIcfgContainer [2023-02-15 01:34:57,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:34:57,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:34:57,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:34:57,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:34:57,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:34:56" (1/3) ... [2023-02-15 01:34:57,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d045a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:57, skipping insertion in model container [2023-02-15 01:34:57,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:56" (2/3) ... [2023-02-15 01:34:57,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d045a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:57, skipping insertion in model container [2023-02-15 01:34:57,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:57" (3/3) ... [2023-02-15 01:34:57,260 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-02-15 01:34:57,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:34:57,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-15 01:34:57,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:34:57,328 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;@771bc04d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:34:57,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-15 01:34:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:34:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:34:57,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:57,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:57,338 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348631, now seen corresponding path program 1 times [2023-02-15 01:34:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:57,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316768848] [2023-02-15 01:34:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,534 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 01:34:57,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:57,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316768848] [2023-02-15 01:34:57,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316768848] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:57,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:57,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:34:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120402170] [2023-02-15 01:34:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:57,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:34:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:34:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:34:57,564 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:34:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:57,676 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2023-02-15 01:34:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:34:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 01:34:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:57,685 INFO L225 Difference]: With dead ends: 94 [2023-02-15 01:34:57,685 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:34:57,687 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 01:34:57,691 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:57,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:34:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 01:34:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:34:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-02-15 01:34:57,736 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2023-02-15 01:34:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:57,737 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-02-15 01:34:57,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:34:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-02-15 01:34:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:34:57,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:57,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:57,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:34:57,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348632, now seen corresponding path program 1 times [2023-02-15 01:34:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:57,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894051662] [2023-02-15 01:34:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:57,891 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 01:34:57,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:57,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894051662] [2023-02-15 01:34:57,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894051662] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:57,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:57,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:34:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602515572] [2023-02-15 01:34:57,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:57,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:34:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:34:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:34:57,896 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:34:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:57,967 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2023-02-15 01:34:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:34:57,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 01:34:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:57,969 INFO L225 Difference]: With dead ends: 88 [2023-02-15 01:34:57,969 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 01:34:57,969 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 01:34:57,970 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:57,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 01:34:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 01:34:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.82) internal successors, (91), 84 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:34:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-15 01:34:57,978 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 7 [2023-02-15 01:34:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:57,978 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-15 01:34:57,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:34:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-15 01:34:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:34:57,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:57,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:57,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:34:57,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash 927333361, now seen corresponding path program 1 times [2023-02-15 01:34:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:57,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647202054] [2023-02-15 01:34:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:34:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,268 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 01:34:58,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:58,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647202054] [2023-02-15 01:34:58,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647202054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:58,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:58,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:34:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921533297] [2023-02-15 01:34:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:58,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:34:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:58,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:34:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:34:58,272 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 01:34:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:58,500 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2023-02-15 01:34:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2023-02-15 01:34:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:58,510 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:34:58,511 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:34:58,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:34:58,518 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:58,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 364 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:34:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2023-02-15 01:34:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.78) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:34:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-02-15 01:34:58,535 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 14 [2023-02-15 01:34:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:58,536 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-02-15 01:34:58,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 01:34:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-02-15 01:34:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:34:58,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:58,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:58,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:34:58,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 927333360, now seen corresponding path program 1 times [2023-02-15 01:34:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:58,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688063111] [2023-02-15 01:34:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:34:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,648 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 01:34:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:58,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688063111] [2023-02-15 01:34:58,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688063111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:58,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:58,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:34:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018038689] [2023-02-15 01:34:58,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:58,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:34:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:58,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:34:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:34:58,651 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 01:34:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:58,832 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2023-02-15 01:34:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:34:58,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2023-02-15 01:34:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:58,833 INFO L225 Difference]: With dead ends: 89 [2023-02-15 01:34:58,834 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 01:34:58,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:34:58,843 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 15 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:58,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:34:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 01:34:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2023-02-15 01:34:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.74) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:34:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-02-15 01:34:58,854 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2023-02-15 01:34:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:58,854 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-02-15 01:34:58,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 01:34:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-02-15 01:34:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:34:58,856 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:58,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:34:58,856 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306156, now seen corresponding path program 1 times [2023-02-15 01:34:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:58,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479121090] [2023-02-15 01:34:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 01:34:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:58,933 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 01:34:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:58,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479121090] [2023-02-15 01:34:58,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479121090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:58,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:58,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:34:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404309362] [2023-02-15 01:34:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:34:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:34:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:34:58,938 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 01:34:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:59,022 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2023-02-15 01:34:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:34:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2023-02-15 01:34:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:59,023 INFO L225 Difference]: With dead ends: 94 [2023-02-15 01:34:59,024 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 01:34:59,024 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 01:34:59,024 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:59,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 211 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 01:34:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2023-02-15 01:34:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:34:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-02-15 01:34:59,030 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2023-02-15 01:34:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:59,030 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-02-15 01:34:59,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 01:34:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-02-15 01:34:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:34:59,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:59,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:59,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:34:59,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash 958467140, now seen corresponding path program 1 times [2023-02-15 01:34:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:59,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948108680] [2023-02-15 01:34:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:34:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,094 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 01:34:59,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:59,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948108680] [2023-02-15 01:34:59,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948108680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:34:59,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:34:59,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:34:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160048366] [2023-02-15 01:34:59,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:34:59,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:34:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:59,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:34:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:34:59,097 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 01:34:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:59,165 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-15 01:34:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:34:59,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2023-02-15 01:34:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:59,166 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:34:59,166 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:34:59,167 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 01:34:59,167 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:59,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:34:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-02-15 01:34:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 85 states have internal predecessors, (92), 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 01:34:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-15 01:34:59,173 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2023-02-15 01:34:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:59,173 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-15 01:34:59,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 01:34:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-15 01:34:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:34:59,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:59,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:59,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:34:59,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 239866037, now seen corresponding path program 1 times [2023-02-15 01:34:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:59,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099049996] [2023-02-15 01:34:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:34:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:34:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:34:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:34:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099049996] [2023-02-15 01:34:59,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099049996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:34:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188645957] [2023-02-15 01:34:59,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:59,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:34:59,283 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 01:34:59,301 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 01:34:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:34:59,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:34:59,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:34:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:34:59,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:34:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 01:34:59,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188645957] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:34:59,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:34:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 01:34:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058817163] [2023-02-15 01:34:59,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:34:59,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:34:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:34:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:34:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:34:59,536 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:34:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:34:59,626 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-15 01:34:59,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:34:59,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-02-15 01:34:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:34:59,627 INFO L225 Difference]: With dead ends: 92 [2023-02-15 01:34:59,627 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 01:34:59,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:34:59,629 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:34:59,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 218 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:34:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 01:34:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-15 01:34:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 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 01:34:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-15 01:34:59,635 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 31 [2023-02-15 01:34:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:34:59,635 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-15 01:34:59,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:34:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-15 01:34:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:34:59,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:34:59,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 01:34:59,649 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 01:34:59,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:34:59,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:34:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:34:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704317, now seen corresponding path program 1 times [2023-02-15 01:34:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:34:59,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309409920] [2023-02-15 01:34:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:34:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:34:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:35:00,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:00,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309409920] [2023-02-15 01:35:00,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309409920] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:00,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626922731] [2023-02-15 01:35:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:00,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:00,163 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 01:35:00,169 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 01:35:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:00,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:35:00,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:00,327 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 01:35:00,386 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:35:00,477 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:35:00,477 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 17 treesize of output 21 [2023-02-15 01:35:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:35:00,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:00,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626922731] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:00,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:00,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2023-02-15 01:35:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925902435] [2023-02-15 01:35:00,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:00,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:35:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:00,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:35:00,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2023-02-15 01:35:00,550 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:35:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:00,829 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-02-15 01:35:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:35:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-02-15 01:35:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:00,831 INFO L225 Difference]: With dead ends: 103 [2023-02-15 01:35:00,831 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 01:35:00,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2023-02-15 01:35:00,832 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:00,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 275 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2023-02-15 01:35:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 01:35:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2023-02-15 01:35:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-15 01:35:00,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2023-02-15 01:35:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:00,836 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-15 01:35:00,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:35:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-15 01:35:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:35:00,837 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:00,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:00,845 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 01:35:01,043 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,SelfDestructingSolverStorable7 [2023-02-15 01:35:01,043 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704316, now seen corresponding path program 1 times [2023-02-15 01:35:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:01,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525509905] [2023-02-15 01:35:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:35:01,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:01,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525509905] [2023-02-15 01:35:01,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525509905] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:01,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618645780] [2023-02-15 01:35:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:01,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:01,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:01,560 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 01:35:01,590 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 01:35:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 01:35:01,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:01,716 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 01:35:01,896 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-15 01:35:01,897 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 14 treesize of output 13 [2023-02-15 01:35:01,910 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:35:01,910 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 01:35:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:01,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:02,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618645780] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:02,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:02,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2023-02-15 01:35:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063691942] [2023-02-15 01:35:02,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:02,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:35:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:35:02,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-02-15 01:35:02,118 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:35:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:02,635 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-15 01:35:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:35:02,636 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-02-15 01:35:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:02,637 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:35:02,637 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:35:02,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2023-02-15 01:35:02,638 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:02,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 515 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:35:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:35:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-02-15 01:35:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 85 states have internal predecessors, (92), 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 01:35:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-15 01:35:02,642 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 32 [2023-02-15 01:35:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:02,643 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-15 01:35:02,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:35:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-15 01:35:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:35:02,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:02,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:02,654 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 01:35:02,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:02,850 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1122646220, now seen corresponding path program 2 times [2023-02-15 01:35:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:02,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318346473] [2023-02-15 01:35:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 01:35:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 01:35:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:03,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318346473] [2023-02-15 01:35:03,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318346473] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:03,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985373702] [2023-02-15 01:35:03,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:35:03,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:03,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:03,016 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 01:35:03,019 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 01:35:03,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:35:03,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:35:03,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:35:03,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:35:03,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 01:35:03,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985373702] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:35:03,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:35:03,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2023-02-15 01:35:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891543350] [2023-02-15 01:35:03,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:03,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:35:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:03,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:35:03,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:35:03,249 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:35:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:03,364 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-02-15 01:35:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:35:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-15 01:35:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:03,365 INFO L225 Difference]: With dead ends: 90 [2023-02-15 01:35:03,365 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 01:35:03,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:35:03,366 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 144 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:03,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 01:35:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-15 01:35:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 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 01:35:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 01:35:03,370 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 46 [2023-02-15 01:35:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:03,371 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 01:35:03,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:35:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 01:35:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 01:35:03,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:03,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:03,383 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 01:35:03,578 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 01:35:03,578 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 186649324, now seen corresponding path program 1 times [2023-02-15 01:35:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:03,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781862474] [2023-02-15 01:35:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:03,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 01:35:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781862474] [2023-02-15 01:35:04,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781862474] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6743614] [2023-02-15 01:35:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:04,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:04,038 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 01:35:04,051 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 01:35:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:04,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 01:35:04,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:04,237 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 01:35:04,249 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 01:35:04,263 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1168)))) is different from true [2023-02-15 01:35:04,281 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1168)))) is different from true [2023-02-15 01:35:04,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:04,295 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 01:35:04,361 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 01:35:04,388 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:04,388 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 01:35:04,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:04,534 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-15 01:35:04,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2023-02-15 01:35:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-02-15 01:35:04,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:04,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6743614] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:04,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:04,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-02-15 01:35:04,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087378865] [2023-02-15 01:35:04,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:04,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:35:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:04,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:35:04,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2023-02-15 01:35:04,724 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:05,148 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-02-15 01:35:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:35:05,149 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2023-02-15 01:35:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:05,150 INFO L225 Difference]: With dead ends: 97 [2023-02-15 01:35:05,150 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 01:35:05,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=563, Unknown=3, NotChecked=156, Total=870 [2023-02-15 01:35:05,151 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 310 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:05,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 242 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 394 Invalid, 0 Unknown, 298 Unchecked, 0.3s Time] [2023-02-15 01:35:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 01:35:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2023-02-15 01:35:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 80 states have internal predecessors, (86), 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 01:35:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-02-15 01:35:05,154 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 47 [2023-02-15 01:35:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:05,154 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-02-15 01:35:05,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-02-15 01:35:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 01:35:05,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:05,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:05,166 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 01:35:05,356 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 01:35:05,357 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash 186649325, now seen corresponding path program 1 times [2023-02-15 01:35:05,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:05,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835742832] [2023-02-15 01:35:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 01:35:05,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:05,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835742832] [2023-02-15 01:35:05,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835742832] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:05,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336481459] [2023-02-15 01:35:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:05,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:05,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:05,889 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 01:35:05,915 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 01:35:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:06,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:35:06,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:06,090 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 01:35:06,129 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 01:35:06,141 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_1418 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1418) |c_#length|)))) is different from true [2023-02-15 01:35:06,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:06,174 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 01:35:06,208 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 01:35:06,215 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_1419 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1419) |c_#length|)))) is different from true [2023-02-15 01:35:06,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:06,245 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 01:35:06,297 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 01:35:06,303 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_1420 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1420) |c_#length|)))) is different from true [2023-02-15 01:35:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:06,329 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 01:35:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2023-02-15 01:35:06,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:08,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336481459] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:08,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:08,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-15 01:35:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838673752] [2023-02-15 01:35:08,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:08,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 01:35:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 01:35:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=167, Unknown=3, NotChecked=84, Total=306 [2023-02-15 01:35:08,440 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:35:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:08,671 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-15 01:35:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:35:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2023-02-15 01:35:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:08,673 INFO L225 Difference]: With dead ends: 92 [2023-02-15 01:35:08,673 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 01:35:08,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=3, NotChecked=96, Total=380 [2023-02-15 01:35:08,674 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 202 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:08,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 218 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 264 Unchecked, 0.2s Time] [2023-02-15 01:35:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 01:35:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2023-02-15 01:35:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 75 states have internal predecessors, (81), 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 01:35:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-15 01:35:08,676 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 47 [2023-02-15 01:35:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:08,677 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-15 01:35:08,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:35:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-15 01:35:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:35:08,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:08,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:08,687 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 01:35:08,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:08,878 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 353447346, now seen corresponding path program 1 times [2023-02-15 01:35:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:08,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279325381] [2023-02-15 01:35:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:35:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:09,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279325381] [2023-02-15 01:35:09,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279325381] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:09,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990072343] [2023-02-15 01:35:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:09,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:09,597 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 01:35:09,600 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 01:35:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:09,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 01:35:09,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:09,838 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 01:35:10,003 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 01:35:10,115 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1672 (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|))) (= 0 (select |c_old(#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_1672)))) is different from true [2023-02-15 01:35:10,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:10,139 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 01:35:10,153 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 01:35:10,153 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 01:35:10,188 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 01:35:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 01:35:10,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:10,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990072343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:10,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:10,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2023-02-15 01:35:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088190802] [2023-02-15 01:35:10,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:10,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:35:10,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:35:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2023-02-15 01:35:10,277 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:11,000 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2023-02-15 01:35:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:35:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 01:35:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:11,002 INFO L225 Difference]: With dead ends: 121 [2023-02-15 01:35:11,002 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 01:35:11,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 01:35:11,003 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 344 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:11,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 520 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 765 Invalid, 0 Unknown, 113 Unchecked, 0.5s Time] [2023-02-15 01:35:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 01:35:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2023-02-15 01:35:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.396551724137931) internal successors, (81), 74 states have internal predecessors, (81), 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 01:35:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-02-15 01:35:11,006 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 51 [2023-02-15 01:35:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:11,007 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-02-15 01:35:11,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-02-15 01:35:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:35:11,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:11,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:11,016 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 01:35:11,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:11,214 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 353447347, now seen corresponding path program 1 times [2023-02-15 01:35:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:11,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824429123] [2023-02-15 01:35:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:11,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:35:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:12,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824429123] [2023-02-15 01:35:12,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824429123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319448307] [2023-02-15 01:35:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:12,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:12,545 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 01:35:12,549 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 01:35:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:12,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 01:35:12,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:12,807 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 01:35:13,169 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 17 [2023-02-15 01:35:13,174 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 01:35:13,360 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1926 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1926) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1931 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1931))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1932 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1932) |c_#memory_$Pointer$.offset|)))) is different from true [2023-02-15 01:35:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:13,398 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 01:35:13,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:13,404 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 01:35:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:13,409 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 01:35:13,420 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:35:13,421 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 01:35:13,476 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 01:35:13,478 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 01:35:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 01:35:13,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:14,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319448307] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:14,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:14,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2023-02-15 01:35:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845559369] [2023-02-15 01:35:14,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:14,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 01:35:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 01:35:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1296, Unknown=2, NotChecked=72, Total=1482 [2023-02-15 01:35:14,360 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 35 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:16,124 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-02-15 01:35:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 01:35:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 01:35:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:16,125 INFO L225 Difference]: With dead ends: 117 [2023-02-15 01:35:16,125 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 01:35:16,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=292, Invalid=2569, Unknown=5, NotChecked=104, Total=2970 [2023-02-15 01:35:16,127 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 532 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:16,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1026 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1269 Invalid, 3 Unknown, 87 Unchecked, 0.9s Time] [2023-02-15 01:35:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 01:35:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2023-02-15 01:35:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 77 states have internal predecessors, (84), 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 01:35:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-02-15 01:35:16,130 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 51 [2023-02-15 01:35:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:16,130 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-02-15 01:35:16,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-02-15 01:35:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:35:16,131 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:16,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:16,139 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 01:35:16,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 01:35:16,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893007, now seen corresponding path program 1 times [2023-02-15 01:35:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49849607] [2023-02-15 01:35:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 01:35:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:16,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49849607] [2023-02-15 01:35:16,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49849607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:16,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:16,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:35:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658601467] [2023-02-15 01:35:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:16,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:16,484 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 01:35:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:16,596 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2023-02-15 01:35:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:35:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 54 [2023-02-15 01:35:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:16,597 INFO L225 Difference]: With dead ends: 93 [2023-02-15 01:35:16,597 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 01:35:16,599 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 01:35:16,599 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:16,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 219 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 01:35:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2023-02-15 01:35:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 states have internal predecessors, (83), 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 01:35:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-15 01:35:16,605 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2023-02-15 01:35:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:16,605 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-15 01:35:16,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 01:35:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-15 01:35:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:35:16,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:16,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:16,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:35:16,607 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893006, now seen corresponding path program 1 times [2023-02-15 01:35:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:16,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872264118] [2023-02-15 01:35:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 01:35:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:16,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872264118] [2023-02-15 01:35:16,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872264118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:16,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:16,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:35:16,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091534351] [2023-02-15 01:35:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:16,848 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 01:35:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:16,964 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-02-15 01:35:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:35:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 54 [2023-02-15 01:35:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:16,965 INFO L225 Difference]: With dead ends: 80 [2023-02-15 01:35:16,965 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 01:35:16,965 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 01:35:16,966 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:16,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 218 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 01:35:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 01:35:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 75 states have internal predecessors, (82), 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 01:35:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-02-15 01:35:16,969 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 54 [2023-02-15 01:35:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:16,969 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-02-15 01:35:16,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 01:35:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-02-15 01:35:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:35:16,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:16,970 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:16,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:35:16,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948792, now seen corresponding path program 1 times [2023-02-15 01:35:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:16,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936940359] [2023-02-15 01:35:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 01:35:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936940359] [2023-02-15 01:35:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936940359] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:17,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:35:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870113770] [2023-02-15 01:35:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:35:17,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:17,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:35:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:35:17,254 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:17,486 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-15 01:35:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:35:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2023-02-15 01:35:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:17,487 INFO L225 Difference]: With dead ends: 141 [2023-02-15 01:35:17,488 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 01:35:17,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:35:17,488 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 165 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:17,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 333 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:35:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 01:35:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2023-02-15 01:35:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 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 01:35:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2023-02-15 01:35:17,491 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 54 [2023-02-15 01:35:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:17,492 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2023-02-15 01:35:17,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2023-02-15 01:35:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 01:35:17,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:17,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:17,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:35:17,492 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948791, now seen corresponding path program 1 times [2023-02-15 01:35:17,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:17,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248611744] [2023-02-15 01:35:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 01:35:17,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:17,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248611744] [2023-02-15 01:35:17,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248611744] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:17,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:17,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:35:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232037193] [2023-02-15 01:35:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:17,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:35:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:35:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:35:17,912 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:18,135 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-02-15 01:35:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:35:18,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2023-02-15 01:35:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:18,136 INFO L225 Difference]: With dead ends: 131 [2023-02-15 01:35:18,136 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 01:35:18,137 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 01:35:18,137 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 223 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:18,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 325 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:35:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 01:35:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2023-02-15 01:35:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 81 states have internal predecessors, (90), 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 01:35:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2023-02-15 01:35:18,140 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 54 [2023-02-15 01:35:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:18,141 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2023-02-15 01:35:18,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2023-02-15 01:35:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:35:18,142 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:18,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:18,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 01:35:18,142 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023000, now seen corresponding path program 1 times [2023-02-15 01:35:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:18,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967976205] [2023-02-15 01:35:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:19,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967976205] [2023-02-15 01:35:19,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967976205] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:19,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218916121] [2023-02-15 01:35:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:19,860 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 01:35:19,863 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 01:35:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:20,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-15 01:35:20,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:20,134 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 01:35:20,411 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:35:20,411 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 17 treesize of output 21 [2023-02-15 01:35:20,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:35:20,645 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:20,645 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 34 treesize of output 35 [2023-02-15 01:35:20,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:20,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:20,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2023-02-15 01:35:20,893 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 01:35:21,066 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2832)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2833) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:35:21,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,112 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:21,113 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 57 treesize of output 55 [2023-02-15 01:35:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,119 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 62 treesize of output 58 [2023-02-15 01:35:21,145 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2023-02-15 01:35:21,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2023-02-15 01:35:21,224 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 63 treesize of output 43 [2023-02-15 01:35:21,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:21,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:21,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 21 [2023-02-15 01:35:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:35:21,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:21,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218916121] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:21,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:21,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2023-02-15 01:35:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240568259] [2023-02-15 01:35:21,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:21,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 01:35:21,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 01:35:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2448, Unknown=1, NotChecked=100, Total=2756 [2023-02-15 01:35:21,712 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:35:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:23,771 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2023-02-15 01:35:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 01:35:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2023-02-15 01:35:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:23,772 INFO L225 Difference]: With dead ends: 133 [2023-02-15 01:35:23,772 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 01:35:23,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=496, Invalid=4063, Unknown=1, NotChecked=132, Total=4692 [2023-02-15 01:35:23,774 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 521 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:23,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1106 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1561 Invalid, 0 Unknown, 125 Unchecked, 1.1s Time] [2023-02-15 01:35:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 01:35:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2023-02-15 01:35:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2023-02-15 01:35:23,777 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 55 [2023-02-15 01:35:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:23,778 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2023-02-15 01:35:23,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:35:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2023-02-15 01:35:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:35:23,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:23,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:23,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:23,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:23,986 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1467022999, now seen corresponding path program 1 times [2023-02-15 01:35:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:23,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242782711] [2023-02-15 01:35:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:23,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:26,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242782711] [2023-02-15 01:35:26,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242782711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:26,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392347277] [2023-02-15 01:35:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:26,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:26,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:26,477 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 01:35:26,480 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 01:35:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:26,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-15 01:35:26,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:26,789 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 01:35:27,143 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:35:27,143 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 17 treesize of output 21 [2023-02-15 01:35:27,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:35:27,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:35:27,375 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:27,375 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 65 treesize of output 62 [2023-02-15 01:35:27,379 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 41 treesize of output 41 [2023-02-15 01:35:27,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:27,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 36 [2023-02-15 01:35:27,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:27,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:35:27,915 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3104 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3104) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3105) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3099 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3099))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:35:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:27,955 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:27,956 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 79 treesize of output 67 [2023-02-15 01:35:27,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:27,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:27,967 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:35:27,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-15 01:35:27,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:27,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 01:35:27,991 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:35:27,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 01:35:28,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:28,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:35:28,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:35:28,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 45 [2023-02-15 01:35:28,252 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 01:35:28,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 25 [2023-02-15 01:35:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:35:28,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:28,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392347277] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:28,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:28,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2023-02-15 01:35:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39165880] [2023-02-15 01:35:28,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:28,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 01:35:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 01:35:28,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3000, Unknown=3, NotChecked=110, Total=3306 [2023-02-15 01:35:28,766 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 01:35:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:32,289 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2023-02-15 01:35:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 01:35:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 55 [2023-02-15 01:35:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:32,291 INFO L225 Difference]: With dead ends: 179 [2023-02-15 01:35:32,291 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 01:35:32,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=577, Invalid=5586, Unknown=3, NotChecked=154, Total=6320 [2023-02-15 01:35:32,292 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 772 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:32,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1347 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2419 Invalid, 0 Unknown, 189 Unchecked, 1.4s Time] [2023-02-15 01:35:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 01:35:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 90. [2023-02-15 01:35:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 85 states have internal predecessors, (95), 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 01:35:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2023-02-15 01:35:32,296 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 55 [2023-02-15 01:35:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:32,296 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2023-02-15 01:35:32,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 01:35:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2023-02-15 01:35:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:35:32,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:32,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:32,308 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 01:35:32,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:32,503 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash -938871693, now seen corresponding path program 1 times [2023-02-15 01:35:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:32,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150247121] [2023-02-15 01:35:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 01:35:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:32,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150247121] [2023-02-15 01:35:32,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150247121] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:32,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:32,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 01:35:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790885721] [2023-02-15 01:35:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:35:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:35:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:35:32,754 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:32,917 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2023-02-15 01:35:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:35:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2023-02-15 01:35:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:32,919 INFO L225 Difference]: With dead ends: 118 [2023-02-15 01:35:32,919 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 01:35:32,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 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 01:35:32,919 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:32,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 531 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:35:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 01:35:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2023-02-15 01:35:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 85 states have internal predecessors, (94), 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 01:35:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2023-02-15 01:35:32,922 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 55 [2023-02-15 01:35:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:32,922 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2023-02-15 01:35:32,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2023-02-15 01:35:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:35:32,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:32,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:32,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 01:35:32,923 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash 959790642, now seen corresponding path program 1 times [2023-02-15 01:35:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:32,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854911875] [2023-02-15 01:35:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:33,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:35:33,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854911875] [2023-02-15 01:35:33,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854911875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353624281] [2023-02-15 01:35:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:33,380 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 01:35:33,382 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 01:35:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:33,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 01:35:33,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:33,825 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 01:35:33,988 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 01:35:33,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:33,994 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 01:35:34,001 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 01:35:34,044 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 01:35:34,047 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 01:35:34,110 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 01:35:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 01:35:34,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:35:34,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353624281] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:34,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:35:34,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-02-15 01:35:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045826606] [2023-02-15 01:35:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:35:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:35:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-02-15 01:35:34,137 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:34,560 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2023-02-15 01:35:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:35:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2023-02-15 01:35:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:34,562 INFO L225 Difference]: With dead ends: 116 [2023-02-15 01:35:34,562 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 01:35:34,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 01:35:34,563 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 201 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:34,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 566 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:35:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 01:35:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2023-02-15 01:35:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:35:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-02-15 01:35:34,565 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 56 [2023-02-15 01:35:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:34,566 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-02-15 01:35:34,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:35:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-02-15 01:35:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:35:34,566 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:34,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:34,575 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 01:35:34,773 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 01:35:34,774 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -588248546, now seen corresponding path program 2 times [2023-02-15 01:35:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:34,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327379208] [2023-02-15 01:35:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:34,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:36,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:37,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:38,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327379208] [2023-02-15 01:35:38,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327379208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:38,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966096933] [2023-02-15 01:35:38,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:35:38,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:38,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:38,081 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 01:35:38,083 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 01:35:38,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:35:38,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:35:38,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 141 conjunts are in the unsatisfiable core [2023-02-15 01:35:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:38,397 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 01:35:38,605 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 01:35:38,612 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 01:35:39,056 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:35:39,057 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:35:39,071 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:35:39,072 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 01:35:39,077 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 01:35:39,239 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 01:35:39,244 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 01:35:39,301 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 21 treesize of output 20 [2023-02-15 01:35:39,308 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 21 treesize of output 20 [2023-02-15 01:35:39,411 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-02-15 01:35:39,411 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 94 treesize of output 57 [2023-02-15 01:35:39,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-02-15 01:35:39,723 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-02-15 01:35:39,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2023-02-15 01:35:39,751 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 01:35:39,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 01:35:39,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:35:39,924 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3810) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3809) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:35:39,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:39,968 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:35:39,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 106 [2023-02-15 01:35:39,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:39,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:39,984 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-15 01:35:39,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2023-02-15 01:35:40,003 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 01:35:40,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 01:35:40,568 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2023-02-15 01:35:40,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2023-02-15 01:35:40,582 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-15 01:35:40,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2023-02-15 01:35:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 01:35:40,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966096933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:41,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:41,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2023-02-15 01:35:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640570630] [2023-02-15 01:35:41,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 01:35:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 01:35:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3492, Unknown=2, NotChecked=118, Total=3782 [2023-02-15 01:35:41,162 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 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 01:35:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:44,522 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-15 01:35:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 01:35:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 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 59 [2023-02-15 01:35:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:44,523 INFO L225 Difference]: With dead ends: 116 [2023-02-15 01:35:44,523 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 01:35:44,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=371, Invalid=6437, Unknown=2, NotChecked=162, Total=6972 [2023-02-15 01:35:44,525 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:44,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1513 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2082 Invalid, 0 Unknown, 102 Unchecked, 1.5s Time] [2023-02-15 01:35:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 01:35:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2023-02-15 01:35:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 105 states have internal predecessors, (116), 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 01:35:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2023-02-15 01:35:44,528 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 59 [2023-02-15 01:35:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:44,528 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2023-02-15 01:35:44,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 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 01:35:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2023-02-15 01:35:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:35:44,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:44,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:44,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:44,735 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,SelfDestructingSolverStorable22 [2023-02-15 01:35:44,736 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094492, now seen corresponding path program 1 times [2023-02-15 01:35:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:44,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618697937] [2023-02-15 01:35:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:35:45,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:45,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618697937] [2023-02-15 01:35:45,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618697937] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:45,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:45,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-15 01:35:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266951361] [2023-02-15 01:35:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:45,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 01:35:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 01:35:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2023-02-15 01:35:45,502 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:35:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:46,289 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2023-02-15 01:35:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:35:46,290 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-02-15 01:35:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:46,291 INFO L225 Difference]: With dead ends: 176 [2023-02-15 01:35:46,291 INFO L226 Difference]: Without dead ends: 176 [2023-02-15 01:35:46,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 01:35:46,292 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 612 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:46,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 502 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:35:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-15 01:35:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2023-02-15 01:35:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 112 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 01:35:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2023-02-15 01:35:46,296 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2023-02-15 01:35:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:46,296 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2023-02-15 01:35:46,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:35:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2023-02-15 01:35:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:35:46,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:46,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:46,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 01:35:46,298 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094491, now seen corresponding path program 1 times [2023-02-15 01:35:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:46,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134585357] [2023-02-15 01:35:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:35:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:47,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134585357] [2023-02-15 01:35:47,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134585357] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:47,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126443044] [2023-02-15 01:35:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:47,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:47,838 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 01:35:47,839 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 01:35:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:48,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 01:35:48,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:48,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:48,509 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 27 treesize of output 15 [2023-02-15 01:35:48,512 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 01:35:48,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:48,751 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 01:35:48,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:48,757 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 26 [2023-02-15 01:35:48,767 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 01:35:48,767 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-02-15 01:35:48,782 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:35:48,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:35:49,008 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:35:49,008 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:35:49,023 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-15 01:35:49,024 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2023-02-15 01:35:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:49,036 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 01:35:49,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:49,053 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 32 treesize of output 30 [2023-02-15 01:35:49,135 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 33 treesize of output 17 [2023-02-15 01:35:49,141 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 01:35:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:49,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:50,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126443044] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:50,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:50,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2023-02-15 01:35:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197878275] [2023-02-15 01:35:50,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:50,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-15 01:35:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-15 01:35:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2197, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 01:35:50,373 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:35:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:53,276 INFO L93 Difference]: Finished difference Result 206 states and 228 transitions. [2023-02-15 01:35:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 01:35:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2023-02-15 01:35:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:53,279 INFO L225 Difference]: With dead ends: 206 [2023-02-15 01:35:53,280 INFO L226 Difference]: Without dead ends: 206 [2023-02-15 01:35:53,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=480, Invalid=4490, Unknown=0, NotChecked=0, Total=4970 [2023-02-15 01:35:53,281 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 714 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:53,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1289 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 01:35:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-15 01:35:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 122. [2023-02-15 01:35:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 115 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 01:35:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2023-02-15 01:35:53,286 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 59 [2023-02-15 01:35:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:53,287 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2023-02-15 01:35:53,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:35:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2023-02-15 01:35:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:35:53,288 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:53,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:53,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:53,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 01:35:53,494 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1526484642, now seen corresponding path program 1 times [2023-02-15 01:35:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:53,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157640410] [2023-02-15 01:35:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:53,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:35:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:53,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157640410] [2023-02-15 01:35:53,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157640410] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:53,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896683654] [2023-02-15 01:35:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:53,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:53,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:53,927 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:53,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:35:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:54,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 01:35:54,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:54,430 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 8 treesize of output 4 [2023-02-15 01:35:54,486 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4538 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4538)))) is different from true [2023-02-15 01:35:54,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:54,500 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 15 treesize of output 17 [2023-02-15 01:35:54,526 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 16 treesize of output 8 [2023-02-15 01:35:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2023-02-15 01:35:54,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:54,577 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4543 (Array Int Int)) (|v_node_create_~temp~0#1.base_66| Int)) (or (not (< |v_node_create_~temp~0#1.base_66| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_66| v_ArrVal_4543) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2023-02-15 01:35:54,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896683654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:54,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:35:54,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 01:35:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908003901] [2023-02-15 01:35:54,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:54,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:35:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:35:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2023-02-15 01:35:54,580 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:55,007 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2023-02-15 01:35:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:35:55,008 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-02-15 01:35:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:55,008 INFO L225 Difference]: With dead ends: 115 [2023-02-15 01:35:55,008 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 01:35:55,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2023-02-15 01:35:55,009 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 398 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:35:55,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 534 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 510 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2023-02-15 01:35:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 01:35:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-15 01:35:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 108 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 01:35:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-02-15 01:35:55,012 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 59 [2023-02-15 01:35:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:55,012 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-02-15 01:35:55,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:35:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-02-15 01:35:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 01:35:55,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:55,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:55,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-15 01:35:55,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:55,214 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:35:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 95034574, now seen corresponding path program 1 times [2023-02-15 01:35:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:55,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308111392] [2023-02-15 01:35:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:35:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:35:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:35:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:35:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308111392] [2023-02-15 01:35:57,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308111392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811051336] [2023-02-15 01:35:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:57,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:57,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:57,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 01:35:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:58,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-15 01:35:58,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:58,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:58,483 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:35:58,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:35:58,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 01:35:58,685 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:35:58,685 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 44 treesize of output 43 [2023-02-15 01:35:58,950 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-02-15 01:35:58,950 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 69 treesize of output 37 [2023-02-15 01:35:58,954 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 11 [2023-02-15 01:35:58,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:35:59,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:59,408 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:35:59,408 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 75 treesize of output 67 [2023-02-15 01:35:59,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:35:59,420 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 66 treesize of output 64 [2023-02-15 01:35:59,437 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 01:35:59,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 01:35:59,588 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 66 treesize of output 50 [2023-02-15 01:35:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:59,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:00,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| Int) (v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4834 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_4833))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35| v_ArrVal_4834) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_35|) 0)))) is different from false [2023-02-15 01:36:00,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811051336] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:00,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:36:00,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 56 [2023-02-15 01:36:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507019797] [2023-02-15 01:36:00,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:00,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 01:36:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:00,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 01:36:00,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3371, Unknown=5, NotChecked=116, Total=3660 [2023-02-15 01:36:00,175 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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 01:36:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:04,670 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-02-15 01:36:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 01:36:04,671 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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 61 [2023-02-15 01:36:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:04,671 INFO L225 Difference]: With dead ends: 120 [2023-02-15 01:36:04,672 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 01:36:04,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=583, Invalid=6222, Unknown=5, NotChecked=162, Total=6972 [2023-02-15 01:36:04,673 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 469 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:04,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1148 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 01:36:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 01:36:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2023-02-15 01:36:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.25) internal successors, (110), 101 states have internal predecessors, (110), 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 01:36:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2023-02-15 01:36:04,676 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 61 [2023-02-15 01:36:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:04,677 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-02-15 01:36:04,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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 01:36:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2023-02-15 01:36:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 01:36:04,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:04,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:04,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:04,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 01:36:04,889 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:36:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 592087770, now seen corresponding path program 1 times [2023-02-15 01:36:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:04,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5626441] [2023-02-15 01:36:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:36:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:36:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:36:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:36:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5626441] [2023-02-15 01:36:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5626441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743449533] [2023-02-15 01:36:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:05,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:05,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:05,893 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:05,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 01:36:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:06,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:36:06,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:06,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:36:06,513 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 18 treesize of output 10 [2023-02-15 01:36:06,583 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5105 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5105))) (exists ((v_ArrVal_5104 Int)) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5104) |c_#valid|))) is different from true [2023-02-15 01:36:06,588 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5106 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5106))) (exists ((v_ArrVal_5104 Int)) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5104) |c_#valid|))) is different from true [2023-02-15 01:36:06,633 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5107 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5104 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_5104)))) is different from true [2023-02-15 01:36:06,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:06,646 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 01:36:06,657 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:36:06,658 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 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 01:36:07,021 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-15 01:36:07,021 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2023-02-15 01:36:07,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,029 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 01:36:07,093 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 01:36:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2023-02-15 01:36:07,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:09,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743449533] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:09,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:36:09,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2023-02-15 01:36:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180520510] [2023-02-15 01:36:09,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:09,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 01:36:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 01:36:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2933, Unknown=28, NotChecked=336, Total=3540 [2023-02-15 01:36:09,837 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:36:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:11,569 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2023-02-15 01:36:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:36:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2023-02-15 01:36:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:11,570 INFO L225 Difference]: With dead ends: 125 [2023-02-15 01:36:11,571 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 01:36:11,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=700, Invalid=4981, Unknown=31, NotChecked=450, Total=6162 [2023-02-15 01:36:11,572 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 955 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 36 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:11,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 622 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1254 Invalid, 3 Unknown, 257 Unchecked, 0.6s Time] [2023-02-15 01:36:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 01:36:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2023-02-15 01:36:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 101 states have internal predecessors, (109), 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 01:36:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2023-02-15 01:36:11,575 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 63 [2023-02-15 01:36:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:11,576 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2023-02-15 01:36:11,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:36:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2023-02-15 01:36:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 01:36:11,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:11,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:11,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:11,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 01:36:11,784 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:36:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2060666116, now seen corresponding path program 1 times [2023-02-15 01:36:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:11,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419554423] [2023-02-15 01:36:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:36:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:36:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:14,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:36:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:36:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:15,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419554423] [2023-02-15 01:36:15,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419554423] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:15,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448001575] [2023-02-15 01:36:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:15,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:15,411 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:15,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 01:36:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:15,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-15 01:36:15,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:15,728 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 01:36:15,783 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 01:36:15,931 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:36:15,932 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 17 treesize of output 21 [2023-02-15 01:36:16,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:36:16,320 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:36:16,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:36:16,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:36:16,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:36:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:16,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:36:16,730 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:36:16,730 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2023-02-15 01:36:16,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 01:36:17,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:17,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2023-02-15 01:36:17,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:36:17,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 01:36:17,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:17,591 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:17,591 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 84 treesize of output 70 [2023-02-15 01:36:17,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:17,608 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:36:17,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:36:17,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:36:17,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:17,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:36:18,658 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:36:18,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 129 [2023-02-15 01:36:18,670 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:36:18,671 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 69 treesize of output 49 [2023-02-15 01:36:18,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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 01:36:18,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:18,787 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:18,787 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 82 treesize of output 68 [2023-02-15 01:36:18,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:36:18,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:18,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:36:18,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:18,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-02-15 01:36:18,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:36:19,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:36:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:36:19,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:19,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 01:36:19,098 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5409 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5410) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5408) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |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_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 01:36:20,574 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5409 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| Int) (v_ArrVal_5428 (Array Int Int)) (v_ArrVal_5427 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_28| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5427)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5426))) (let ((.cse1 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_28| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| |c_#StackHeapBarrier|)) (not (= (select (select .cse0 .cse1) .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5428) .cse1 v_ArrVal_5410) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5411) (select (select (store (store .cse0 .cse1 v_ArrVal_5408) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_5409)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41|) 0)))))) is different from false [2023-02-15 01:36:20,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448001575] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:20,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:36:20,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2023-02-15 01:36:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020810206] [2023-02-15 01:36:20,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:20,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-15 01:36:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:20,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-15 01:36:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=5564, Unknown=8, NotChecked=456, Total=6320 [2023-02-15 01:36:20,578 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 70 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 61 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 01:36:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:26,957 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2023-02-15 01:36:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 01:36:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 61 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 65 [2023-02-15 01:36:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:26,958 INFO L225 Difference]: With dead ends: 167 [2023-02-15 01:36:26,958 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 01:36:26,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=928, Invalid=9996, Unknown=8, NotChecked=624, Total=11556 [2023-02-15 01:36:26,959 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 808 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:26,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1167 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 01:36:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 01:36:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2023-02-15 01:36:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 108 states have internal predecessors, (116), 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 01:36:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2023-02-15 01:36:26,962 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 65 [2023-02-15 01:36:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:26,963 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2023-02-15 01:36:26,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 61 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 01:36:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2023-02-15 01:36:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 01:36:26,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:26,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:26,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-15 01:36:27,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 01:36:27,169 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:36:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458320, now seen corresponding path program 1 times [2023-02-15 01:36:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:27,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708929547] [2023-02-15 01:36:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:36:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:28,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:36:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:36:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:36:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:29,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708929547] [2023-02-15 01:36:29,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708929547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:29,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722376968] [2023-02-15 01:36:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:29,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:29,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:29,258 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:29,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 01:36:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:29,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-15 01:36:29,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:29,606 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 01:36:29,649 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 01:36:29,784 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:36:29,785 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 17 treesize of output 21 [2023-02-15 01:36:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:36:30,099 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:36:30,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:36:30,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:36:30,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:36:30,358 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-02-15 01:36:30,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:30,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2023-02-15 01:36:30,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 01:36:30,689 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 01:36:30,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:30,983 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 01:36:30,983 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 75 treesize of output 56 [2023-02-15 01:36:30,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:30,997 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:36:30,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:36:31,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:31,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 01:36:31,783 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:36:31,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 119 [2023-02-15 01:36:31,797 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:36:31,797 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 68 treesize of output 48 [2023-02-15 01:36:31,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:31,895 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:31,895 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 90 treesize of output 72 [2023-02-15 01:36:31,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:31,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:36:31,992 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 34 treesize of output 22 [2023-02-15 01:36:32,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:32,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 28 [2023-02-15 01:36:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:36:32,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:32,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5712 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5713) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5712))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4))) 1) (not (<= 0 .cse1))))) is different from false [2023-02-15 01:36:32,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5710 (Array Int Int)) (v_ArrVal_5711 Int) (v_ArrVal_5712 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5711)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5713) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5710) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5712))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4))) 1) (not (<= 0 .cse1))))) is different from false [2023-02-15 01:36:32,546 INFO L321 Elim1Store]: treesize reduction 5, result has 89.4 percent of original size [2023-02-15 01:36:32,546 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 51 treesize of output 50 [2023-02-15 01:36:33,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722376968] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:33,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:36:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2023-02-15 01:36:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587567956] [2023-02-15 01:36:33,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:33,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-15 01:36:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-15 01:36:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5722, Unknown=2, NotChecked=306, Total=6320 [2023-02-15 01:36:33,486 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 01:36:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:38,249 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2023-02-15 01:36:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:36:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 68 [2023-02-15 01:36:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:38,252 INFO L225 Difference]: With dead ends: 189 [2023-02-15 01:36:38,252 INFO L226 Difference]: Without dead ends: 189 [2023-02-15 01:36:38,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=946, Invalid=9980, Unknown=2, NotChecked=414, Total=11342 [2023-02-15 01:36:38,256 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1290 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:38,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1020 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 01:36:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-15 01:36:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2023-02-15 01:36:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 112 states have internal predecessors, (122), 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 01:36:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-15 01:36:38,259 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 68 [2023-02-15 01:36:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:38,259 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-15 01:36:38,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 6 states have call successors, (6), 3 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 01:36:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-15 01:36:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 01:36:38,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:38,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:38,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:38,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:38,469 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:36:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458321, now seen corresponding path program 1 times [2023-02-15 01:36:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:38,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139051282] [2023-02-15 01:36:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:36:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:36:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:36:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:36:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:41,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139051282] [2023-02-15 01:36:41,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139051282] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:41,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106649962] [2023-02-15 01:36:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:41,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:41,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:41,531 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:41,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 01:36:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:41,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 147 conjunts are in the unsatisfiable core [2023-02-15 01:36:41,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:41,890 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 01:36:41,938 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 01:36:42,083 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:36:42,084 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 17 treesize of output 21 [2023-02-15 01:36:42,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:36:42,485 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:36:42,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:36:42,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:36:42,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:36:42,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:36:42,803 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 70 [2023-02-15 01:36:42,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2023-02-15 01:36:43,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:43,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 48 [2023-02-15 01:36:43,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:36:43,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 01:36:43,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:43,628 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 01:36:43,628 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 109 treesize of output 80 [2023-02-15 01:36:43,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:43,656 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:36:43,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:36:43,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:43,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-02-15 01:36:43,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-02-15 01:36:44,698 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:36:44,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 130 [2023-02-15 01:36:44,721 INFO L321 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-02-15 01:36:44,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 62 [2023-02-15 01:36:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:44,833 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:44,833 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 105 treesize of output 83 [2023-02-15 01:36:44,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:44,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2023-02-15 01:36:45,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:36:45,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:45,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:45,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 57 [2023-02-15 01:36:45,345 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:36:45,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 25 [2023-02-15 01:36:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:36:45,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:45,939 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6011 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6011))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6012 (Array Int Int))) (<= 0 (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6012) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse1)))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_6011 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6011))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_6012 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6012))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ 4 .cse2))) (<= (+ 4 (select (select .cse3 .cse4) .cse5)) (select |c_#length| (select (select .cse6 .cse4) .cse5))))))))))) is different from false [2023-02-15 01:36:55,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106649962] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:55,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:36:55,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 68 [2023-02-15 01:36:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259428459] [2023-02-15 01:36:55,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:55,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-15 01:36:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-15 01:36:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=6669, Unknown=7, NotChecked=164, Total=7140 [2023-02-15 01:36:55,505 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 69 states, 66 states have (on average 1.803030303030303) internal successors, (119), 60 states have internal predecessors, (119), 6 states have call successors, (6), 3 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 01:37:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:37:24,051 INFO L93 Difference]: Finished difference Result 203 states and 222 transitions. [2023-02-15 01:37:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:37:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.803030303030303) internal successors, (119), 60 states have internal predecessors, (119), 6 states have call successors, (6), 3 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 68 [2023-02-15 01:37:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:37:24,056 INFO L225 Difference]: With dead ends: 203 [2023-02-15 01:37:24,057 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 01:37:24,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=1010, Invalid=11869, Unknown=7, NotChecked=224, Total=13110 [2023-02-15 01:37:24,058 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1674 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 3146 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:37:24,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 1116 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3146 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-02-15 01:37:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 01:37:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 118. [2023-02-15 01:37:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 111 states have internal predecessors, (120), 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 01:37:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2023-02-15 01:37:24,076 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 68 [2023-02-15 01:37:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:37:24,076 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2023-02-15 01:37:24,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.803030303030303) internal successors, (119), 60 states have internal predecessors, (119), 6 states have call successors, (6), 3 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 01:37:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2023-02-15 01:37:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-15 01:37:24,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:37:24,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:37:24,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 01:37:24,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:24,277 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:37:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:37:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1488466325, now seen corresponding path program 1 times [2023-02-15 01:37:24,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:37:24,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104971604] [2023-02-15 01:37:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:37:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:37:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:37:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:37:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:37:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:37:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104971604] [2023-02-15 01:37:31,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104971604] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414515234] [2023-02-15 01:37:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:37:31,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:37:31,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:37:31,647 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:37:31,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 01:37:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:37:32,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-15 01:37:32,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:37:32,029 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 01:37:32,235 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 01:37:32,902 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:37:32,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:37:33,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:37:34,413 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:37:34,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:37:35,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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 01:37:35,601 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:37:35,602 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2023-02-15 01:37:36,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:37:36,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 34 [2023-02-15 01:37:37,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 01:37:37,009 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 01:37:38,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:38,687 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 01:37:38,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:38,737 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:37:38,737 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 85 treesize of output 67 [2023-02-15 01:37:38,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:38,845 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:37:38,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:37:42,280 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:37:42,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 112 [2023-02-15 01:37:42,339 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:37:42,339 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 49 treesize of output 33 [2023-02-15 01:37:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:42,750 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:37:42,750 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 83 treesize of output 65 [2023-02-15 01:37:42,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:37:42,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:37:43,102 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 01:37:43,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:37:43,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2023-02-15 01:37:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:37:43,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:37:49,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414515234] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:37:49,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:37:49,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 70 [2023-02-15 01:37:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756820931] [2023-02-15 01:37:49,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:37:49,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-15 01:37:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:37:49,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-15 01:37:49,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=6215, Unknown=100, NotChecked=0, Total=6642 [2023-02-15 01:37:49,093 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 70 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 61 states have internal predecessors, (121), 6 states have call successors, (6), 3 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 01:38:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:15,035 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2023-02-15 01:38:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 01:38:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 61 states have internal predecessors, (121), 6 states have call successors, (6), 3 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 69 [2023-02-15 01:38:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:15,037 INFO L225 Difference]: With dead ends: 187 [2023-02-15 01:38:15,037 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 01:38:15,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3422 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=1363, Invalid=12565, Unknown=114, NotChecked=0, Total=14042 [2023-02-15 01:38:15,038 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1626 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:15,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 1073 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-02-15 01:38:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 01:38:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 123. [2023-02-15 01:38:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 116 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 01:38:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2023-02-15 01:38:15,042 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 69 [2023-02-15 01:38:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:15,042 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2023-02-15 01:38:15,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 61 states have internal predecessors, (121), 6 states have call successors, (6), 3 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 01:38:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2023-02-15 01:38:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 01:38:15,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:15,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:15,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:15,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-15 01:38:15,254 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 01:38:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1102226234, now seen corresponding path program 1 times [2023-02-15 01:38:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:15,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701925275] [2023-02-15 01:38:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:38:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 01:38:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:38:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:23,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701925275] [2023-02-15 01:38:23,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701925275] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:23,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799437116] [2023-02-15 01:38:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:23,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:23,214 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:23,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-15 01:38:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:23,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 183 conjunts are in the unsatisfiable core [2023-02-15 01:38:23,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:23,622 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 01:38:23,836 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 01:38:24,484 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:38:24,484 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 17 treesize of output 21 [2023-02-15 01:38:25,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:38:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:25,314 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 21 treesize of output 20 [2023-02-15 01:38:25,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:38:27,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:38:27,207 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:38:27,214 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 01:38:27,317 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:38:27,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:38:28,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:38:28,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:38:28,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:38:28,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:38:28,582 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:38:28,583 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2023-02-15 01:38:28,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:28,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-02-15 01:38:28,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:38:29,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:29,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 44 [2023-02-15 01:38:29,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:38:29,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 01:38:31,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:31,538 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 01:38:31,538 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 101 treesize of output 74 [2023-02-15 01:38:31,590 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-02-15 01:38:31,591 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 1 case distinctions, treesize of input 24 treesize of output 31 [2023-02-15 01:38:31,598 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 01:38:31,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:31,667 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:38:31,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:38:31,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:31,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-02-15 01:38:35,306 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:38:35,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 233 treesize of output 168 [2023-02-15 01:38:35,437 INFO L321 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2023-02-15 01:38:35,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 91 [2023-02-15 01:38:35,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:38:35,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:35,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2023-02-15 01:38:35,471 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 3 [2023-02-15 01:38:35,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:35,867 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:38:35,868 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 103 treesize of output 83 [2023-02-15 01:38:35,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:38:35,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:35,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-02-15 01:38:37,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:38:37,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:37,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:37,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 59 [2023-02-15 01:38:37,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2023-02-15 01:38:38,070 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 01:38:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:38,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:39,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6623 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6625))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6623))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse0 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6624) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2023-02-15 01:38:45,643 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6640 (Array Int Int)) (v_ArrVal_6621 (Array Int Int)) (v_ArrVal_6623 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| Int) (v_ArrVal_6638 (Array Int Int)) (v_ArrVal_6620 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_38| Int) (v_ArrVal_6639 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6640)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6638))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse8 .cse10) .cse11)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| 4))) (let ((.cse6 (store (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_6620)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6625))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse8 .cse1 v_ArrVal_6621) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6623))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse7 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6639))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6618))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6624) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= 0 .cse7)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| (select (select .cse9 .cse10) .cse11)) (not (= (select (select .cse8 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53|) 0))))))))) is different from false [2023-02-15 01:38:45,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799437116] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:45,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:45,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 74 [2023-02-15 01:38:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403230707] [2023-02-15 01:38:45,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:45,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-02-15 01:38:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-02-15 01:38:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6976, Unknown=20, NotChecked=338, Total=7656 [2023-02-15 01:38:45,650 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 64 states have internal predecessors, (122), 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)