./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 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_insert_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 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:53:37,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:53:37,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:53:37,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:53:37,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:53:37,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:53:37,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:53:37,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:53:37,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:53:37,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:53:37,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:53:37,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:53:37,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:53:37,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:53:37,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:53:37,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:53:37,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:53:37,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:53:37,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:53:37,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:53:37,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:53:37,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:53:37,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:53:37,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:53:37,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:53:37,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:53:37,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:53:37,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:53:37,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:53:37,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:53:37,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:53:37,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:53:37,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:53:37,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:53:37,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:53:37,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:53:37,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:53:37,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:53:37,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:53:37,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:53:37,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:53:37,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:53:37,324 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:53:37,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:53:37,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:53:37,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:53:37,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:53:37,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:53:37,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:53:37,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:53:37,326 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:53:37,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:53:37,327 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:53:37,327 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:53:37,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:53:37,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:53:37,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:53:37,327 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:53:37,328 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:53:37,328 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:53:37,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:53:37,328 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:53:37,328 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:53:37,328 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:53:37,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:53:37,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:53:37,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:53:37,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:53:37,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:53:37,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:53:37,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:53:37,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:53:37,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:53:37,330 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:53:37,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:53:37,330 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:53:37,330 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 -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2023-02-14 13:53:37,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:53:37,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:53:37,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:53:37,544 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:53:37,544 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:53:37,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-02-14 13:53:38,507 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:53:38,702 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:53:38,703 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-02-14 13:53:38,710 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d98b11d/94c5da9825834463986cf826a8b11601/FLAGe953c826f [2023-02-14 13:53:38,719 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d98b11d/94c5da9825834463986cf826a8b11601 [2023-02-14 13:53:38,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:53:38,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:53:38,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:53:38,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:53:38,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:53:38,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:53:38" (1/1) ... [2023-02-14 13:53:38,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762cad19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:38, skipping insertion in model container [2023-02-14 13:53:38,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:53:38" (1/1) ... [2023-02-14 13:53:38,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:53:38,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:53:38,929 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_insert_equal.i[24706,24719] [2023-02-14 13:53:38,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:53:38,944 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:53:38,997 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_insert_equal.i[24706,24719] [2023-02-14 13:53:38,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:53:39,022 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:53:39,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39 WrapperNode [2023-02-14 13:53:39,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:53:39,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:53:39,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:53:39,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:53:39,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,070 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-02-14 13:53:39,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:53:39,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:53:39,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:53:39,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:53:39,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:53:39,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:53:39,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:53:39,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:53:39,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (1/1) ... [2023-02-14 13:53:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:53:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:39,140 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-14 13:53:39,144 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-14 13:53:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-14 13:53:39,168 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-14 13:53:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:53:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:53:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:53:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:53:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:53:39,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:53:39,312 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:53:39,313 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:53:39,363 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-14 13:53:39,675 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:53:39,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:53:39,680 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:53:39,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:53:39 BoogieIcfgContainer [2023-02-14 13:53:39,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:53:39,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:53:39,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:53:39,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:53:39,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:53:38" (1/3) ... [2023-02-14 13:53:39,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b6ebe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:53:39, skipping insertion in model container [2023-02-14 13:53:39,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:53:39" (2/3) ... [2023-02-14 13:53:39,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b6ebe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:53:39, skipping insertion in model container [2023-02-14 13:53:39,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:53:39" (3/3) ... [2023-02-14 13:53:39,690 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-02-14 13:53:39,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:53:39,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-02-14 13:53:39,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:53:39,734 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;@51c6b053, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:53:39,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-02-14 13:53:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 61 states have (on average 2.1311475409836067) internal successors, (130), 115 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:53:39,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:39,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:53:39,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:39,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2023-02-14 13:53:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:39,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69847803] [2023-02-14 13:53:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:39,941 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-14 13:53:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:39,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69847803] [2023-02-14 13:53:39,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69847803] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:39,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:39,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:53:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6385386] [2023-02-14 13:53:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:39,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:39,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:39,969 INFO L87 Difference]: Start difference. First operand has 117 states, 61 states have (on average 2.1311475409836067) internal successors, (130), 115 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:40,106 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2023-02-14 13:53:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 13:53:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:40,113 INFO L225 Difference]: With dead ends: 207 [2023-02-14 13:53:40,113 INFO L226 Difference]: Without dead ends: 200 [2023-02-14 13:53:40,114 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-14 13:53:40,116 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 110 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:40,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 230 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-14 13:53:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 108. [2023-02-14 13:53:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 107 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-14 13:53:40,142 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 5 [2023-02-14 13:53:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:40,143 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-14 13:53:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-14 13:53:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:53:40,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:40,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:53:40,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:53:40,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:40,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2023-02-14 13:53:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:40,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912144350] [2023-02-14 13:53:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:40,235 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-14 13:53:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:40,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912144350] [2023-02-14 13:53:40,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912144350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:40,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:40,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:53:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223648199] [2023-02-14 13:53:40,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:40,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:40,239 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:40,354 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2023-02-14 13:53:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 13:53:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:40,359 INFO L225 Difference]: With dead ends: 199 [2023-02-14 13:53:40,359 INFO L226 Difference]: Without dead ends: 199 [2023-02-14 13:53:40,362 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-14 13:53:40,364 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 108 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:40,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 224 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-14 13:53:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 105. [2023-02-14 13:53:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 104 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2023-02-14 13:53:40,378 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 5 [2023-02-14 13:53:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:40,379 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2023-02-14 13:53:40,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2023-02-14 13:53:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:53:40,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:40,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:40,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:53:40,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2023-02-14 13:53:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:40,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108683037] [2023-02-14 13:53:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:40,460 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-14 13:53:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:40,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108683037] [2023-02-14 13:53:40,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108683037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:40,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:40,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:53:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73829921] [2023-02-14 13:53:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:40,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:40,463 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:40,468 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2023-02-14 13:53:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:40,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 13:53:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:40,469 INFO L225 Difference]: With dead ends: 115 [2023-02-14 13:53:40,469 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 13:53:40,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:40,472 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:40,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 13:53:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2023-02-14 13:53:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 105 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-14 13:53:40,481 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 7 [2023-02-14 13:53:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:40,481 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-14 13:53:40,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-14 13:53:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 13:53:40,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:40,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:40,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:53:40,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2023-02-14 13:53:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:40,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350102474] [2023-02-14 13:53:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:40,550 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-14 13:53:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:40,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350102474] [2023-02-14 13:53:40,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350102474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:40,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:40,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:53:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126577258] [2023-02-14 13:53:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:40,554 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:40,570 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2023-02-14 13:53:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:40,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 13:53:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:40,571 INFO L225 Difference]: With dead ends: 112 [2023-02-14 13:53:40,571 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 13:53:40,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:40,572 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:40,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 215 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 13:53:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-14 13:53:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.859375) internal successors, (119), 110 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-14 13:53:40,581 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 9 [2023-02-14 13:53:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:40,582 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-14 13:53:40,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-14 13:53:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:53:40,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:40,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:40,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:53:40,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2023-02-14 13:53:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:40,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105160097] [2023-02-14 13:53:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:40,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:40,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105160097] [2023-02-14 13:53:40,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105160097] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:40,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117919543] [2023-02-14 13:53:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:40,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:40,695 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-14 13:53:40,712 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-14 13:53:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:40,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:53:40,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:40,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:40,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117919543] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:53:40,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:53:40,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-14 13:53:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659040497] [2023-02-14 13:53:40,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:40,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:53:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:53:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:40,883 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:40,893 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2023-02-14 13:53:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 13:53:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:40,897 INFO L225 Difference]: With dead ends: 113 [2023-02-14 13:53:40,897 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 13:53:40,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:40,898 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:40,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 429 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 13:53:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-02-14 13:53:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 112 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2023-02-14 13:53:40,901 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 14 [2023-02-14 13:53:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:40,902 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2023-02-14 13:53:40,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2023-02-14 13:53:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:53:40,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:40,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:40,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 13:53:41,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:41,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2023-02-14 13:53:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:41,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379914191] [2023-02-14 13:53:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379914191] [2023-02-14 13:53:41,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379914191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:41,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455819568] [2023-02-14 13:53:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:41,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:41,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:41,208 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-14 13:53:41,255 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-14 13:53:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:41,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:53:41,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:41,331 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-14 13:53:41,363 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:53:41,363 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-14 13:53:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:41,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:41,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455819568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:53:41,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:53:41,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-14 13:53:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511567569] [2023-02-14 13:53:41,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:41,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:53:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:41,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:53:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:53:41,470 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:41,576 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2023-02-14 13:53:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:53:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 13:53:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:41,578 INFO L225 Difference]: With dead ends: 124 [2023-02-14 13:53:41,578 INFO L226 Difference]: Without dead ends: 124 [2023-02-14 13:53:41,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:53:41,580 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 298 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:41,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 91 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-14 13:53:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2023-02-14 13:53:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 111 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2023-02-14 13:53:41,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 16 [2023-02-14 13:53:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:41,594 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2023-02-14 13:53:41,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2023-02-14 13:53:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:53:41,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:41,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:41,603 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-14 13:53:41,800 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,SelfDestructingSolverStorable5 [2023-02-14 13:53:41,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2023-02-14 13:53:41,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:41,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511808509] [2023-02-14 13:53:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511808509] [2023-02-14 13:53:41,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511808509] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452084333] [2023-02-14 13:53:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:41,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:42,010 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-14 13:53:42,052 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-14 13:53:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:42,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 13:53:42,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:42,133 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-14 13:53:42,138 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-14 13:53:42,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:42,191 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-14 13:53:42,198 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:53:42,199 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-14 13:53:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:42,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:46,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452084333] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:53:46,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:53:46,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-02-14 13:53:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671444525] [2023-02-14 13:53:46,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:46,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 13:53:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:46,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 13:53:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:53:46,675 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:46,808 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-14 13:53:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:46,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 13:53:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:46,809 INFO L225 Difference]: With dead ends: 123 [2023-02-14 13:53:46,809 INFO L226 Difference]: Without dead ends: 123 [2023-02-14 13:53:46,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:53:46,810 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 546 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:46,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 68 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-14 13:53:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2023-02-14 13:53:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.803030303030303) internal successors, (119), 110 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-14 13:53:46,812 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 16 [2023-02-14 13:53:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:46,812 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-14 13:53:46,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-14 13:53:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:53:46,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:46,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:46,821 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-14 13:53:47,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:47,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:47,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2023-02-14 13:53:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:47,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892369130] [2023-02-14 13:53:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:47,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:47,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892369130] [2023-02-14 13:53:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892369130] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078216135] [2023-02-14 13:53:47,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:53:47,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:47,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:47,060 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-14 13:53:47,085 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-14 13:53:47,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 13:53:47,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:53:47,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:53:47,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:47,160 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-14 13:53:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:47,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:53:47,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078216135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:47,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:53:47,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-02-14 13:53:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017392516] [2023-02-14 13:53:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:47,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:47,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:47,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:47,168 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:47,222 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2023-02-14 13:53:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:47,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 13:53:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:47,223 INFO L225 Difference]: With dead ends: 120 [2023-02-14 13:53:47,223 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 13:53:47,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:47,224 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 90 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:47,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 13:53:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2023-02-14 13:53:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 107 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-14 13:53:47,226 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 21 [2023-02-14 13:53:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:47,227 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-14 13:53:47,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-14 13:53:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:53:47,227 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:47,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:47,234 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-14 13:53:47,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:47,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:47,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2023-02-14 13:53:47,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:47,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740040198] [2023-02-14 13:53:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740040198] [2023-02-14 13:53:47,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740040198] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913291808] [2023-02-14 13:53:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:47,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:47,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:47,471 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-14 13:53:47,474 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-14 13:53:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:47,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:53:47,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:47,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:47,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913291808] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:53:47,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:53:47,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-02-14 13:53:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199727551] [2023-02-14 13:53:47,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:53:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:53:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:53:47,587 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:47,607 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-14 13:53:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:53:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 13:53:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:47,608 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:53:47,608 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:53:47,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:47,608 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 199 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:47,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 104 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:53:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-02-14 13:53:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 107 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2023-02-14 13:53:47,610 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 21 [2023-02-14 13:53:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:47,611 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2023-02-14 13:53:47,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2023-02-14 13:53:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:53:47,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:47,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:47,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-14 13:53:47,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:47,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:47,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2023-02-14 13:53:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309478954] [2023-02-14 13:53:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:47,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:47,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309478954] [2023-02-14 13:53:47,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309478954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:47,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:47,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:53:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301345548] [2023-02-14 13:53:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:47,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:47,890 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:47,934 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-14 13:53:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-14 13:53:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:47,935 INFO L225 Difference]: With dead ends: 105 [2023-02-14 13:53:47,935 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 13:53:47,935 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-14 13:53:47,936 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 90 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:47,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 13:53:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-02-14 13:53:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.696969696969697) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2023-02-14 13:53:47,939 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 22 [2023-02-14 13:53:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:47,940 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2023-02-14 13:53:47,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2023-02-14 13:53:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 13:53:47,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:47,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:47,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:53:47,941 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2023-02-14 13:53:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:47,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152139420] [2023-02-14 13:53:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:47,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:53:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152139420] [2023-02-14 13:53:48,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152139420] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712869398] [2023-02-14 13:53:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:48,221 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-14 13:53:48,252 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-14 13:53:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:48,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 13:53:48,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:48,345 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-14 13:53:48,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:48,357 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-14 13:53:48,374 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:53:48,374 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-14 13:53:48,397 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:53:48,397 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-14 13:53:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:53:48,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:53:48,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712869398] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:53:48,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:53:48,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2023-02-14 13:53:48,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179111958] [2023-02-14 13:53:48,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:53:48,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 13:53:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:48,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 13:53:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:53:48,481 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:48,562 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-02-14 13:53:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 13:53:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:48,563 INFO L225 Difference]: With dead ends: 110 [2023-02-14 13:53:48,563 INFO L226 Difference]: Without dead ends: 110 [2023-02-14 13:53:48,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:53:48,564 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 331 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:48,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 86 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-14 13:53:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2023-02-14 13:53:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-02-14 13:53:48,566 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 27 [2023-02-14 13:53:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:48,566 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-02-14 13:53:48,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-02-14 13:53:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 13:53:48,566 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:48,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:48,585 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-14 13:53:48,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:48,773 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2023-02-14 13:53:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:48,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722203017] [2023-02-14 13:53:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:53:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:49,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722203017] [2023-02-14 13:53:49,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722203017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:49,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109064801] [2023-02-14 13:53:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:49,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:49,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:49,062 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-14 13:53:49,063 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-14 13:53:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:49,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 13:53:49,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:49,176 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-14 13:53:49,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:49,202 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-14 13:53:49,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:49,233 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-14 13:53:49,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:49,276 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-14 13:53:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:49,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:53:49,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109064801] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:49,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:53:49,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-02-14 13:53:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718495543] [2023-02-14 13:53:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:49,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:53:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:53:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:53:49,293 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:49,350 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-02-14 13:53:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 13:53:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:49,351 INFO L225 Difference]: With dead ends: 91 [2023-02-14 13:53:49,351 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 13:53:49,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:53:49,352 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:49,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 59 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 13:53:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-14 13:53:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 90 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-02-14 13:53:49,354 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 27 [2023-02-14 13:53:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:49,354 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-02-14 13:53:49,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-02-14 13:53:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 13:53:49,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:49,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:49,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-14 13:53:49,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:49,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708524, now seen corresponding path program 1 times [2023-02-14 13:53:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:49,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647993417] [2023-02-14 13:53:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:53:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:49,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647993417] [2023-02-14 13:53:49,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647993417] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:49,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:49,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:53:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10668133] [2023-02-14 13:53:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:49,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:53:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:53:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:53:49,820 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:50,077 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2023-02-14 13:53:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 13:53:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-14 13:53:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:50,079 INFO L225 Difference]: With dead ends: 161 [2023-02-14 13:53:50,079 INFO L226 Difference]: Without dead ends: 161 [2023-02-14 13:53:50,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-02-14 13:53:50,080 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 582 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:50,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 184 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:53:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-14 13:53:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 99. [2023-02-14 13:53:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 98 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2023-02-14 13:53:50,082 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 30 [2023-02-14 13:53:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:50,082 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2023-02-14 13:53:50,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2023-02-14 13:53:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 13:53:50,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:50,083 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:50,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 13:53:50,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708523, now seen corresponding path program 1 times [2023-02-14 13:53:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:50,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265981771] [2023-02-14 13:53:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:50,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:53:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265981771] [2023-02-14 13:53:50,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265981771] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:50,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:50,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 13:53:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999743010] [2023-02-14 13:53:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:50,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 13:53:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 13:53:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:53:50,373 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:50,641 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-14 13:53:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:53:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-14 13:53:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:50,642 INFO L225 Difference]: With dead ends: 150 [2023-02-14 13:53:50,642 INFO L226 Difference]: Without dead ends: 150 [2023-02-14 13:53:50,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:53:50,643 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 655 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:50,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 186 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:53:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-14 13:53:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2023-02-14 13:53:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.554054054054054) internal successors, (115), 98 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2023-02-14 13:53:50,645 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 30 [2023-02-14 13:53:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:50,645 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2023-02-14 13:53:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2023-02-14 13:53:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 13:53:50,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:50,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:50,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 13:53:50,646 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -55260162, now seen corresponding path program 1 times [2023-02-14 13:53:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:50,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975997561] [2023-02-14 13:53:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:50,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975997561] [2023-02-14 13:53:50,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975997561] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:50,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:50,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:53:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569101532] [2023-02-14 13:53:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:50,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:53:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:53:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:50,681 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:50,689 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2023-02-14 13:53:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:53:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 13:53:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:50,690 INFO L225 Difference]: With dead ends: 125 [2023-02-14 13:53:50,690 INFO L226 Difference]: Without dead ends: 125 [2023-02-14 13:53:50,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:53:50,691 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:50,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 156 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-14 13:53:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2023-02-14 13:53:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2023-02-14 13:53:50,693 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 31 [2023-02-14 13:53:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:50,693 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2023-02-14 13:53:50,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2023-02-14 13:53:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 13:53:50,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:50,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:50,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 13:53:50,694 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045098, now seen corresponding path program 1 times [2023-02-14 13:53:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:50,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077379538] [2023-02-14 13:53:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077379538] [2023-02-14 13:53:50,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077379538] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:50,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:50,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:53:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105351759] [2023-02-14 13:53:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:53:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:53:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:50,748 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:50,815 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-02-14 13:53:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:50,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 13:53:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:50,816 INFO L225 Difference]: With dead ends: 103 [2023-02-14 13:53:50,816 INFO L226 Difference]: Without dead ends: 103 [2023-02-14 13:53:50,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:53:50,816 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 194 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:50,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 94 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-14 13:53:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2023-02-14 13:53:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.434782608695652) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-14 13:53:50,818 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2023-02-14 13:53:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:50,818 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-14 13:53:50,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-14 13:53:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 13:53:50,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:50,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:50,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 13:53:50,819 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045097, now seen corresponding path program 1 times [2023-02-14 13:53:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:50,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237433878] [2023-02-14 13:53:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:53:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:50,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237433878] [2023-02-14 13:53:50,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237433878] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:50,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546452743] [2023-02-14 13:53:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:50,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:50,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:50,903 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-14 13:53:50,923 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-14 13:53:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:51,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:53:51,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:51,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:53:51,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546452743] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:51,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:53:51,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-02-14 13:53:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464296462] [2023-02-14 13:53:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:51,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:53:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:53:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:51,125 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:51,148 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-02-14 13:53:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:53:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 13:53:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:51,149 INFO L225 Difference]: With dead ends: 90 [2023-02-14 13:53:51,149 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 13:53:51,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:53:51,150 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 80 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:51,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 13:53:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-14 13:53:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-14 13:53:51,152 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 32 [2023-02-14 13:53:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:51,152 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-14 13:53:51,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-14 13:53:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 13:53:51,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:51,152 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, 1, 1] [2023-02-14 13:53:51,175 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-14 13:53:51,357 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,SelfDestructingSolverStorable16 [2023-02-14 13:53:51,357 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1563834333, now seen corresponding path program 1 times [2023-02-14 13:53:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:51,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879975973] [2023-02-14 13:53:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:53:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879975973] [2023-02-14 13:53:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879975973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432739545] [2023-02-14 13:53:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:51,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:51,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:51,464 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-14 13:53:51,491 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-14 13:53:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:51,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:53:51,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:51,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:53:51,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432739545] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:51,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:53:51,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2023-02-14 13:53:51,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187075682] [2023-02-14 13:53:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:51,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:53:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:53:51,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:53:51,664 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:51,683 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-02-14 13:53:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 13:53:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:51,684 INFO L225 Difference]: With dead ends: 87 [2023-02-14 13:53:51,684 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 13:53:51,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:53:51,685 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 195 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:51,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 103 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 13:53:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-14 13:53:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 86 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-14 13:53:51,686 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 33 [2023-02-14 13:53:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:51,687 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-14 13:53:51,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-14 13:53:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-14 13:53:51,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:51,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:51,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-14 13:53:51,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 13:53:51,896 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225649, now seen corresponding path program 1 times [2023-02-14 13:53:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221188139] [2023-02-14 13:53:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221188139] [2023-02-14 13:53:51,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221188139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:51,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:51,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:53:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446525490] [2023-02-14 13:53:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:51,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:53:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:51,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:53:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:53:51,942 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:52,018 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-14 13:53:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:52,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-14 13:53:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:52,019 INFO L225 Difference]: With dead ends: 127 [2023-02-14 13:53:52,019 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 13:53:52,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:52,020 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 86 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:52,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 134 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 13:53:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2023-02-14 13:53:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.373134328358209) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-14 13:53:52,022 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 34 [2023-02-14 13:53:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:52,022 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-14 13:53:52,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-14 13:53:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-14 13:53:52,022 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:52,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:52,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-14 13:53:52,022 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225648, now seen corresponding path program 1 times [2023-02-14 13:53:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:52,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101685809] [2023-02-14 13:53:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:53:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:52,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101685809] [2023-02-14 13:53:52,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101685809] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:52,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:52,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:53:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631630696] [2023-02-14 13:53:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:52,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:53:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:53:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:53:52,103 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:52,166 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-14 13:53:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-14 13:53:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:52,167 INFO L225 Difference]: With dead ends: 85 [2023-02-14 13:53:52,167 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 13:53:52,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:52,167 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:52,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 106 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:53:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 13:53:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-14 13:53:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-14 13:53:52,169 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 34 [2023-02-14 13:53:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:52,169 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-14 13:53:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-14 13:53:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 13:53:52,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:52,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-14 13:53:52,170 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 393710610, now seen corresponding path program 1 times [2023-02-14 13:53:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065308908] [2023-02-14 13:53:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:53:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:52,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065308908] [2023-02-14 13:53:52,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065308908] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:53:52,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:53:52,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:53:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813091789] [2023-02-14 13:53:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:53:52,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:53:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:53:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:53:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:53:52,267 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:53:52,331 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-02-14 13:53:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:53:52,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-14 13:53:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:53:52,332 INFO L225 Difference]: With dead ends: 82 [2023-02-14 13:53:52,332 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 13:53:52,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:53:52,333 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 178 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:53:52,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 71 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:53:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 13:53:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-14 13:53:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-14 13:53:52,335 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 35 [2023-02-14 13:53:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:53:52,335 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-14 13:53:52,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:53:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-14 13:53:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 13:53:52,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:53:52,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:53:52,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-14 13:53:52,336 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:53:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:53:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash -522865965, now seen corresponding path program 1 times [2023-02-14 13:53:52,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:53:52,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458816965] [2023-02-14 13:53:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:53:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:53:53,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458816965] [2023-02-14 13:53:53,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458816965] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:53:53,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179657476] [2023-02-14 13:53:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:53:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:53:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:53:53,017 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-14 13:53:53,019 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-14 13:53:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:53:53,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-14 13:53:53,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:53:53,200 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-14 13:53:53,280 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:53:53,281 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-14 13:53:53,337 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-14 13:53:53,381 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 23 treesize of output 22 [2023-02-14 13:53:53,417 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:53:53,418 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-14 13:53:53,569 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-14 13:53:53,569 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 34 treesize of output 57 [2023-02-14 13:53:53,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:53,626 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-14 13:53:53,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:53,642 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:53,642 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 65 treesize of output 55 [2023-02-14 13:53:53,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:53,658 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-14 13:53:53,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:53,671 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:53,671 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 65 treesize of output 55 [2023-02-14 13:53:53,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:53,693 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:53:53,693 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 65 treesize of output 55 [2023-02-14 13:53:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:53:53,705 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-14 13:53:53,798 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-14 13:53:53,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:53:53,936 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 70 treesize of output 29 [2023-02-14 13:53:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:53:54,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:53:54,421 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 72 treesize of output 64 [2023-02-14 13:53:54,425 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 30 treesize of output 28 [2023-02-14 13:54:01,364 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:54:01,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:01,391 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 92 [2023-02-14 13:54:01,623 INFO L321 Elim1Store]: treesize reduction 152, result has 54.6 percent of original size [2023-02-14 13:54:01,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 957 treesize of output 1017 [2023-02-14 13:54:01,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:01,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 881 treesize of output 833 [2023-02-14 13:54:01,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:01,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 833 treesize of output 815 [2023-02-14 13:54:26,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:26,834 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 54 [2023-02-14 13:54:26,836 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:54:26,856 INFO L321 Elim1Store]: treesize reduction 19, result has 54.8 percent of original size [2023-02-14 13:54:26,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 216 [2023-02-14 13:54:26,867 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 93 treesize of output 85 [2023-02-14 13:54:26,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:26,876 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 191 treesize of output 155 [2023-02-14 13:55:46,403 WARN L233 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 383 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:55:46,930 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 13:55:46,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 47 [2023-02-14 13:55:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:55:46,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179657476] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:55:46,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:55:46,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 52 [2023-02-14 13:55:46,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796082440] [2023-02-14 13:55:46,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:55:46,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-14 13:55:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:55:46,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-14 13:55:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2502, Unknown=2, NotChecked=0, Total=2756 [2023-02-14 13:55:46,973 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 53 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:55:49,011 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2023-02-14 13:55:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 13:55:49,014 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-14 13:55:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:55:49,014 INFO L225 Difference]: With dead ends: 101 [2023-02-14 13:55:49,014 INFO L226 Difference]: Without dead ends: 101 [2023-02-14 13:55:49,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 87.9s TimeCoverageRelationStatistics Valid=656, Invalid=4034, Unknown=2, NotChecked=0, Total=4692 [2023-02-14 13:55:49,016 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 612 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:55:49,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 667 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 13:55:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-14 13:55:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2023-02-14 13:55:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-14 13:55:49,018 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2023-02-14 13:55:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:55:49,018 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-14 13:55:49,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:55:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-14 13:55:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 13:55:49,018 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:55:49,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:55:49,033 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-14 13:55:49,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-14 13:55:49,224 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:55:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:55:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash -522865964, now seen corresponding path program 1 times [2023-02-14 13:55:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:55:49,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403024384] [2023-02-14 13:55:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:55:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:55:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:55:50,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403024384] [2023-02-14 13:55:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403024384] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:55:50,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973716496] [2023-02-14 13:55:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:55:50,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:55:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:55:50,072 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-14 13:55:50,137 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-14 13:55:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:55:50,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-14 13:55:50,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:55:50,326 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-14 13:55:50,421 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:55:50,421 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-14 13:55:50,493 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-14 13:55:50,500 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-14 13:55:50,553 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 23 treesize of output 22 [2023-02-14 13:55:50,560 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 23 treesize of output 22 [2023-02-14 13:55:50,625 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:55:50,625 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-14 13:55:50,631 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-14 13:55:50,790 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 13:55:50,791 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 30 treesize of output 44 [2023-02-14 13:55:50,808 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:55:50,809 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-14 13:55:50,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,876 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:55:50,876 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-14 13:55:50,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,888 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:55:50,889 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 77 treesize of output 65 [2023-02-14 13:55:50,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,914 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:55:50,915 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 77 treesize of output 65 [2023-02-14 13:55:50,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,924 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:55:50,925 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-14 13:55:50,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,952 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:55:50,952 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 77 treesize of output 65 [2023-02-14 13:55:50,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:55:50,959 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:55:50,959 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-02-14 13:55:51,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:55:51,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:51,159 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-14 13:55:51,166 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-14 13:55:51,169 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-14 13:55:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:55:51,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:55:51,372 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1894 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1894))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) 8))) (forall ((v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1894 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1894)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1895))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse3 (+ (select (select .cse1 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-02-14 13:55:51,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:51,806 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 250 treesize of output 254 [2023-02-14 13:55:53,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:53,543 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 99 [2023-02-14 13:55:53,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:53,552 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 69 [2023-02-14 13:55:53,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:53,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 335 [2023-02-14 13:55:54,098 INFO L321 Elim1Store]: treesize reduction 432, result has 46.0 percent of original size [2023-02-14 13:55:54,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 8024 treesize of output 7339 [2023-02-14 13:55:54,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:54,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 6986 treesize of output 6550 [2023-02-14 13:55:54,371 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 3954 treesize of output 3484 [2023-02-14 13:55:54,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:55:54,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5977 treesize of output 5367 [2023-02-14 13:55:54,617 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 5279 treesize of output 4877 [2023-02-14 13:56:17,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:17,267 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 97 [2023-02-14 13:56:17,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:17,278 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 67 [2023-02-14 13:56:17,369 INFO L321 Elim1Store]: treesize reduction 86, result has 53.8 percent of original size [2023-02-14 13:56:17,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1041 treesize of output 938 [2023-02-14 13:56:17,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:56:17,411 INFO L321 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2023-02-14 13:56:17,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 956 treesize of output 926 [2023-02-14 13:56:17,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:17,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 892 treesize of output 850 [2023-02-14 13:56:17,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:17,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 842 treesize of output 832 [2023-02-14 13:56:17,512 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 125 treesize of output 111 [2023-02-14 13:56:18,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:18,366 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 99 [2023-02-14 13:56:18,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:18,378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 69 [2023-02-14 13:56:18,398 INFO L321 Elim1Store]: treesize reduction 3, result has 76.9 percent of original size [2023-02-14 13:56:18,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2023-02-14 13:56:18,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:56:18,666 INFO L321 Elim1Store]: treesize reduction 203, result has 48.2 percent of original size [2023-02-14 13:56:18,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 1476 treesize of output 1426 [2023-02-14 13:56:18,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:18,712 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 1166 treesize of output 1066 [2023-02-14 13:56:18,734 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 1132 treesize of output 1008 [2023-02-14 13:56:18,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:18,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1063 treesize of output 1021 [2023-02-14 13:56:18,816 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 636 treesize of output 564 [2023-02-14 13:56:22,005 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:56:22,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2023-02-14 13:56:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:22,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973716496] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:22,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:22,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 45 [2023-02-14 13:56:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448304310] [2023-02-14 13:56:22,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:22,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:56:22,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:56:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1761, Unknown=5, NotChecked=86, Total=2070 [2023-02-14 13:56:22,046 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:25,076 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-02-14 13:56:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 13:56:25,076 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-14 13:56:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:25,077 INFO L225 Difference]: With dead ends: 99 [2023-02-14 13:56:25,077 INFO L226 Difference]: Without dead ends: 99 [2023-02-14 13:56:25,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=592, Invalid=3189, Unknown=5, NotChecked=120, Total=3906 [2023-02-14 13:56:25,078 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 535 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:25,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 442 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1156 Invalid, 0 Unknown, 89 Unchecked, 1.8s Time] [2023-02-14 13:56:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-14 13:56:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2023-02-14 13:56:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-14 13:56:25,080 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 38 [2023-02-14 13:56:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:25,080 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-14 13:56:25,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-14 13:56:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 13:56:25,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:25,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:25,103 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-14 13:56:25,280 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,SelfDestructingSolverStorable22 [2023-02-14 13:56:25,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:56:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1695206362, now seen corresponding path program 1 times [2023-02-14 13:56:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329317652] [2023-02-14 13:56:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:56:25,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:25,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329317652] [2023-02-14 13:56:25,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329317652] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:25,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90833559] [2023-02-14 13:56:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:25,412 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-14 13:56:25,414 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-14 13:56:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:25,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 13:56:25,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:25,590 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-14 13:56:25,593 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-14 13:56:25,614 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-14 13:56:25,625 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-14 13:56:25,634 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-14 13:56:25,650 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:25,650 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-14 13:56:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:25,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:25,688 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-14 13:56:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:56:25,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90833559] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:25,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:25,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 11 [2023-02-14 13:56:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525121579] [2023-02-14 13:56:25,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:25,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:56:25,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:25,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:56:25,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:56:25,773 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:25,879 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-14 13:56:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:56:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-14 13:56:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:25,880 INFO L225 Difference]: With dead ends: 100 [2023-02-14 13:56:25,880 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 13:56:25,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:56:25,880 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 339 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:25,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 90 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 13:56:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 69. [2023-02-14 13:56:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-02-14 13:56:25,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 40 [2023-02-14 13:56:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:25,882 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-02-14 13:56:25,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-02-14 13:56:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 13:56:25,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:25,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:25,903 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-14 13:56:26,083 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,SelfDestructingSolverStorable23 [2023-02-14 13:56:26,083 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:56:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086933, now seen corresponding path program 1 times [2023-02-14 13:56:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498141417] [2023-02-14 13:56:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:26,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498141417] [2023-02-14 13:56:26,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498141417] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:26,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475676094] [2023-02-14 13:56:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:26,540 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-14 13:56:26,542 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-14 13:56:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:26,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 13:56:26,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:26,725 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-14 13:56:26,830 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:56:26,831 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-14 13:56:26,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:26,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 13:56:26,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:26,877 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-14 13:56:26,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:26,886 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-14 13:56:27,261 INFO L321 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-02-14 13:56:27,261 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 91 [2023-02-14 13:56:27,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:27,489 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-14 13:56:27,490 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 119 [2023-02-14 13:56:27,568 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 12 treesize of output 8 [2023-02-14 13:56:27,720 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 13:56:27,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:27,798 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 36 treesize of output 36 [2023-02-14 13:56:27,904 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-14 13:56:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:27,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:56:27,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475676094] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:27,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:56:27,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [16] total 33 [2023-02-14 13:56:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125373782] [2023-02-14 13:56:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:27,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:56:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:56:27,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 13:56:27,971 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:29,290 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2023-02-14 13:56:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 13:56:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-14 13:56:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:29,296 INFO L225 Difference]: With dead ends: 119 [2023-02-14 13:56:29,296 INFO L226 Difference]: Without dead ends: 119 [2023-02-14 13:56:29,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2023-02-14 13:56:29,300 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 409 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:29,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 297 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 13:56:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-14 13:56:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2023-02-14 13:56:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-02-14 13:56:29,302 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 42 [2023-02-14 13:56:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:29,303 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-02-14 13:56:29,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-02-14 13:56:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 13:56:29,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:29,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:29,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-14 13:56:29,509 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-14 13:56:29,509 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:56:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086934, now seen corresponding path program 1 times [2023-02-14 13:56:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261834122] [2023-02-14 13:56:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:30,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261834122] [2023-02-14 13:56:30,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261834122] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:30,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508744842] [2023-02-14 13:56:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:30,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:30,140 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-14 13:56:30,141 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-14 13:56:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:30,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-14 13:56:30,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:30,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,539 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-14 13:56:30,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,545 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-14 13:56:30,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,556 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-14 13:56:30,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,563 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-14 13:56:30,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,576 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-14 13:56:30,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 13:56:30,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:30,858 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 45 treesize of output 44 [2023-02-14 13:56:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-14 13:56:30,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,908 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-14 13:56:30,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,911 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-14 13:56:30,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,922 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-14 13:56:30,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:30,927 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-14 13:56:30,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-14 13:56:30,981 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-14 13:56:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:30,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:31,082 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2411) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2412 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-14 13:56:31,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:31,198 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 52 treesize of output 56 [2023-02-14 13:56:31,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (and (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2411) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2408) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 1))) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_35) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_prenex_34) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-14 13:56:31,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (and (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2411) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_35) |c_ULTIMATE.start_node_create_#res#1.base| v_prenex_34) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2408) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 1))))) is different from false [2023-02-14 13:56:31,536 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (and (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2408) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 1))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2407) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2411) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_35) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_34) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-14 13:56:31,548 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2406) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2405) |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) v_prenex_35) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_34) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2405))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (= (select (select (store (store .cse0 .cse1 v_ArrVal_2407) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2411) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)))) (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2406))) (< (select (select (store (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2405) |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) v_ArrVal_2408) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse2 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 1))))) is different from false [2023-02-14 13:56:31,581 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 1320 treesize of output 1156 [2023-02-14 13:56:31,617 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 3446 treesize of output 3266 [2023-02-14 13:56:31,674 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 3073 treesize of output 3025 [2023-02-14 13:56:31,718 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 3025 treesize of output 3001 [2023-02-14 13:56:31,732 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 3001 treesize of output 2945 [2023-02-14 13:56:31,747 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 2945 treesize of output 2917 [2023-02-14 13:56:31,762 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 2917 treesize of output 2857 [2023-02-14 13:56:31,776 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 2857 treesize of output 2833 [2023-02-14 13:56:31,790 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 2833 treesize of output 2737 [2023-02-14 13:56:31,804 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 2737 treesize of output 2701 [2023-02-14 13:56:31,819 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 2701 treesize of output 2669 [2023-02-14 13:56:31,833 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 2669 treesize of output 2645 [2023-02-14 13:56:31,848 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 2645 treesize of output 2603 [2023-02-14 13:56:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:32,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508744842] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:32,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:32,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 46 [2023-02-14 13:56:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40798487] [2023-02-14 13:56:32,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:32,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 13:56:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 13:56:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1570, Unknown=16, NotChecked=420, Total=2162 [2023-02-14 13:56:32,469 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:34,155 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2023-02-14 13:56:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 13:56:34,156 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-14 13:56:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:34,156 INFO L225 Difference]: With dead ends: 109 [2023-02-14 13:56:34,156 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 13:56:34,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=588, Invalid=2722, Unknown=16, NotChecked=580, Total=3906 [2023-02-14 13:56:34,158 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 800 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 500 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:34,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 660 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 984 Invalid, 0 Unknown, 500 Unchecked, 0.6s Time] [2023-02-14 13:56:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 13:56:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 76. [2023-02-14 13:56:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-02-14 13:56:34,159 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 42 [2023-02-14 13:56:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:34,159 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-02-14 13:56:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-02-14 13:56:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:56:34,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:34,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:34,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:34,360 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-14 13:56:34,360 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-02-14 13:56:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1994570883, now seen corresponding path program 1 times [2023-02-14 13:56:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:34,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652129452] [2023-02-14 13:56:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652129452] [2023-02-14 13:56:34,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652129452] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725187693] [2023-02-14 13:56:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:34,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:34,961 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-14 13:56:34,963 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-14 13:56:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:35,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 13:56:35,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:35,162 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-14 13:56:35,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,181 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-14 13:56:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,202 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-14 13:56:35,206 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-14 13:56:35,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,328 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-14 13:56:35,340 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 13:56:35,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-14 13:56:35,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,381 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 33 treesize of output 31 [2023-02-14 13:56:35,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,396 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 33 treesize of output 31 [2023-02-14 13:56:35,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,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 33 treesize of output 31 [2023-02-14 13:56:35,665 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:35,665 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 37 treesize of output 36 [2023-02-14 13:56:35,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,715 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 33 treesize of output 31 [2023-02-14 13:56:35,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:35,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-14 13:56:35,797 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-02-14 13:56:35,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-02-14 13:56:35,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:35,808 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 13 treesize of output 17 [2023-02-14 13:56:35,936 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-14 13:56:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:35,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:37,959 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (let ((.cse0 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (or (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (<= (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 12) (select |c_#length| |ULTIMATE.start_dll_insert_~last~0#1.base|))) (not (<= 0 .cse0))))) is different from false [2023-02-14 13:56:52,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:56:52,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76842 treesize of output 72100 [2023-02-14 13:56:53,204 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 74134 treesize of output 72958 [2023-02-14 13:56:54,943 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 77310 treesize of output 74446 [2023-02-14 13:56:57,363 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 70350 treesize of output 68354 [2023-02-14 13:56:59,058 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 34498 treesize of output 34210