./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 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_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-?-7e1ff0e [2023-02-15 01:35:55,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:35:55,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:35:55,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:35:55,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:35:55,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:35:55,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:35:55,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:35:55,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:35:55,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:35:55,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:35:55,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:35:55,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:35:55,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:35:55,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:35:55,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:35:55,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:35:55,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:35:55,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:35:55,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:35:55,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:35:55,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:35:55,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:35:55,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:35:55,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:35:55,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:35:55,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:35:55,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:35:55,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:35:55,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:35:55,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:35:55,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:35:55,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:35:55,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:35:55,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:35:55,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:35:55,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:35:55,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:35:55,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:35:55,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:35:55,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:35:55,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:35:55,193 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:35:55,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:35:55,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:35:55,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:35:55,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:35:55,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:35:55,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:35:55,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:35:55,197 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:35:55,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:35:55,197 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:35:55,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:35:55,198 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:35:55,199 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:35:55,199 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:35:55,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:35:55,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:35:55,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:35:55,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:35:55,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:35:55,200 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:35:55,201 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-15 01:35:55,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:35:55,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:35:55,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:35:55,431 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:35:55,431 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:35:55,432 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-15 01:35:56,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:35:56,650 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:35:56,650 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-02-15 01:35:56,658 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf99583c/440f54e41afb43e4966d794582098db8/FLAG0a662cb3c [2023-02-15 01:35:56,671 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf99583c/440f54e41afb43e4966d794582098db8 [2023-02-15 01:35:56,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:35:56,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:35:56,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:35:56,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:35:56,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:35:56,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:35:56" (1/1) ... [2023-02-15 01:35:56,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6aa23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:56, skipping insertion in model container [2023-02-15 01:35:56,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:35:56" (1/1) ... [2023-02-15 01:35:56,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:35:56,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:35:56,901 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-15 01:35:56,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:35:56,916 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:35:56,983 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-15 01:35:56,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:35:57,003 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:35:57,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57 WrapperNode [2023-02-15 01:35:57,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:35:57,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:35:57,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:35:57,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:35:57,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,056 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-02-15 01:35:57,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:35:57,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:35:57,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:35:57,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:35:57,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:35:57,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:35:57,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:35:57,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:35:57,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (1/1) ... [2023-02-15 01:35:57,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:35:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:57,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:35:57,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:35:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 01:35:57,167 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 01:35:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:35:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:35:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:35:57,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:35:57,315 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:35:57,316 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:35:57,364 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 01:35:57,703 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:35:57,714 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:35:57,715 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 01:35:57,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:35:57 BoogieIcfgContainer [2023-02-15 01:35:57,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:35:57,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:35:57,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:35:57,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:35:57,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:35:56" (1/3) ... [2023-02-15 01:35:57,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b03e686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:35:57, skipping insertion in model container [2023-02-15 01:35:57,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:35:57" (2/3) ... [2023-02-15 01:35:57,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b03e686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:35:57, skipping insertion in model container [2023-02-15 01:35:57,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:35:57" (3/3) ... [2023-02-15 01:35:57,725 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-02-15 01:35:57,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:35:57,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-02-15 01:35:57,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:35:57,774 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;@68d9bf30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:35:57,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-02-15 01:35:57,778 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-15 01:35:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:35:57,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:57,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:35:57,783 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-15 01:35:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2023-02-15 01:35:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:57,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131180672] [2023-02-15 01:35:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131180672] [2023-02-15 01:35:57,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131180672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:57,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:57,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:35:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996924031] [2023-02-15 01:35:57,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:35:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:35:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:35:58,020 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-15 01:35:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:58,222 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2023-02-15 01:35:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:35:58,224 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-15 01:35:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:58,230 INFO L225 Difference]: With dead ends: 207 [2023-02-15 01:35:58,232 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 01:35:58,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:35:58,239 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-15 01:35:58,240 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-15 01:35:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 01:35:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 108. [2023-02-15 01:35:58,271 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-15 01:35:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-15 01:35:58,273 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 5 [2023-02-15 01:35:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:58,274 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-15 01:35:58,274 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-15 01:35:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-15 01:35:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:35:58,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:58,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:35:58,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:35:58,275 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-15 01:35:58,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2023-02-15 01:35:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:58,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509966575] [2023-02-15 01:35:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:58,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:58,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509966575] [2023-02-15 01:35:58,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509966575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:58,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:35:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699965532] [2023-02-15 01:35:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:58,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:35:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:58,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:35:58,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:35:58,374 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-15 01:35:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:58,492 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2023-02-15 01:35:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:35:58,492 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-15 01:35:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:58,493 INFO L225 Difference]: With dead ends: 199 [2023-02-15 01:35:58,493 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 01:35:58,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:35:58,495 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-15 01:35:58,495 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-15 01:35:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 01:35:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 105. [2023-02-15 01:35:58,500 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-15 01:35:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2023-02-15 01:35:58,501 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 5 [2023-02-15 01:35:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:58,501 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2023-02-15 01:35:58,502 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-15 01:35:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2023-02-15 01:35:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:35:58,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:58,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:58,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:35:58,503 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-15 01:35:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2023-02-15 01:35:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:58,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558423606] [2023-02-15 01:35:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:58,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:58,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558423606] [2023-02-15 01:35:58,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558423606] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:58,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:58,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:35:58,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082239566] [2023-02-15 01:35:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:58,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:35:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:35:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:35:58,587 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-15 01:35:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:58,598 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2023-02-15 01:35:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:35:58,600 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-15 01:35:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:58,602 INFO L225 Difference]: With dead ends: 115 [2023-02-15 01:35:58,602 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 01:35:58,603 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-15 01:35:58,604 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-15 01:35:58,604 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-15 01:35:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 01:35:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2023-02-15 01:35:58,610 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-15 01:35:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-15 01:35:58,613 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 7 [2023-02-15 01:35:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:58,614 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-15 01:35:58,614 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-15 01:35:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-15 01:35:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:35:58,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:58,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:58,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:35:58,616 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-15 01:35:58,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2023-02-15 01:35:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637514494] [2023-02-15 01:35:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:35:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:58,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637514494] [2023-02-15 01:35:58,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637514494] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:35:58,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:35:58,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:35:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707954320] [2023-02-15 01:35:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:35:58,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:35:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:35:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:35:58,706 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-15 01:35:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:58,731 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2023-02-15 01:35:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:35:58,732 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-15 01:35:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:58,733 INFO L225 Difference]: With dead ends: 112 [2023-02-15 01:35:58,733 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 01:35:58,733 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-15 01:35:58,734 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-15 01:35:58,734 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-15 01:35:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 01:35:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-15 01:35:58,737 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-15 01:35:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-15 01:35:58,738 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 9 [2023-02-15 01:35:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:58,738 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-15 01:35:58,739 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-15 01:35:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-15 01:35:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:35:58,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:58,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:35:58,740 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-15 01:35:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2023-02-15 01:35:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794768076] [2023-02-15 01:35:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:58,821 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-15 01:35:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:58,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794768076] [2023-02-15 01:35:58,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794768076] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:58,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906766497] [2023-02-15 01:35:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:58,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:58,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:58,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:35:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:58,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:35:58,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:58,946 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-15 01:35:58,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:58,972 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-15 01:35:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906766497] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:35:58,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:35:58,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 01:35:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878089026] [2023-02-15 01:35:58,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:35:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:35:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:35:58,979 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-15 01:35:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:58,993 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2023-02-15 01:35:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:35:58,998 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-15 01:35:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:58,998 INFO L225 Difference]: With dead ends: 113 [2023-02-15 01:35:58,998 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 01:35:58,999 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-15 01:35:59,002 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-15 01:35:59,003 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-15 01:35:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 01:35:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-02-15 01:35:59,020 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-15 01:35:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2023-02-15 01:35:59,022 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 14 [2023-02-15 01:35:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:59,023 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2023-02-15 01:35:59,023 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-15 01:35:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2023-02-15 01:35:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:35:59,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:59,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:59,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:35:59,231 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-15 01:35:59,231 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-15 01:35:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2023-02-15 01:35:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248368998] [2023-02-15 01:35:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:35:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:59,350 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-15 01:35:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:35:59,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248368998] [2023-02-15 01:35:59,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248368998] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:35:59,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114941603] [2023-02-15 01:35:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:59,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:35:59,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:35:59,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:35:59,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:35:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:35:59,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:35:59,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:35:59,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:35:59,506 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:35:59,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:35:59,518 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-15 01:35:59,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:35:59,645 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-15 01:35:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114941603] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:35:59,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:35:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-15 01:35:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358757539] [2023-02-15 01:35:59,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:35:59,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:35:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:35:59,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:35:59,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:35:59,649 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-15 01:35:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:35:59,772 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2023-02-15 01:35:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:35:59,773 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-15 01:35:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:35:59,774 INFO L225 Difference]: With dead ends: 124 [2023-02-15 01:35:59,774 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 01:35:59,776 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-15 01:35:59,778 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-15 01:35:59,778 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-15 01:35:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 01:35:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2023-02-15 01:35:59,786 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-15 01:35:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2023-02-15 01:35:59,787 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 16 [2023-02-15 01:35:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:35:59,787 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2023-02-15 01:35:59,788 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-15 01:35:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2023-02-15 01:35:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:35:59,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:35:59,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 01:35:59,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 01:35:59,995 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-15 01:35:59,995 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-15 01:35:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:35:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2023-02-15 01:35:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:35:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065485617] [2023-02-15 01:35:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:35:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:00,159 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-15 01:36:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:00,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065485617] [2023-02-15 01:36:00,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065485617] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:00,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954467113] [2023-02-15 01:36:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:00,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:00,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:36:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:00,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 01:36:00,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:00,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:36:00,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:36:00,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:00,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-15 01:36:00,336 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:36:00,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:36:00,364 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-15 01:36:00,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:00,542 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-15 01:36:00,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954467113] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:36:00,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:36:00,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-02-15 01:36:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949487356] [2023-02-15 01:36:00,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:00,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:36:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:36:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:36:00,546 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-15 01:36:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:00,687 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-15 01:36:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:00,687 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-15 01:36:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:00,689 INFO L225 Difference]: With dead ends: 123 [2023-02-15 01:36:00,689 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 01:36:00,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:36:00,690 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-15 01:36:00,690 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-15 01:36:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 01:36:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2023-02-15 01:36:00,693 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-15 01:36:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-15 01:36:00,693 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 16 [2023-02-15 01:36:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:00,694 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-15 01:36:00,694 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-15 01:36:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-15 01:36:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:36:00,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:00,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:00,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:00,900 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-15 01:36:00,900 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-15 01:36:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2023-02-15 01:36:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557397989] [2023-02-15 01:36:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:00,946 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-15 01:36:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:00,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557397989] [2023-02-15 01:36:00,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557397989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:00,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272786852] [2023-02-15 01:36:00,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:36:00,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:00,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:00,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:00,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:36:01,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 01:36:01,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:36:01,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:36:01,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:01,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:36:01,033 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-15 01:36:01,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:36:01,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272786852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:01,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:36:01,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-02-15 01:36:01,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278044595] [2023-02-15 01:36:01,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:01,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:36:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:01,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:36:01,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:36:01,035 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-15 01:36:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:01,080 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2023-02-15 01:36:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:36:01,081 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-15 01:36:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:01,082 INFO L225 Difference]: With dead ends: 120 [2023-02-15 01:36:01,082 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 01:36:01,082 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-15 01:36:01,083 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:01,083 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.0s Time] [2023-02-15 01:36:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 01:36:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2023-02-15 01:36:01,085 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-15 01:36:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-15 01:36:01,086 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 21 [2023-02-15 01:36:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:01,086 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-15 01:36:01,086 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-15 01:36:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-15 01:36:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:36:01,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:01,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:01,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:01,292 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-15 01:36:01,293 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-15 01:36:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2023-02-15 01:36:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:01,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990643217] [2023-02-15 01:36:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:01,344 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-15 01:36:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:01,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990643217] [2023-02-15 01:36:01,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990643217] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:01,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768777745] [2023-02-15 01:36:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:01,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:01,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:01,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:36:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:01,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:36:01,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:01,453 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-15 01:36:01,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:01,468 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-15 01:36:01,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768777745] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:36:01,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:36:01,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-02-15 01:36:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51127630] [2023-02-15 01:36:01,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:01,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:36:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:36:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:36:01,470 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-15 01:36:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:01,494 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-15 01:36:01,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:36:01,495 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-15 01:36:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:01,496 INFO L225 Difference]: With dead ends: 108 [2023-02-15 01:36:01,496 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 01:36:01,496 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-15 01:36:01,497 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-15 01:36:01,498 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-15 01:36:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 01:36:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-02-15 01:36:01,500 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-15 01:36:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2023-02-15 01:36:01,500 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 21 [2023-02-15 01:36:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:01,500 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2023-02-15 01:36:01,500 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-15 01:36:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2023-02-15 01:36:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:36:01,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:01,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:36:01,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:01,706 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-15 01:36:01,707 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-15 01:36:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2023-02-15 01:36:01,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:01,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475407319] [2023-02-15 01:36:01,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:01,789 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-15 01:36:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475407319] [2023-02-15 01:36:01,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475407319] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:01,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:01,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:36:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220474494] [2023-02-15 01:36:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:01,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:36:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:36:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:36:01,790 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-15 01:36:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:01,828 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-15 01:36:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:36:01,828 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-15 01:36:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:01,828 INFO L225 Difference]: With dead ends: 105 [2023-02-15 01:36:01,828 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 01:36:01,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:36:01,829 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-15 01:36:01,830 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-15 01:36:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 01:36:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-02-15 01:36:01,831 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-15 01:36:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2023-02-15 01:36:01,831 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 22 [2023-02-15 01:36:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:01,832 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2023-02-15 01:36:01,832 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-15 01:36:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2023-02-15 01:36:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 01:36:01,833 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:01,833 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-15 01:36:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:36:01,833 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-15 01:36:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2023-02-15 01:36:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:01,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182504286] [2023-02-15 01:36:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:02,086 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-15 01:36:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182504286] [2023-02-15 01:36:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182504286] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185092125] [2023-02-15 01:36:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:02,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:02,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:02,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:02,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:36:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:02,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:36:02,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:02,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-15 01:36:02,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:02,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:36:02,223 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:36:02,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:36:02,245 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:36:02,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:36:02,257 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-15 01:36:02,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:02,320 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-15 01:36:02,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185092125] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:36:02,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:36:02,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2023-02-15 01:36:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081774591] [2023-02-15 01:36:02,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:36:02,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:36:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:36:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:36:02,323 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-15 01:36:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:02,403 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-02-15 01:36:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:02,404 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-15 01:36:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:02,405 INFO L225 Difference]: With dead ends: 110 [2023-02-15 01:36:02,405 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 01:36:02,405 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-15 01:36:02,405 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-15 01:36:02,406 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-15 01:36:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 01:36:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2023-02-15 01:36:02,407 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-15 01:36:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-02-15 01:36:02,407 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 27 [2023-02-15 01:36:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:02,408 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-02-15 01:36:02,408 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-15 01:36:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-02-15 01:36:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 01:36:02,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:02,409 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-15 01:36:02,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 01:36:02,613 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-15 01:36:02,613 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-15 01:36:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2023-02-15 01:36:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:02,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672435485] [2023-02-15 01:36:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:02,858 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-15 01:36:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672435485] [2023-02-15 01:36:02,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672435485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196646636] [2023-02-15 01:36:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:02,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:36:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:02,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 01:36:02,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:02,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:36:02,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:02,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:36:03,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:03,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:36:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:03,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:36:03,077 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-15 01:36:03,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:36:03,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196646636] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:03,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:36:03,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-02-15 01:36:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36929277] [2023-02-15 01:36:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:36:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:36:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:36:03,079 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-15 01:36:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:03,131 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-02-15 01:36:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:03,131 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-15 01:36:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:03,132 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:36:03,132 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:36:03,132 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-15 01:36:03,132 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-15 01:36:03,133 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-15 01:36:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:36:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 01:36:03,134 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-15 01:36:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-02-15 01:36:03,134 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 27 [2023-02-15 01:36:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:03,135 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-02-15 01:36:03,135 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-15 01:36:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-02-15 01:36:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:36:03,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:03,136 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-15 01:36:03,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:03,343 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-15 01:36:03,343 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-15 01:36:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708524, now seen corresponding path program 1 times [2023-02-15 01:36:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052273605] [2023-02-15 01:36:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:03,570 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-15 01:36:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052273605] [2023-02-15 01:36:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052273605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:03,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:03,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:36:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864783491] [2023-02-15 01:36:03,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:03,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:36:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:36:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:36:03,573 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-15 01:36:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:03,805 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2023-02-15 01:36:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:36:03,806 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-15 01:36:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:03,807 INFO L225 Difference]: With dead ends: 161 [2023-02-15 01:36:03,808 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 01:36:03,808 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-15 01:36:03,808 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 582 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 01:36:03,808 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-15 01:36:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 01:36:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 99. [2023-02-15 01:36:03,811 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-15 01:36:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2023-02-15 01:36:03,811 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 30 [2023-02-15 01:36:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:03,811 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2023-02-15 01:36:03,811 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-15 01:36:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2023-02-15 01:36:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:36:03,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:03,812 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-15 01:36:03,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:36:03,812 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-15 01:36:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708523, now seen corresponding path program 1 times [2023-02-15 01:36:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:03,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528750664] [2023-02-15 01:36:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:04,138 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-15 01:36:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:04,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528750664] [2023-02-15 01:36:04,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528750664] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:04,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:04,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 01:36:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527287007] [2023-02-15 01:36:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:04,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:36:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:36:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:36:04,141 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-15 01:36:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:04,393 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-15 01:36:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:36:04,393 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-15 01:36:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:04,394 INFO L225 Difference]: With dead ends: 150 [2023-02-15 01:36:04,394 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 01:36:04,394 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-15 01:36:04,395 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-15 01:36:04,395 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-15 01:36:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 01:36:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2023-02-15 01:36:04,396 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-15 01:36:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2023-02-15 01:36:04,396 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 30 [2023-02-15 01:36:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:04,397 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2023-02-15 01:36:04,397 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-15 01:36:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2023-02-15 01:36:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:36:04,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:04,397 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-15 01:36:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 01:36:04,397 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-15 01:36:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -55260162, now seen corresponding path program 1 times [2023-02-15 01:36:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:04,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007069832] [2023-02-15 01:36:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:04,441 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-15 01:36:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:04,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007069832] [2023-02-15 01:36:04,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007069832] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:04,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:04,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:36:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223370842] [2023-02-15 01:36:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:04,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:36:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:36:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:36:04,443 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-15 01:36:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:04,450 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2023-02-15 01:36:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:36:04,451 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-15 01:36:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:04,452 INFO L225 Difference]: With dead ends: 125 [2023-02-15 01:36:04,452 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 01:36:04,453 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-15 01:36:04,453 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-15 01:36:04,454 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-15 01:36:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 01:36:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2023-02-15 01:36:04,455 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-15 01:36:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2023-02-15 01:36:04,455 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 31 [2023-02-15 01:36:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:04,456 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2023-02-15 01:36:04,456 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-15 01:36:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2023-02-15 01:36:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:36:04,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:04,458 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-15 01:36:04,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:36:04,458 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-15 01:36:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045098, now seen corresponding path program 1 times [2023-02-15 01:36:04,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:04,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259997905] [2023-02-15 01:36:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:04,512 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-15 01:36:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259997905] [2023-02-15 01:36:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259997905] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:04,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:36:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667967523] [2023-02-15 01:36:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:04,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:36:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:04,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:36:04,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:36:04,515 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-15 01:36:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:04,571 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-02-15 01:36:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:04,572 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-15 01:36:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:04,572 INFO L225 Difference]: With dead ends: 103 [2023-02-15 01:36:04,572 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 01:36:04,573 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-15 01:36:04,573 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:36:04,573 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.0s Time] [2023-02-15 01:36:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 01:36:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2023-02-15 01:36:04,575 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-15 01:36:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-15 01:36:04,575 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2023-02-15 01:36:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:04,575 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-15 01:36:04,575 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-15 01:36:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-15 01:36:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:36:04,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:04,576 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-15 01:36:04,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:36:04,576 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-15 01:36:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045097, now seen corresponding path program 1 times [2023-02-15 01:36:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:04,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101462176] [2023-02-15 01:36:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:04,665 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-15 01:36:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101462176] [2023-02-15 01:36:04,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101462176] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440176891] [2023-02-15 01:36:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:04,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:04,667 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:04,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:36:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:04,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:36:04,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:04,834 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-15 01:36:04,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:36:04,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440176891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:04,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:36:04,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-02-15 01:36:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079139344] [2023-02-15 01:36:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:04,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:36:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:04,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:36:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:36:04,836 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-15 01:36:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:04,846 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-02-15 01:36:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:36:04,846 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-15 01:36:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:04,847 INFO L225 Difference]: With dead ends: 90 [2023-02-15 01:36:04,847 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 01:36:04,847 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-15 01:36:04,847 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-15 01:36:04,847 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-15 01:36:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 01:36:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-15 01:36:04,848 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-15 01:36:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 01:36:04,849 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 32 [2023-02-15 01:36:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:04,849 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 01:36:04,849 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-15 01:36:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 01:36:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:36:04,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:04,849 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-15 01:36:04,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:05,061 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-15 01:36:05,061 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-15 01:36:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1563834333, now seen corresponding path program 1 times [2023-02-15 01:36:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:05,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5265556] [2023-02-15 01:36:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,197 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-15 01:36:05,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:05,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5265556] [2023-02-15 01:36:05,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5265556] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994029378] [2023-02-15 01:36:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:05,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:05,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:05,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:05,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:36:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:36:05,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:05,384 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-15 01:36:05,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:36:05,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994029378] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:05,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:36:05,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2023-02-15 01:36:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658800589] [2023-02-15 01:36:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:36:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:36:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:36:05,386 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-15 01:36:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:05,400 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-02-15 01:36:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:05,400 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-15 01:36:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:05,400 INFO L225 Difference]: With dead ends: 87 [2023-02-15 01:36:05,401 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 01:36:05,401 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-15 01:36:05,401 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-15 01:36:05,401 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-15 01:36:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 01:36:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 01:36:05,402 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-15 01:36:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-15 01:36:05,403 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 33 [2023-02-15 01:36:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:05,403 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-15 01:36:05,403 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-15 01:36:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-15 01:36:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 01:36:05,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:05,403 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-15 01:36:05,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:36:05,607 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-15 01:36:05,608 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-15 01:36:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225649, now seen corresponding path program 1 times [2023-02-15 01:36:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630239253] [2023-02-15 01:36:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,655 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-15 01:36:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630239253] [2023-02-15 01:36:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630239253] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:05,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:36:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807863591] [2023-02-15 01:36:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:05,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:36:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:36:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:36:05,656 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-15 01:36:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:05,728 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-15 01:36:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:05,729 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-15 01:36:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:05,729 INFO L225 Difference]: With dead ends: 127 [2023-02-15 01:36:05,729 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 01:36:05,729 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-15 01:36:05,730 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-15 01:36:05,730 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-15 01:36:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 01:36:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2023-02-15 01:36:05,731 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-15 01:36:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-15 01:36:05,731 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 34 [2023-02-15 01:36:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:05,731 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-15 01:36:05,732 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-15 01:36:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-15 01:36:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 01:36:05,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:05,732 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-15 01:36:05,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 01:36:05,732 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-15 01:36:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225648, now seen corresponding path program 1 times [2023-02-15 01:36:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:05,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780503110] [2023-02-15 01:36:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,822 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-15 01:36:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:05,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780503110] [2023-02-15 01:36:05,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780503110] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:05,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:05,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:36:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705819207] [2023-02-15 01:36:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:05,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:36:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:36:05,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:36:05,823 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-15 01:36:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:05,885 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-15 01:36:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:05,886 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-15 01:36:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:05,886 INFO L225 Difference]: With dead ends: 85 [2023-02-15 01:36:05,886 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 01:36:05,886 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-15 01:36:05,887 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-15 01:36:05,887 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-15 01:36:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 01:36:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 01:36:05,888 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-15 01:36:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-15 01:36:05,888 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 34 [2023-02-15 01:36:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:05,889 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-15 01:36:05,889 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-15 01:36:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-15 01:36:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 01:36:05,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:05,889 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-15 01:36:05,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 01:36:05,889 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-15 01:36:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 393710610, now seen corresponding path program 1 times [2023-02-15 01:36:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:05,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131922365] [2023-02-15 01:36:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:05,995 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-15 01:36:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131922365] [2023-02-15 01:36:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131922365] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:36:05,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:36:05,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:36:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062072910] [2023-02-15 01:36:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:36:05,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:36:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:36:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:36:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:36:05,996 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-15 01:36:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:36:06,059 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-02-15 01:36:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:36:06,059 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-15 01:36:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:36:06,060 INFO L225 Difference]: With dead ends: 82 [2023-02-15 01:36:06,060 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 01:36:06,060 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-15 01:36:06,060 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-15 01:36:06,060 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-15 01:36:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 01:36:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-15 01:36:06,062 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-15 01:36:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-15 01:36:06,062 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 35 [2023-02-15 01:36:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:36:06,062 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-15 01:36:06,062 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-15 01:36:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-15 01:36:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 01:36:06,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:36:06,063 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-15 01:36:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 01:36:06,063 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-15 01:36:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:36:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -522865965, now seen corresponding path program 1 times [2023-02-15 01:36:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:36:06,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696816789] [2023-02-15 01:36:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:36:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:06,821 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-15 01:36:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:36:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696816789] [2023-02-15 01:36:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696816789] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:36:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141978827] [2023-02-15 01:36:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:36:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:36:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:36:06,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:36:06,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:36:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:36:06,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 01:36:07,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:36:07,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:36:07,104 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:36:07,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:36:07,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:36:07,186 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-15 01:36:07,219 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:36:07,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 01:36:07,349 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 01:36:07,349 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-15 01:36:07,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:36:07,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,429 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:07,430 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-15 01:36:07,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:36:07,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,459 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:07,460 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-15 01:36:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,487 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:36:07,487 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-15 01:36:07,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:36:07,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:36:07,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:36:07,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:07,705 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-15 01:36:07,852 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-15 01:36:07,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:36:08,160 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-15 01:36:08,165 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-15 01:36:16,703 WARN L233 SmtUtils]: Spent 6.13s 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-15 01:36:16,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:16,719 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-15 01:36:16,935 INFO L321 Elim1Store]: treesize reduction 152, result has 54.6 percent of original size [2023-02-15 01:36:16,935 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-15 01:36:16,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:16,962 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-15 01:36:16,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:16,987 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-15 01:36:38,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:38,937 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-15 01:36:38,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:36:38,959 INFO L321 Elim1Store]: treesize reduction 19, result has 54.8 percent of original size [2023-02-15 01:36:38,964 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-15 01:36:38,974 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-15 01:36:38,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:36:38,982 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-15 01:38:26,368 WARN L233 SmtUtils]: Spent 1.76m on a formula simplification. DAG size of input: 340 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:38:26,845 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 01:38:26,845 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-15 01:38:26,891 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-15 01:38:26,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141978827] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:38:26,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:38:26,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 52 [2023-02-15 01:38:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357652298] [2023-02-15 01:38:26,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:26,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-15 01:38:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-15 01:38:26,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2500, Unknown=4, NotChecked=0, Total=2756 [2023-02-15 01:38:26,895 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-15 01:38:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:29,043 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2023-02-15 01:38:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:38:29,046 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-15 01:38:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:29,046 INFO L225 Difference]: With dead ends: 101 [2023-02-15 01:38:29,046 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 01:38:29,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 117.4s TimeCoverageRelationStatistics Valid=656, Invalid=4032, Unknown=4, NotChecked=0, Total=4692 [2023-02-15 01:38:29,048 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 612 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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-15 01:38:29,048 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-15 01:38:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 01:38:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2023-02-15 01:38:29,050 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-15 01:38:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-15 01:38:29,050 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2023-02-15 01:38:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:29,050 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-15 01:38:29,051 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-15 01:38:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-15 01:38:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 01:38:29,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:29,051 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-15 01:38:29,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:38:29,257 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-15 01:38:29,258 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-15 01:38:29,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash -522865964, now seen corresponding path program 1 times [2023-02-15 01:38:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:29,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600172652] [2023-02-15 01:38:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:30,053 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-15 01:38:30,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:30,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600172652] [2023-02-15 01:38:30,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600172652] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:30,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181150862] [2023-02-15 01:38:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:30,069 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:38:30,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:38:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:30,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 01:38:30,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:30,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:38:30,351 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:38:30,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:38:30,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:38:30,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:38:30,477 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-15 01:38:30,483 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-15 01:38:30,518 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:38:30,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2023-02-15 01:38:30,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2023-02-15 01:38:30,698 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 01:38:30,698 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-15 01:38:30,716 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:38:30,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 01:38:30,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:30,797 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:38:30,798 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-15 01:38:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:30,811 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:38:30,812 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-15 01:38:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:30,838 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:38:30,838 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-15 01:38:30,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:30,849 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:38:30,849 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-15 01:38:30,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:30,874 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:38:30,875 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-15 01:38:30,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:30,882 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:38:30,882 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-15 01:38:31,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:38:31,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:31,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 45 [2023-02-15 01:38:31,085 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 01:38:31,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 25 [2023-02-15 01:38:31,107 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-15 01:38:31,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:31,272 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-15 01:38:31,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:31,628 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-15 01:38:33,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:33,734 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-15 01:38:33,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:33,744 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-15 01:38:33,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:33,758 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-15 01:38:34,337 INFO L321 Elim1Store]: treesize reduction 432, result has 46.0 percent of original size [2023-02-15 01:38:34,337 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-15 01:38:34,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:34,391 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-15 01:38:34,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 3954 treesize of output 3484 [2023-02-15 01:38:34,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:38:34,485 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-15 01:38:34,502 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-15 01:39:01,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:01,906 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-15 01:39:01,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:01,916 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-15 01:39:02,013 INFO L321 Elim1Store]: treesize reduction 86, result has 53.8 percent of original size [2023-02-15 01:39:02,014 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-15 01:39:02,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:39:02,030 INFO L321 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2023-02-15 01:39:02,031 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-15 01:39:02,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:02,056 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-15 01:39:02,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:02,082 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-15 01:39:02,098 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-15 01:39:03,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:03,027 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-15 01:39:03,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:03,037 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-15 01:39:03,054 INFO L321 Elim1Store]: treesize reduction 3, result has 76.9 percent of original size [2023-02-15 01:39:03,054 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-15 01:39:03,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:39:03,356 INFO L321 Elim1Store]: treesize reduction 203, result has 48.2 percent of original size [2023-02-15 01:39:03,356 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-15 01:39:03,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:03,377 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-15 01:39:03,385 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-15 01:39:03,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:03,417 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-15 01:39:03,429 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-15 01:39:07,096 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:39:07,096 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-15 01:39:07,135 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-15 01:39:07,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181150862] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:39:07,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:39:07,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 45 [2023-02-15 01:39:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484111971] [2023-02-15 01:39:07,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:07,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 01:39:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 01:39:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1761, Unknown=5, NotChecked=86, Total=2070 [2023-02-15 01:39:07,137 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-15 01:39:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:09,861 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-02-15 01:39:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 01:39:09,862 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-15 01:39:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:09,862 INFO L225 Difference]: With dead ends: 99 [2023-02-15 01:39:09,862 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 01:39:09,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=592, Invalid=3189, Unknown=5, NotChecked=120, Total=3906 [2023-02-15 01:39:09,863 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 535 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:09,863 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.6s Time] [2023-02-15 01:39:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 01:39:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2023-02-15 01:39:09,865 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-15 01:39:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-15 01:39:09,865 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 38 [2023-02-15 01:39:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:09,865 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-15 01:39:09,865 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-15 01:39:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-15 01:39:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:39:09,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:09,865 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-15 01:39:09,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:10,066 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-15 01:39:10,066 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-15 01:39:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1695206362, now seen corresponding path program 1 times [2023-02-15 01:39:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:10,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581302065] [2023-02-15 01:39:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:10,174 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-15 01:39:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581302065] [2023-02-15 01:39:10,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581302065] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076704793] [2023-02-15 01:39:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:10,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:10,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:10,176 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:10,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:39:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:10,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 01:39:10,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:10,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:10,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:10,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:10,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:39:10,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:10,422 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:39:10,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:39:10,427 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-15 01:39:10,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:10,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:39:10,537 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-15 01:39:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076704793] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:39:10,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:39:10,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 11 [2023-02-15 01:39:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682283550] [2023-02-15 01:39:10,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:39:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:39:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:39:10,538 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-15 01:39:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:10,646 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-15 01:39:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:39:10,646 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-15 01:39:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:10,647 INFO L225 Difference]: With dead ends: 100 [2023-02-15 01:39:10,647 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 01:39:10,647 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-15 01:39:10,647 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-15 01:39:10,647 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-15 01:39:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 01:39:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 69. [2023-02-15 01:39:10,648 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-15 01:39:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-02-15 01:39:10,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 40 [2023-02-15 01:39:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:10,649 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-02-15 01:39:10,649 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-15 01:39:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-02-15 01:39:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 01:39:10,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:10,649 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-15 01:39:10,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:10,850 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-15 01:39:10,850 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-15 01:39:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086933, now seen corresponding path program 1 times [2023-02-15 01:39:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:10,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758464260] [2023-02-15 01:39:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:11,292 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-15 01:39:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758464260] [2023-02-15 01:39:11,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758464260] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:11,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527154087] [2023-02-15 01:39:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:11,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:11,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:11,294 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:11,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 01:39:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:11,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 01:39:11,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:11,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:39:11,591 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:39:11,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 01:39:11,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:11,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 01:39:11,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:11,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 01:39:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:11,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 01:39:12,003 INFO L321 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-02-15 01:39:12,004 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-15 01:39:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:12,281 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-15 01:39:12,283 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-15 01:39:12,337 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-15 01:39:12,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:12,443 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:39:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:12,544 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-15 01:39:12,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:39:12,694 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-15 01:39:12,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527154087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:12,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:12,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [16] total 33 [2023-02-15 01:39:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742175642] [2023-02-15 01:39:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:12,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 01:39:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 01:39:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 01:39:12,695 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-15 01:39:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:14,013 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2023-02-15 01:39:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:39:14,018 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-15 01:39:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:14,018 INFO L225 Difference]: With dead ends: 119 [2023-02-15 01:39:14,018 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 01:39:14,019 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-15 01:39:14,019 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-15 01:39:14,019 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-15 01:39:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 01:39:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2023-02-15 01:39:14,021 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-15 01:39:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-02-15 01:39:14,021 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 42 [2023-02-15 01:39:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:14,021 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-02-15 01:39:14,021 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-15 01:39:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-02-15 01:39:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 01:39:14,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:14,021 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-15 01:39:14,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:14,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 01:39:14,227 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-15 01:39:14,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086934, now seen corresponding path program 1 times [2023-02-15 01:39:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:14,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963205682] [2023-02-15 01:39:14,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:14,886 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-15 01:39:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:14,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963205682] [2023-02-15 01:39:14,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963205682] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:14,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617359789] [2023-02-15 01:39:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:14,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:14,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:14,888 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:14,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:39:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:15,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-15 01:39:15,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:15,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:39:15,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:39:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:39:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:39:15,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:39:15,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:39:15,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:39:15,558 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-15 01:39:15,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,562 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-15 01:39:15,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-15 01:39:15,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 01:39:15,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-15 01:39:15,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:15,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 29 treesize of output 29 [2023-02-15 01:39:15,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 01:39:15,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 26 treesize of output 14 [2023-02-15 01:39:15,696 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-15 01:39:15,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:15,790 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-15 01:39:15,800 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 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|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 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|)))) (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 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|) 4)))) is different from false [2023-02-15 01:39:15,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:15,827 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-15 01:39:16,007 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= |c_ULTIMATE.start_dll_insert_#t~mem8#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_#t~mem8#1.base| 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|))) (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_#t~mem8#1.base| 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|) (+ |c_ULTIMATE.start_dll_insert_#t~mem8#1.offset| 1))) (forall ((v_prenex_49 (Array Int Int)) (v_prenex_48 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_#t~mem8#1.base| v_prenex_49) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_prenex_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 01:39:16,030 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_prenex_49 (Array Int Int)) (v_prenex_48 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_49) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_prenex_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (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))))) is different from false [2023-02-15 01:39:16,134 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_49 (Array Int Int)) (v_prenex_48 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_49) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 01:39:16,145 WARN L837 $PredicateComparison]: unable to prove that (and (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_prenex_49 (Array Int Int)) (v_prenex_48 (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_49) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_48) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (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-15 01:39:16,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2674 treesize of output 2326 [2023-02-15 01:39:16,185 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 7624 treesize of output 7188 [2023-02-15 01:39:16,195 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 7183 treesize of output 6991 [2023-02-15 01:39:16,202 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 6991 treesize of output 6943 [2023-02-15 01:39:16,210 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 6943 treesize of output 6815 [2023-02-15 01:39:16,219 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 6815 treesize of output 6719 [2023-02-15 01:39:16,227 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 6719 treesize of output 6527 [2023-02-15 01:39:16,234 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 6527 treesize of output 6431 [2023-02-15 01:39:16,241 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 6431 treesize of output 6407 [2023-02-15 01:39:16,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6407 treesize of output 6367 [2023-02-15 01:39:16,256 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 6367 treesize of output 6239 [2023-02-15 01:39:16,263 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 6239 treesize of output 6175 [2023-02-15 01:39:16,270 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 6175 treesize of output 6007